Supersingular Isogeny Diffie-Hellman Key Exchange on 64-Bit ARM
- 6 July 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 16 (5) , 902-912
Abstract
We present an efficient implementation of the supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol on 64-bit ARMv8 processors for 125and 160-bit post-quantum security levels. We analyze the use of both affine and projective SIDH formulas and provide a comprehensive analysis of both approaches based on the inversion-to-multiplication ratio. Implementation results show that regardless of security concerns, affine SIDH is competitive with the projective coordinates implementation, and even outperforms projective implementation in the final round of SIDH; however, projective SIDH shows better overall performance for the whole key exchange protocol. Notably, over larger finite fields, using optimized field multiplication leads to the much better performance of projective compared to affine formulas. We integrate our optimized software into the open quantum-safe OpenSSL library and compare our software with other available post-quantum primitives. The benchmark results on ARMv8 demonstrate speedup of up to 5X over the generic version of SIDH implementation which is available inside the OQS library for the same quantum security level. We observe that our highly-optimized implementation still suffers from a large number of operations for computing isogenies of elliptic curves. However, in terms of communication overhead, supersingular isogeny-based cryptosystem provides significantly smaller key size compared to its counterparts.Keywords
Funding Information
- National Science Foundation (CNS-1661557)
- NIST (60NANB16D246)
This publication has 25 references indexed in Scilit:
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies2011
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves2011
- Claw finding algorithms using quantum walkTheoretical Computer Science, 2009
- Cryptographic Hash Functions from Expander GraphsJournal of Cryptology, 2007
- Promised and Distributed Quantum Search2005
- Projective Coordinates LeakLecture Notes in Computer Science, 2004
- NTRU: A ring-based public key cryptosystem1998
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms1996
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- Endomorphisms of abelian varieties over finite fieldsInventiones Mathematicae, 1966