Fast Montgomery modular multiplication and RSA cryptographic processor architectures

  title={Fast Montgomery modular multiplication and RSA cryptographic processor architectures},
  author={C. Mclvor and M{\'a}ire McLoone and John V. McCanny},
  journal={The Thrity-Seventh Asilomar Conference on Signals, Systems \& Computers, 2003},
  pages={379-384 Vol.1}
  • C. Mclvor, M. McLoone, J. McCanny
  • Published 9 November 2003
  • Computer Science
  • The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003
New, generic silicon architectures for implementing Montgomery's multiplication algorithm are presented. [...] Key Result The resulting Montgomery multiplier and RSA processor performance results presented are the fastest reported to date in the literature.Expand
Power Analysis of a Montgomery Modular Multiplier for Cryptosystems
The main contribution of this paper is to implement modular multiplier using Montgomery algorithm for RSA encryption and decryption using Ripple Carry Adders, Carry Look ahead Adder and Carry Save Adders to perform the large word length Addition's required by this algorithm.
Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation
Experimental results show that the proposed modular exponentiation and modular-multiplication design obtain the best delay performance compared with the published works and outperform them in terms of area-time complexity as well.
An optimised architecture for radix-2 Montgomery modular multiplication on FPGA
The algorithm and the hardware implementation of radix-2 Montgomery modular multiplication (MMM) are presented and an optimised intellectual property is realised to perform this operation with a reduced area, independent of the modulus size, dedicated to low rate cryptographic applications.
Fast architectures for FPGA-based implementation of RSA encryption algorithm
The results of implementation using FPGA have shown that the proposed RSA structures outperformed those structures built around the traditional Montgomery multiplier in terms of speed, thanks to avoiding global lines broadcast.
Radix – 4 Implementation of a Montgomery Multiplier for a RSA Cryptosystem
As cryptosystems become more important to computing, so does the need to make the encryption and decryption of larger and stronger keys faster. The RSA algorithm presents one of these problems
In this paper, new structures that implement the RSA cryptographic algorithm are presented. The core of these architectures is the modular exponential operation based on a modified Montgomery modular
A regular parallel RSA processor
Novel architectures are proposed to eliminate the fanout bottleneck, which reduce the achievable minimum clock period of long modular multipliers of high performance VLSI implementation of the RSA algorithm using the systolic array.
Fast and Area Efficient RSA Cryptosystem Design Using Modified Montgomery Multiplication for FPGA Applications
RSA(Rivest-Shamir-Adleman) cryptosystem is one of the most widely used public key cryptosystem.The importance of high security and faster implementations paved the way for RSA crypto-accelerators,
Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers
This paper presents a systematic design approach to provide the optimized Rivest-Shamir-Adleman (RSA) processors based on high-radix Montgomery multipliers satisfying various user requirements, such
A new RSA encryption architecture and hardware implementation based on optimized Montgomery multiplication
A systolic, scalable, redundant carry-save modular multiplier and an RSA encryption architecture are proposed using the Montgomery modular multiplication algorithm, completely avoiding the transformations from redundant to non-redundant numbers at the intermediate stages of the architectures.


High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware
This contribution proposes arithmetic architectures which are optimized for modern field programmable gate arrays (FPGAs) that perform modular exponentiation with very long integers, at the heart of many practical public-key algorithms such as RSA and discrete logarithm schemes.
Montgomery modular exponentiation on reconfigurable hardware
  • Thomas Blum
  • Computer Science
    Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336)
  • 1999
This contribution proposes arithmetic architectures which are optimized for modern field programmable gate arrays (FPGAs) and shows that it is possible to implement modular exponentiation at secure bit lengths on a single commercially available FPGA.
Modular Exponentiation on Reconfigurable Hardware
It is shown that it is possible to implement modular exponentiation at secure bit lengths on a single commercially available FPGA and faster processing times are presented, more than ten times faster than any reported software implementation.
VLSI Design of RSA Cryptosystem Based on the Chinese Remainder Theorem
This paper presents the design and implementation of a systolic RSA cryptosystem based on a modified Montgomery’s algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique
Toward an FPGA architecture optimized for public-key algorithms
This contribution investigates existing FPGA architectures with respect to modular multiplication and proposes a new FPGAs architecture optimized for the wide-operand additions required for modular multiplication.
Analyzing and comparing Montgomery multiplication algorithms
The operations involved in computing the Montgomery product are studied, several high-speed, space-efficient algorithms for computing MonPro(a, b), and their time and space requirements are described.
Modular multiplication without trial division
Let N > 1. We present a method for multiplying two integers (called N-residues) modulo N while avoiding division by N. N-residues are represented in a nonstandard way, so this method is useful only
Hardware Implementation of Montgomery's Modular Multiplication Algorithm
Hardware is described for implementing the fast modular multiplication algorithm developed by P.L. Montgomery (1985), showing that this algorithm is up to twice as fast as the best currently available and is more suitable for alternative architectures.
Montgomery exponentiation needs no final subtractions
Montgomery's modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem. It has been observed that there is no need for extra cleaning up at the end of an
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.