论文信息 - Hardware Architecture for the Montgomery Modular Multiplication

Hardware Architecture for the Montgomery Modular Multiplication

Modular multiplication is the most dominant part of the computation performed in public-key cryptography systems such systems. The operation is time consuming for large operands. This paper examines the characteristics of yet another architecture to implement modular multiplication using the fast Montgomery algorithm. An experimental Montgomery modular multiplier prototype is described and simulated. The simulation results are presented. Key-Words:modular multiplication, Montgomery algorithm, simulation, cryptosystems.

NADIA NEDJAH | LUIZA DE MACEDO MOURELLE

[1] NADIA NEDJAH,et al. Simulation Model for a Hardware Implementation of Modular Multiplication , 2001 .

[2] Gary Wayne Bewick. Fast Multiplication: Algorithms and Implementations , 1994 .

[3] C. D. Walter,et al. Systolic Modular Multiplication , 1993, IEEE Trans. Computers.

[4] Ernest F. Brickell,et al. A Survey of Hardware Implementation of RSA (Abstract) , 1989, CRYPTO.

[5] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[6] Colin D. Walter,et al. A verification of brickell's fast modular multiplication algorithm , 1990 .

[7] Mathias Beike,et al. Digital Integrated Circuits A Design Perspective , 2016 .

[8] Zainalabedin Navabi,et al. VHDL: Analysis and Modeling of Digital Systems , 1992 .

[9] Colin D. Walter,et al. Hardware Implementation of Montgomery's Modular Multiplication Algorithm , 1993, IEEE Trans. Computers.

[10] Andrew D. Booth,et al. A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[11] P. L. Montgomery. Modular multiplication without trial division , 1985 .