Efficient Barrett Modular Multiplication Based on Toom-Cook Multiplication
- 11 September 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (2) , 862-866
Abstract
The Toom-Cook multiplier (TCM) is the most suitable method for multiplying large integers with key widths typically employed in ECC or RSA due to its computational efficiency. In this brief, we improve the accuracy of hardware TCM algorithm, and propose a TCM-based Barrett modular multiplication algorithm. We provide detailed mathematical proofs for the determinantion of parameters, error ranges, and input-output bounds, which serve to validate the robustness and reliability of our proposed algorithm. Further, the hardware architecture and the ASIC implementation results under 40nm, 65nm, 90nm process are presented. Compared with existing works, the proposed modular multiplier exhibits superior performance in terms of Area-Time-Product.Keywords
Funding Information
- National Natural Science Foundation of China (62201039)
This publication has 14 references indexed in Scilit:
- High-Speed ECC Processor Over NIST Prime Fields Applied With Toom–Cook MultiplicationIEEE Transactions on Circuits and Systems I: Regular Papers, 2018
- An Implementation of Karatsuba-based Montgomery Modular Multiplication with Only Half-size Additions2018
- A Modular Multiplier Implemented With Truncated MultiplicationIEEE Transactions on Circuits and Systems II: Express Briefs, 2017
- An Efficient Radix-4 Scalable Architecture for Montgomery Modular MultiplicationIEEE Transactions on Circuits and Systems II: Express Briefs, 2016
- Optimizing the Improved Barrett Modular Multipliers for Public-Key Cryptography2010
- Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction MethodsIEEE Transactions on Computers, 2010
- Faster integer multiplication2007
- Modular multiplication without trial divisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1983
- Schnelle Multiplikation großer ZahlenComputing, 1971