A new RSA cryptosystem hardware design based on Montgomery's algorithm

  title={A new RSA cryptosystem hardware design based on Montgomery's algorithm},
  author={Ching-Chao Yang and Tian-Sheuan Chang and C. W. Jen},
  journal={IEEE Transactions on Circuits and Systems Ii: Analog and Digital Signal Processing},
In this paper, we propose a new algorithm based on Montgomery's algorithm to calculate modular multiplication that is the core arithmetic operation in an RSA cryptosystem. The modified algorithm eliminates over large residue and has very short critical path delay that yields a very high speed processing. The new architecture based on this modified algorithm takes about 1.5n/sup 2/ clock cycles on the average to finish one n-bit RSA operation. We have implemented a 512-bit single-chip RSA… 
A new RSA cryptosystem hardware implementation based on high-radix Montgomery's algorithm
  • Fang Yingli, Gao Zhiqiang
  • Computer Science
    ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549)
  • 2001
The high-radix technique is employed and the original Montgomery's algorithm is modified to reduce hardware complexity and improve processing speed in an efficient hardware-oriented modular multiplication algorithm.
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
RSA cryptosystem design based on the Chinese remainder theorem
The design and implementation of a systolic RSA cryptosystem based on a modified Montgomery's algorithm and the Chinese Remainder Theorem technique and the CRT technique is presented, which improves the throughput rate up to 4 times in the best case.
Asynchronous implementation of 1024-bit modular processor for RSA cryptosystem
  • Y. Kim, Wooseok Kang, J. Choi
  • Computer Science
    Proceedings of Second IEEE Asia Pacific Conference on ASICs. AP-ASIC 2000 (Cat. No.00EX434)
  • 2000
An implementation method to optimize a single-chip 1024-bit RSA processor based on the modified algorithm and architecture with 0.65-/spl mu/m SOG technology using Verilog HDL is presented.
Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified Montgomery algorithm
This paper has implemented two single-chip 1024-bit RSA processors based on the proposed architectures in 0.5-/spl mu/m SOG technology using Verilog-HDL and shown that each architecture contributes to speed improvement and area saving.
A 1024-bit RSA crypto-coprocessor for smart cards
A new VLSI architecture for high-radix modular multiplier to compute RSA public-key cryptosystem based on the modified Montgomery algorithm can achieve good performance in chip area and speed for smart cards.
Radix-4 Syatolic RSA Cryptosystem Chip
In this thesis, bit-level systolic arrays for RSA public key cryptosystem are designed based on an improved Montgomery’s algorithm. The utilization of the multiplier is 100% since we can interleave
Design methodology for Booth-encoded Montgomery module design for RSA cryptosystem
  • Jye-Jong Leu, A. Wu
  • Computer Science
    2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353)
  • 2000
The 4 bit-digit-serial pipelined architecture to process RSA encryption/decryption in a more efficient way is proposed and the speed is approximately 1.7 times that of most RSA VLSI designs based on original Montgomery modular multiplication algorithm.
Design and implementation of an RSA public-key cryptosystem
A new bit-serial systolic array for realizing a modified Montgomery algorithm for modular multiplication, which is highly regular, modular, and thus well suited to be implemented using VLSI techniques and can be operated at a higher clock rate than existing designs.
An Efficient Architecture of 1024-bits Cryptoprocessor for RSA Cryptosystem Based on Modified Montgomery's Algorithm
In this paper, a new architecture using only one carry save adder (CSA) was proposed to implement modular multiplication based on the modified Montgomery modular multiplication algorithm. It can


A systolic RSA public key cryptosystem
A bit-level systolic array for RSA public key cryptosystem is designed based on the modified Montgomery's algorithm, which leads to both simpler architecture and better performance.
Fast implementations of RSA cryptography
  • M. Shand, J. Vuillemin
  • Computer Science
    Proceedings of IEEE 11th Symposium on Computer Arithmetic
  • 1993
The authors detail and analyze the critical techniques that may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd division, carry-save representation, quotient pipelining, and asynchronous carry completion adders.
A single-chip RSA processor implemented in a 0.5 /spl mu/m rule gate array
A prototype single-chip modular exponentiation LSI is implemented, which is capable of high-speed RSA public-key encryption processing, in a 0.5 /spl mu/m-rule gate array. With this LSI, computation
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.
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.
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
Systolic Modular Multiplication
A systolic array for modular multiplication is presented using the ideally suited algorithm of P.L. Montgomery (1985), where its main use would be where many consecutive multiplications are done, as in RSA cryptosystems.
Simplifying quotient determination in high-radix modular multiplication
  • Holger Orup
  • Mathematics, Computer Science
    Proceedings of the 12th Symposium on Computer Arithmetic
  • 1995
Algorithms that are obtained through rewriting of Montgomery's algorithm are presented, where the determination of quotients becomes trivial and the cycle time becomes independent of the choice of radix.
Still faster modular multiplication
By an appropriate choice of the modulus used in RSA cryptography, it is possible to simplify the hardware for performing the required modular multiplication steps, and thereby increase the speed of
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.