NEON-SIDH: Efficient Implementation of Supersingular Isogeny Diffie-Hellman Key Exchange Protocol on ARM

被引:59
作者
Koziel, Brian [1 ]
Jalali, Amir [2 ]
Azarderakhsh, Reza [3 ,4 ]
Jao, David [5 ]
Mozaffari-Kermani, Mehran [6 ]
机构
[1] Texas Instruments Inc, Wylie, TX 75098 USA
[2] RIT, CE Dept, Rochester, NY USA
[3] CEECS Dept, Boca Raton, FL USA
[4] I SENSE FAU, Boca Raton, FL USA
[5] Univ Waterloo, C&O Dept, Waterloo, ON, Canada
[6] RIT, EME Dept, Rochester, NY USA
来源
CRYPTOLOGY AND NETWORK SECURITY, CANS 2016 | 2016年 / 10052卷
基金
美国国家科学基金会;
关键词
Elliptic curve cryptography; Post-quantum cryptography; Isogeny-based cryptosystems; ARM embedded processors; Finite-field arithmetic; Assembly implementation; MULTIPLICATION;
D O I
10.1007/978-3-319-48965-0_6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:88 / 103
页数:16
相关论文
共 20 条
[1]  
[Anonymous], 2007, EXPLICIT FORMULAS DA
[2]  
[Anonymous], 2014, TECHNICAL REPORT
[3]  
[Anonymous], 2015465 CRYPT EPRINT
[4]  
[Anonymous], TECHNICAL REPORT
[5]  
[Anonymous], 1992, The arithmetic of elliptic curves
[6]   A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms [J].
Azarderakhsh, Reza ;
Karabina, Koray .
IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (10) :2614-2619
[7]  
Azarderakhsh Reza., 2016, Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, AsiaPKC'16, page, P1
[8]  
Chen L., 2016, Technical Report. NIST IR 8105
[9]   Efficient Algorithms for Supersingular Isogeny Diffie-Hellman [J].
Costello, Craig ;
Longa, Patrick ;
Naehrig, Michael .
ADVANCES IN CRYPTOLOGY - CRYPTO 2016, PT I, 2016, 9814 :572-601
[10]   Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies [J].
De Feo, Luca ;
Jao, David ;
Plut, Jerome .
JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2014, 8 (03) :209-247