Cryptology ePrint Archive: Report 2020/797

Fast, Small, and Area-Time Efficient Architectures for Key-Exchange on Curve25519

Mojtaba Bisheh Niasar and Rami El Khatib and Reza Azarderakhsh and Mehran Mozaffari-Kermani

Abstract: Abstract--- This paper demonstrates fast and compact implementations of Elliptic Curve Cryptography (ECC) for efficient key agreement over Curve25519. Curve25519 has been recently adopted as a key exchange method for several applications such as connected small devices as well as cloud, and included in the National Institute of Standards and Technology (NIST) recommendations for public key cryptography. This paper presents three different performance level designs including lightweight, area-time efficient, and high-performance architectures. Lightweight hardware implementations are used for several Internet of Things (IoT) applications due to their resources being at premium. Our lightweight architecture utilizes 90% less resources compared to the best previous work while it is still more optimized in term of A\cdot T (area\timestime). For efficient implementation from either time or utilized resources, our area-time efficient architecture can establish almost 7,000 key sessions per second which is 64% faster than the previous works. The area-time efficient architecture uses well scheduled interleaved multiplication combined with a reduction algorithm. Additionally, we offer a fast architecture for high performance applications based on the 4-level Karatsuba method and Carry-Compact Addition (CCA). Our high-performance architecture also outperforms previous work in terms of A\cdot T. The results show 9% and 29% improvement in A\cdot T and A_{d}\cdot T (DSP_count\timestime), respectively. All architectures are variable-base-point implemented on the Xilinx Zynq-7020 FPGA family where performance and implementation metrics are reported and compared. Finally, various side-channel attack countermeasures are embedded in the proposed architectures.

Category / Keywords: implementation / Curve25519, elliptic curve Diffie-Hellman (ECDH), FPGA, point multiplication

Original Publication (in the same form): https://ieeexplore.ieee.org/

Date: received 25 Jun 2020

Contact author: mbishehniasa2019 at fau edu,razarderakhsh@fau edu

Available format(s): PDF | BibTeX Citation

Version: 20200627:185636 (All versions of this report)

Short URL: ia.cr/2020/797


[ Cryptology ePrint archive ]