Cryptology ePrint Archive: Report 2016/569

FourQ on FPGA: New Hardware Speed Records for Elliptic Curve Cryptography over Large Prime Characteristic Fields

Kimmo Järvinen and Andrea Miele and Reza Azarderakhsh and Patrick Longa

Abstract: We present fast and compact implementations of FourQ (ASIACRYPT 2015) on field-programmable gate arrays (FPGAs), and demonstrate, for the first time, the high efficiency of this new elliptic curve on reconfigurable hardware. By adapting FourQ's algorithms to hardware, we design FPGA-tailored architectures that are significantly faster than any other ECC alternative over large prime characteristic fields. For example, we show that our single-core and multi-core implementations can compute at a rate of 6389 and 64730 scalar multiplications per second, respectively, on a Xilinx Zynq-7020 FPGA, which represent factor-2.5 and 2 speedups in comparison with the corresponding variants of the fastest Curve25519 implementation on the same device. These results show the potential of deploying FourQ on hardware for high-performance and embedded security applications. All the presented implementations exhibit regular, constant-time execution, protecting against timing and simple side-channel attacks.

Category / Keywords: implementation / Elliptic curves, FourQ, FPGA, efficient hardware implementation, constant-time, simple side-channel attacks

Original Publication (in the same form): IACR-CHES-2016

Date: received 3 Jun 2016

Contact author: plonga at microsoft com

Available format(s): PDF | BibTeX Citation

Version: 20160603:181935 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]