Cryptology ePrint Archive: Report 2016/645

FourQNEON: Faster Elliptic Curve Scalar Multiplications on ARM Processors

Patrick Longa

Abstract: We present a high-speed, high-security implementation of the recently proposed elliptic curve FourQ (ASIACRYPT 2015) for 32-bit ARM processors with NEON support. Exploiting the versatile and compact arithmetic of this curve, we design a vectorized implementation that achieves high-performance across a large variety of ARM platforms. Our software is fully protected against timing and cache attacks, and showcases the impressive speed of FourQ when compared with other curve-based alternatives. For example, one single variable-base scalar multiplication is computed in about 235,000 Cortex-A8 cycles or 132,000 Cortex-A15 cycles which, compared to the results of the fastest genus 2 Kummer and Curve25519 implementations on the same platforms, offer speedups between 1.3x-1.7x and between 2.1x-2.4x, respectively. In comparison with the NIST standard curve K-283, we achieve speedups above 4x and 5.5x.

Category / Keywords: implementation / Elliptic curves, FourQ, ARM, NEON, vectorization, efficient software implementation, constant-time.

Original Publication (in the same form): SAC 2016 (to appear)

Date: received 21 Jun 2016, last revised 14 Jul 2016

Contact author: plonga at microsoft com

Available format(s): PDF | BibTeX Citation

Version: 20160714:235419 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]