Affiliation:
1. School of Integrated Circuits Guangdong University of Technology Guangzhou 510006 China
Abstract
AbstractThis paper proposes a 256‐bit speed‐area‐efficient hardware elliptic curve point‐multiplication engine (ECPM‐engine) in GF(p) over generic Weierstrass curves, which is optimized by a new speed‐area‐efficient radix‐64 Montgomery modular multiplication (R64MMM) and a novel Montgomery ladder scheduling. The R64MMM calls one 129‐bit adder and one (64x64+129)‐bit multiply‐accumulator (64‐129‐MAC) in parallel to make a trade‐off between speed and area. The novel Montgomery ladder scheduling is used to improve the utilization of MAC in ECPM operation. In this ECPM‐engine, both MAC utilization in R64MMM operations and R64MMM utilization in ECPM operations are close to 100%. The result shows that the proposed ECPM‐engine consumes 72k gates when the clock frequency is 714 MHz with a 90 nm standard cell library, and it computes one 256‐bit ECPM in 0.14 ms.
Funder
National Natural Science Foundation of China
Publisher
Institution of Engineering and Technology (IET)
Reference15 articles.
1. An energy‐efficient dual‐field dlliptic curve cryptography processor for Internet of Things applications;Yeh L.Y.;IEEE Trans. Circuits Syst. II.,2020
2. Kerry C.F. Gallagher P.D.:FIPS pub 186‐4 fedral information processing standards publication.Digital Signature Standard (DSS)(2013)
3. High-Speed and Unified ECC Processor for Generic Weierstrass Curves over GF(p) on FPGA
4. An efficient hardware implementation of the elliptic curve cryptographic processor over prime field,
5. An Efficient and Flexible Hardware Implementation of the Dual-Field Elliptic Curve Cryptographic Processor