High-performance Implementation of Curve25519 on GPU

doi:10.3969/j.issn.1671-1122.2017.09.029

Netinfo Security ›› 2017, Vol. 17 ›› Issue (9): 122-127.doi: 10.3969/j.issn.1671-1122.2017.09.029

• Orginal Article • Previous Articles Next Articles

High-performance Implementation of Curve25519 on GPU

Juanjuan CHENG^1,^2,³, Fangyu ZHENG^1,²(), Jingqiang LIN^1,², Jiankuo DONG^1,^2,³

1.State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China
2.Data Assurance and Communication Security Research Center, Chinese Academy of Sciences, Beijing 100093, China
3.College of Cyberspace Security, University of Chinese Academy of Sciences, Beijing100049, China

Received:2017-08-01 Online:2017-09-20 Published:2020-05-12

Abstract

Abstract:

Widely used in a large range of Internet security protocols such as TLS/SSL, key exchange provides a method to establish a shared secret between two parties in unprotected channel. Among the key exchange algorithms Elliptic-Curve Diffie- Hellman (ECDH) is currently preferred and popularized by the industry. The prevailing ECDH employs NIST P Curve as the underlying elliptic curve, however, with the requirement of high performance and questioning of its security, in January, 2016, IETF officially applied Curve25519 to key exchange in RFC 7748, called X25519 key exchange protocol. And later, many mainstream open-source projects recommended X25519 as the default key exchange protocol. The bottleneck of X25519 lies in the scalar multiplication of Curve25519.This contribution proposed a GPU-accelerated Curve25519 implementation, having yielded a throughput of 1.38 million scalar multiplication per second in NVIDIA GeForce GTX 780Ti, 5.6 times faster than the previous fastest work.

Key words: graphic processing unit (GPU), elliptic curves, Curve25519, key exchange

CLC Number:

TP393

Juanjuan CHENG, Fangyu ZHENG, Jingqiang LIN, Jiankuo DONG. High-performance Implementation of Curve25519 on GPU[J]. Netinfo Security, 2017, 17(9): 122-127.

Figures/Tables 4

References 24

[1]	MILLER V S. Use of Elliptic Curves in Cryptography[EB/OL]. , 1985.
[2]	KOBLITZ N.Elliptic curve cryptosystems[J]. Mathematics of computation, 1987, 48(177): 203-209.
[3]	BERNSTEIN D J, LANGGE T.Failures in NIST’s ECC Standards[EB/OL]., 2015.
[4]	BERNSTEIN D J.Curve25519: New Diffie-Hellman Speed Records[EB/OL]. , 2006.
[5]	LANGLEY A, HANBURG M.Elliptic Curves For Security[J].Order, 2016(500): 39081.
[6]	BERNSTEIN D J.25519 Naming[EB/OL]., 2014
[7]	VIEGA J, MESSIER M, CHANDRA P.Network Security with OpenSSL: Cryptography forSecure Communications[M]. New York: “O’Reilly Media, Inc.”, 2002.
[8]	DÜLL M, HAASE B, HINTERWǞLDER G,et al. High-Speed Curve25519 on 8-bit, 16-bit, and 32-bit Microcontrollers[J]. Designs, Codes and Cryptography, 2015, 77(2-3): 493-514.
[9]	FAZ-HERNÁNDEZ A, LÓPEZ J. Fast Implementation of Curve25519 Using AVX2[EB/OL]. .1007/978-3-319-22174-8_18, 2015.
[10]	MAHE E, CHAUVET J M.Fast GPGPU-Based Elliptic Curve Scalar Multiplication[J]. IACR Cryptology ePrint Archive, 2014(1): 198.
[11]	BERNSTEIN D J, CHEN T R, CHENG C M, et al. ECM on Graphics Cards[EB/OL]. ,2009.
[12]	BERNSTEIN D J, CHEN HC, CHEN MS, et al.The Billion-Mulmod-Per-Second PC[EB/OL]., 2009.
[13]	GIORGI P, IZARD T, TISSERAND A.Comparison of Modular Arithmetic Algorithms on GPUs[EB/OL]., 2009.
[14]	ANTÃO S, BAJARD Jean-Claude, and SOUSA Leonel. Elliptic Curve Point Multiplication on GPUs[EB/OL]. , 2010.
[15]	PU S, LIU J C. EAGL: an Elliptic Curve Arithmetic GPU-Based Library for Bilinear Pairing[EB/OL]., 2013.
[16]	SZERWINSKI R,GÜNEYSU T. Exploiting the Power of GPUs for Asymmetric Cryptography[J]. Cryptographic Hardware and Embedded Systems-CHES2008(1):79-99.
[17]	PAN W, ZHENG F, ZHAO Y, et al.An Efficient Elliptic Curve Cryptography Signature Server with GPU Acceleration[J]. IEEE Transactions on Information Forensics and Security, 2017, 12(1): 111-122.
[18]	BROWN M, HANKERSON D, LÓPEZ J, et al. Software Implementation of the NIST Elliptic Curves over Prime Fields[J]. Topics in Cryptology—CT-RSA2001(1):250-265.
[19]	ZHANG D, BAI G. High-Performance Implementation of SM2 Based on FPGA[EB/OL]., 2016.
[20]	MONTGOMERY P L.Speeding the Pollard and Elliptic Curve Methods of Factorization[J]. Mathematics of computation, 1987, 48(177): 243-264.
[21]	BERNSTEIN D J, BIRKNER P, JOYE M, et al. Twisted Edwards Curves[EB/OL]., 2008.
[22]	BERNSTEIN D J, LANGE T. FasterAddition and Doubling on Elliptic Curves[EB/OL], 2007.
[23]	NVIDIA C. CUDA C Programming Guide[EB/OL]., 2013-6-23.
[24]	ZHENG F, PAN W, LIN J, et al. Exploiting the Potential of GPUs for Modular Multiplication in ECC[EB/OL]., 2014.

High-performance Implementation of Curve25519 on GPU

RichHTML

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 4

References 24

Related Articles 3

Recommended Articles

Metrics

Comments

[1]	Zhe LI, Yiliang HAN, Yu LI. A Key Exchange Cryptosystem Based on Polar Codes [J]. Netinfo Security, 2019, 19(10): 84-90.
[2]	Weiqing YOU, Xiaoming CHEN, Jian QI. Research on a Kind of Anti-quantum Computing Public Key Cryptosystem [J]. Netinfo Security, 2017, 17(4): 53-60.
[3]	LU Siqi, FAN Shuhui, HAN Xu, CHENG Qingfeng. A Leakage Resilient Authenticated Key Exchange Protocol Based on the CAFL Model [J]. 信息网络安全, 2016, 16(4): 31-37.