Radix‐16 CSA‐based low‐latency non‐Montgomery modular multiplier
Author:
Open Access
- 2 November 2021
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in The Journal of Engineering
- Vol. 2022 (2) , 244-248
Abstract
The long-precision modular multiplier is usually performed by Montgomery algorithm with bit shifts, yielding a result in the form of . In fact, with the precomputation of proposed by others, it is able to compute classic modular multiplication rather than Montgomery modular multiplication . In this work, a multi-bit CSA-based long-precision modular multiplier is proposed for hardware implementation. It includes two carry save adders and one RAM access to perform modular multiplications. After every modular multiplication, a division is applied to reduce the result down to . Hardware implementation results show that a 1024-bit modular multiplication can be completed in 2.39 s on the XC5V FPGA platform, costing 5793 slices, 8 DSPs and 36 BRAMs, which is a promising candidate to compute incontinuous classic modular multiplications.
Keywords
This publication has 20 references indexed in Scilit:
- Binary-Ternary Plus-Minus Modular Inversion in RNSIEEE Transactions on Computers, 2016
- Low-Cost High-Performance VLSI Architecture for Montgomery Modular MultiplicationIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2015
- High-Throughput Modular Multiplication and Exponentiation Algorithms Using Multibit-Scan–Multibit-Shift TechniqueIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2014
- Fast, compact and symmetric modular exponentiation architecture by common-multiplicand Montgomery modular multiplicationsIntegration, 2013
- Modified Montgomery modular multiplication and RSA exponentiation techniquesIEE Proceedings - Computers and Digital Techniques, 2004
- Cox-Rower Architecture for Fast Parallel Montgomery Multiplication2000
- A Scalable Architecture for Montgomery Nultiplication1999
- Fast algorithm for modular reductionIEE Proceedings - Computers and Digital Techniques, 1998
- Comments on "A Computer Algorithm for Calculating the Product AB Modulo M"IEEE Transactions on Computers, 1985
- Modular multiplication without trial divisionMathematics of Computation, 1985