Reference : Parallel Implementation of SM2 Elliptic Curve Cryptography on Intel Processors with AVX2
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/46416
Parallel Implementation of SM2 Elliptic Curve Cryptography on Intel Processors with AVX2
English
Huang, Junhao [Nanjing University of Aeronautics and Astronautics > College of Computer Science and Technology]
Liu, Zhe [Nanjing University of Aeronautics and Astronautics > College of Computer Science and Technology > > ; State Key Laboratory of Cryptology]
Hu, Zhi [Central South University]
Groszschädl, Johann mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
Nov-2020
Information Security and Privacy, 25th Australasian Conference, ACISP 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings
Liu, Joseph K.
Cui, Hui
Springer Verlag
Lecture Notes in Computer Science, volume 12248
204-224
Yes
International
978-3-030-55303-6
25th Australasian Conference on Information Security and Privacy (ACISP 2020)
from 30-11-2020 to 02-12-2020
Perth
Australia
[en] Elliptic Curve Cryptography ; SM2 Standard ; Co- Z Jacobian Point Arithmetic ; Prime-Field Arithmetic ; Single Instruction Multiple Data (SIMD) ; Advanced Vector Extension 2 (AVX2)
[en] This paper presents an efficient and secure implementation of SM2, the Chinese elliptic curve cryptography standard that has been adopted by the International Organization of Standardization (ISO) as ISO/IEC 14888-3:2018. Our SM2 implementation uses Intel’s Advanced Vector Extensions version 2.0 (AVX2), a family of three-operand SIMD instructions operating on vectors of 8, 16, 32, or 64-bit data elements in 256-bit registers, and is resistant against timing attacks. To exploit the parallel processing capabilities of AVX2, we studied the execution flows of Co-Z Jacobian point arithmetic operations and introduce a parallel 2-way Co-Z addition, Co-Z conjugate addition, and Co-Z ladder algorithm, which allow for fast Co-Z scalar multiplication. Furthermore, we developed an efficient 2-way prime-field arithmetic library using AVX2 to support our Co-Z Jacobian point operations. Both the field and the point operations utilize branch-free (i.e. constant-time) implementation techniques, which increase their ability to resist Simple Power Analysis (SPA) and timing attacks. Our software for scalar multiplication on the SM2 curve is, to our knowledge, the first constant-time implementation of the Co-Z based ladder that leverages the parallelism of AVX2.
http://hdl.handle.net/10993/46416
10.1007/978-3-030-55304-3_11
https://link.springer.com/chapter/10.1007/978-3-030-55304-3_11

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
ACISP2020.pdfAuthor postprint376.98 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.