Reference : High-Throughput Elliptic Curve Cryptography Using AVX2 Vector Instructions
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/48810
High-Throughput Elliptic Curve Cryptography Using AVX2 Vector Instructions
English
Cheng, Hao mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > APSIA >]
Groszschädl, Johann mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
Tian, Jiaqi mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > APSIA >]
Roenne, Peter mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > APSIA >]
Ryan, Peter Y A mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
Oct-2020
Selected Areas in Cryptography, 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers
Dunkelman, Orr
Jacobson Jr., Michael J.
O'Flynn, Colin
Springer Verlag
Lecture Notes in Computer Science, volume 12804
698-719
Yes
International
978-3-030-81651-3
27th International Conference on Selected Areas in Cryptography (SAC 2020)
2020-10-19 to 2020-10-23
Halifax, NS
Canada
[en] Throughput-Optimized Cryptography ; Elliptic Curve Cryptography ; Curve25519 ; Single Instruction Multiple Data (SIMD) ; Advanced Vector Extension 2 (AVX2)
[en] Single Instruction Multiple Data (SIMD) execution engines like Intel’s Advanced Vector Extensions 2 (AVX2) offer a great potential to accelerate elliptic curve cryptography compared to implementations using only basic x64 instructions. All existing AVX2 implementations of scalar multiplication on e.g. Curve25519 (and alternative curves) are optimized for low latency. We argue in this paper that many real-world applications, such as server-side SSL/TLS handshake processing, would benefit more from throughput-optimized implementations than latency-optimized ones. To support this argument, we introduce a throughput-optimized AVX2 implementation of variable-base scalar multiplication on Curve25519 and fixed-base scalar multiplication on Ed25519. Both implementations perform four scalar multiplications in parallel, where each uses a 64-bit element of a 256-bit vector. The field arithmetic is based on a radix-2^29 representation of the field elements, which makes it possible to carry out four parallel multiplications modulo a multiple of p=2^255−19 in just 88 cycles on a Skylake CPU. Four variable-base scalar multiplications on Curve25519 require less than 250,000 Skylake cycles, which translates to a throughput of 32,318 scalar multiplications per second at a clock frequency of 2 GHz. For comparison, the to-date best latency-optimized AVX2 implementation has a throughput of some 21,000 scalar multiplications per second on the same Skylake CPU.
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA)
European Commission - EC
http://hdl.handle.net/10993/48810
10.1007/978-3-030-81652-0_27
https://link.springer.com/chapter/10.1007/978-3-030-81652-0_27
H2020 ; 779391 - FutureTPM - Future Proofing the Connected World: A Quantum-Resistant Trusted Platform Module

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
SAC2020.pdfAuthor postprint461.16 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.