NEON-SIDH: Efficient implementation of supersingular isogeny diffie-hellman key exchange protocol on ARM

Citation data:

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 10052 LNCS, Page: 88-103

Publication Year:
Usage 7
Abstract Views 7
Captures 15
Readers 15
Citations 11
Citation Indexes 11
Repository URL:
Koziel, Brian; Jalali, Amir; Azarderakhsh, Reza; Jao, David; Mozaffari Kermani, Mehran
Springer Nature
Mathematics; Computer Science; elliptic curve cryptography; post-quantum cryptography; isogeny-based cryptosystems; ARM embedded processors; finite-field arithmetic; assembly implementation
conference paper description
We investigate the efficiency of implementing the Jao and De Feo isogeny-based post-quantum key exchange protocol (from PQCrypto 2011) on ARM-powered embedded platforms. In this work we propose new primes to speed up constant-time finite field arithmetic and perform isogenies quickly. Montgomery multiplication and reduction are employed to produce a speedup of 3 over the GNU Multiprecision Library. We analyze the recent projective isogeny formulas presented in Costello et al. (Crypto 2016) and conclude that affine isogeny formulas are much faster in ARM devices. We provide fast affine SIDH libraries over 512, 768, and 1024-bit primes. We provide timing results for emerging embedded ARM platforms using the ARMv7A architecture for the 85-, 128-, and 170-bit quantum security levels. Our assembly-optimized arithmetic cuts the computation time for the protocol by 50% in comparison to our portable C implementation and performs approximately 3 times faster than the only other ARMv7 results found in the literature. The goal of this paper is to show that isogeny-based cryptosystems can be implemented further and be used as an alternative to classical cryptosystems on embedded devices.