A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$

DOI10.1007/978-3-642-15031-9_4zbMath1297.94074OpenAlexW1517364441MaRDI QIDQ3583440

Nicolas Guillermin

Publication date: 17 August 2010

Published in: Cryptographic Hardware and Embedded Systems, CHES 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15031-9_4

zbMATH Keywords

elliptic curveFPGAprime fieldRNShigh speed

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (4)

Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ RNS arithmetic in 𝔽 pk and application to fast pairing computation ⋮ Efficient FPGA design of exception-free generic elliptic curve cryptosystems

This page was built for publication: A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$