A Scalable Digit-Parallel Polynomial Multiplier Architecture for NIST-Standardized Binary Elliptic Curves
Open Access
- 24 April 2022
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 12 (9) , 4312
Abstract
This work presents a scalable digit-parallel finite field polynomial multiplier architecture with a digit size of 32 bits for NIST-standardized binary elliptic fields. First, a dedicated digit-parallel architecture is proposed for each binary field recommended by NIST, i.e., and 571. Then, a scalable architecture having support for all variants of binary fields of elliptic curves is proposed. For performance investigation, we have compared dedicated multiplier architectures with scalable design. After this, the dedicated and scalable architectures are compared with the most relevant state-of-the-art multipliers. All multiplier architectures are implemented in Verilog HDL using the Vivado IDE tool. The implementation results are reported on a 28 nm Virtex-7 FPGA technology. The dedicated multipliers utilize slices of 1182 (for ), 1451 (for ), 1589 (for ), 2093 (for ) and 3451 (for ). Moreover, our dedicated designs can operate at a maximum frequency of 500, 476, 465, 451 and 443 MHz. Similarly, for all supported binary fields, our scalable architecture (i) utilizes 3753 slices, (ii) achieves 305 MHz clock frequency, (iii) takes 0.013 μs for one finite field multiplication and (iv) consumes 3.905 W power. The proposed scalable digit-parallel architecture is more area-efficient than most recent state-of-the-art multipliers. Consequently, the reported results and comparison to the state of the art reveal that the proposed architectures are well suited for cryptographic applications.
Keywords
Funding Information
- Deanship of Scientific Research at King Khalid University (R.G.P.2/132/42)
This publication has 31 references indexed in Scilit:
- Towards an Optimized Architecture for Unified Binary Huff CurvesJournal of Circuits, Systems and Computers, 2017
- Affine Coordinate Binary Edwards Curve Scalar Multiplier with Side Channel Attack Resistance2015
- High-Throughput Low-Complexity Systolic Montgomery Multiplication Over $GF(2^{m})$ Based on TrinomialsIEEE Transactions on Circuits and Systems II: Express Briefs, 2015
- Efficient Scalable Serial Multiplier Over GF( $\textbf {2}^{\boldsymbol {m}}$ ) Based on TrinomialIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2014
- Improving the Security of Wireless Sensor Networks by Protecting the Sensor Nodes against Side Channel Attacks2013
- Bit-serial and digit-serial GF(2
m
) Montgomery multipliers using linear feedback shift registersIET Computers & Digital Techniques, 2011
- Versatile multiplier architectures in fields using the Montgomery multiplication algorithmIntegration, 2008
- Low-complexity bit-parallel systolic multipliers over GF(2m)Integration, 2008
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978