Fourq on FPGA: New hardware speed records for elliptic curve cryptography over large prime characteristic fields

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

doi:10.1007/978-3-662-53140-2_25

Fourq on FPGA: New hardware speed records for elliptic curve cryptography over large prime characteristic fields

Kimmo Järvinen, Andrea Miele, Reza Azarderakhsh, Patrick Longa^*

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

20 Citations (Scopus)

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.

Original language	English
Title of host publication	Cryptographic Hardware and Embedded Systems - 18th International Conference, CHES 2016, Proceedings
Publisher	Springer
Pages	517-537
Number of pages	21
Volume	9813
ISBN (Print)	9783662531396
DOIs	https://doi.org/10.1007/978-3-662-53140-2_25
Publication status	Published - 2016
MoE publication type	A4 Conference publication
Event	International Conference on Cryptographic Hardware and Embedded Systems - Santa Barbara, United States Duration: 17 Aug 2016 → 19 Aug 2016 Conference number: 18

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9813
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Conference

Conference	International Conference on Cryptographic Hardware and Embedded Systems
Abbreviated title	CHES
Country/Territory	United States
City	Santa Barbara
Period	17/08/2016 → 19/08/2016

Keywords

Constant-time
Efficient hardware implementation
Elliptic curves
FourQ
FPGA
Simple side-channel attacks

Access to Document

10.1007/978-3-662-53140-2_25

Cite this

Järvinen, K., Miele, A., Azarderakhsh, R., & Longa, P. (2016). Fourq on FPGA: New hardware speed records for elliptic curve cryptography over large prime characteristic fields. In Cryptographic Hardware and Embedded Systems - 18th International Conference, CHES 2016, Proceedings (Vol. 9813, pp. 517-537). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9813). Springer. https://doi.org/10.1007/978-3-662-53140-2_25

Järvinen, Kimmo ; Miele, Andrea ; Azarderakhsh, Reza et al. / Fourq on FPGA : New hardware speed records for elliptic curve cryptography over large prime characteristic fields. Cryptographic Hardware and Embedded Systems - 18th International Conference, CHES 2016, Proceedings. Vol. 9813 Springer, 2016. pp. 517-537 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ca08efe2892646d2907dc358e614c0a3,

title = "Fourq on FPGA: New hardware speed records for elliptic curve cryptography over large prime characteristic fields",

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{\textquoteright}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.",

keywords = "Constant-time, Efficient hardware implementation, Elliptic curves, FourQ, FPGA, Simple side-channel attacks",

author = "Kimmo J{\"a}rvinen and Andrea Miele and Reza Azarderakhsh and Patrick Longa",

year = "2016",

doi = "10.1007/978-3-662-53140-2\_25",

language = "English",

isbn = "9783662531396",

volume = "9813",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "517--537",

booktitle = "Cryptographic Hardware and Embedded Systems - 18th International Conference, CHES 2016, Proceedings",

address = "Germany",

note = "International Conference on Cryptographic Hardware and Embedded Systems, CHES ; Conference date: 17-08-2016 Through 19-08-2016",

}

Järvinen, K, Miele, A, Azarderakhsh, R & Longa, P 2016, Fourq on FPGA: New hardware speed records for elliptic curve cryptography over large prime characteristic fields. in Cryptographic Hardware and Embedded Systems - 18th International Conference, CHES 2016, Proceedings. vol. 9813, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9813, Springer, pp. 517-537, International Conference on Cryptographic Hardware and Embedded Systems, Santa Barbara, United States, 17/08/2016. https://doi.org/10.1007/978-3-662-53140-2_25

Fourq on FPGA: New hardware speed records for elliptic curve cryptography over large prime characteristic fields. / Järvinen, Kimmo; Miele, Andrea; Azarderakhsh, Reza et al.
Cryptographic Hardware and Embedded Systems - 18th International Conference, CHES 2016, Proceedings. Vol. 9813 Springer, 2016. p. 517-537 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9813).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Fourq on FPGA

T2 - International Conference on Cryptographic Hardware and Embedded Systems

AU - Järvinen, Kimmo

AU - Miele, Andrea

AU - Azarderakhsh, Reza

AU - Longa, Patrick

N1 - Conference code: 18

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Constant-time

KW - Efficient hardware implementation

KW - Elliptic curves

KW - FourQ

KW - FPGA

KW - Simple side-channel attacks

UR - https://www.scopus.com/pages/publications/84981333754

U2 - 10.1007/978-3-662-53140-2_25

DO - 10.1007/978-3-662-53140-2_25

M3 - Conference article in proceedings

AN - SCOPUS:84981333754

SN - 9783662531396

VL - 9813

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 517

EP - 537

BT - Cryptographic Hardware and Embedded Systems - 18th International Conference, CHES 2016, Proceedings

PB - Springer

Y2 - 17 August 2016 through 19 August 2016

ER -

Järvinen K, Miele A, Azarderakhsh R, Longa P. Fourq on FPGA: New hardware speed records for elliptic curve cryptography over large prime characteristic fields. In Cryptographic Hardware and Embedded Systems - 18th International Conference, CHES 2016, Proceedings. Vol. 9813. Springer. 2016. p. 517-537. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-53140-2_25

Fourq on FPGA: New hardware speed records for elliptic curve cryptography over large prime characteristic fields

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this