Design and implementation of a constant-time FPGA accelerator for fast elliptic curve cryptography

Warning The system is temporarily closed to updates for reporting purpose.

Ay, Atıl Utku and Öztürk, Erdinç and Henriquez, Francisco Rodriguez and Savaş, Erkay (2016) Design and implementation of a constant-time FPGA accelerator for fast elliptic curve cryptography. In: International Conference on Reconfigurable Computing and FPGAs (ReConFig), Cancun, Mexico

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1109/ReConFig.2016.7857163


In this paper we present a scalar multiplication hardware architecture that computes a constant-time variable-base point multiplication over the Galbraith-Lin-Scott (GLS) family of binary elliptic curves. Our hardware design is especially tailored for the quadratic extension field F-22n ; with n = 127; which allows us to attain a security level close to 128 bits. We explore extensively the usage of digit-based and Karatsuba multipliers for performing the quadratic field arithmetic associated to GLS elliptic curves and report the area and time performance obtained by these two types of multipliers. Targeting a XILINX KINTEX-7 FPGA device, we report a hardware implementation of our design that achieves a delay of just 3.98 mu s for computing one scalar multiplication. This allows us to claim the current speed record for this operation at or around the 128-bit security level for any hardware or software realization reported in the literature.

Item Type:Papers in Conference Proceedings
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:32325
Deposited By:Erkay Savaş
Deposited On:09 Jun 2017 15:13
Last Modified:09 Jun 2017 15:13

Repository Staff Only: item control page