A High-Speed Elliptic Curve Cryptographic Processor for Generic Curves over $$\mathrm{GF}(p)$$

DOI10.1007/978-3-662-43414-7_21zbMath1362.94040OpenAlexW1440563447MaRDI QIDQ2949543

Yuan Ma, Zongbin Liu, Wuqiong Pan, Jiwu Jing

Publication date: 1 October 2015

Published in: Selected Areas in Cryptography -- SAC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43414-7_21

zbMATH Keywords

FPGADSPhigh-speedECCMontgomery multiplier

Mathematics Subject Classification ID

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

Related Items (2)

A HDL generator for flexible and efficient finite-field multipliers on FPGAs ⋮ Efficient FPGA design of exception-free generic elliptic curve cryptosystems

This page was built for publication: A High-Speed Elliptic Curve Cryptographic Processor for Generic Curves over $$\mathrm{GF}(p)$$