ECC Coprocessor Over a NIST Prime Field Using Fast Partial Montgomery Reduction
- 24 December 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 68 (3) , 1206-1216
Abstract
Montgomery reduction is a well-known optimization technique for modular reduction over prime fields. However, it has rarely been used for national institute of standards and technology (NIST) prime fields, because the special structure of NIST primes enables fast reduction that requires fewer computations than Montgomery reduction. In this study, we rediscover the Montgomery reduction for NIST primes and propose a new modular reduction method by applying partial modular reduction to Montgomery reduction. Using this new modular reduction method and other optimization techniques, such as pipelining and parallel processing, we propose an efficient elliptic curve cryptography (ECC) coprocessor over NIST prime fields. The implementation results indicate that the proposed coprocessor can perform one elliptic curve point multiplication in 0.055 ms with only 194.7 k gate counts. This is a considerably higher speed per area compared to previous research.Keywords
Funding Information
- Research Grant of Pukyong National University (2020)
This publication has 17 references indexed in Scilit:
- Low-Complexity Elliptic Curve Cryptography Processor Based on Configurable Partial Modular Reduction Over NIST Prime FieldsIEEE Transactions on Circuits and Systems II: Express Briefs, 2017
- High‐performance elliptic curve cryptography processor over NIST prime fieldsIET Computers & Digital Techniques, 2016
- An Efficient and Flexible Hardware Implementation of the Dual-Field Elliptic Curve Cryptographic ProcessorIEEE Transactions on Industrial Electronics, 2016
- Ultra high-performance ASIC implementation of SM2 with power-analysis resistance2015
- Ultra High-Speed SM2 ASIC Implementation2014
- A High-Performance Elliptic Curve Cryptographic Processor for General Curves Over ${\rm GF}(p)$ Based on a Systolic Arithmetic UnitIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2007
- Hardware Implementation of Finite-Field DivisionActa Applicandae Mathematicae, 2006
- Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems1999
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985