Modified Radix-2 Montgomery Modular Multiplication to Make It Faster and Simpler

Authors:
Kooroush Manochehri;Saadat Pourmozafari
Affiliations:
Amirkabir University of Technology, Tehran, Iran;Amirkabir University of Technology, Tehran, Iran
Venue:
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Year:
2005

Citing 0
Cited 6

An efficient CSA architecture for montgomery modular multiplication

Microprocessors & Microsystems
Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques

International Journal of Computer Mathematics
Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical- Signed-Digit Recoding Technique

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
An efficient signed digit montgomery multiplication for RSA

Journal of Systems Architecture: the EUROMICRO Journal
Safe-error attack on SPA-FA resistant exponentiations using a HW modular multiplier

ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Dual-residue montgomery multiplication

NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several improvements for making it suitable for hardware implementation. Radix-2 version of this algorithm is simple and fast to implement in hardware design. In this paper a new algorithm based on this approach is presented that is more simple and faster than radix-2 algorithm. For implementing this new algorithm, carry save adder (CSA) architecture is used and synthesized in both ASIC and FPGA technology.