Treffer: NIRECP: An ECC Processor Over 256‐Bit NIST Prime Field Using New Iterative Reduction.

Fast modular reduction algorithm is an effective method for improving computational performance in elliptic curve cryptography (ECC), specifically in the modular multiplication (MM) operation. In this paper, we propose an ECC Processor over a 256‐bit NIST prime field using new iterative reduction (NIRECP). First, an optimized fast modular reduction mapping of 256‐bit NIST prime (OFM‐256NIST) method is proposed to reduce the area of conventional fast modular reduction. Second, based on OFM‐256NIST method, we design a three‐level iteration and compression (TL‐IC) hardware architecture, which aims to reduce the area‐latency of modular multiplication–addition (MMA) over 256‐bit NIST prime field. Finally, the NIRECP is proposed, which includes a new suitable elliptic curve point multiplication (ECPM) scheduling for TL‐IC. The NIRECP is implemented on Virtex‐7 FPGA and synthesized by 180‐nm standard cell library, respectively. The results show that the NIRECP performs one ECPM in 0.127 ms with 4886 LUTs, 16 DSPs on FPGA, and 0.076 ms with 103k gates on ASIC. [ABSTRACT FROM AUTHOR]