Four\(\mathbb {Q}\) on FPGA: new hardware speed records for elliptic curve cryptography over large prime characteristic fields

DOI10.1007/978-3-662-53140-2_25zbMath1411.94068OpenAlexW2474056434MaRDI QIDQ1695999

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

Publication date: 14 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-53140-2_25

zbMATH Keywords

elliptic curvesFPGAconstant-timeefficient hardware implementationfour\(\mathbb {Q}\)simple side-channel attacks

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Speeding up regular elliptic curve scalar multiplication without precomputation

This page was built for publication: Four\(\mathbb {Q}\) on FPGA: new hardware speed records for elliptic curve cryptography over large prime characteristic fields