Corpus ID: 5745272

Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm

@inproceedings{Feng2006ImplementationOR,
  title={Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm},
  author={Gang Feng and Guangsheng Ma and Zhi Yang},
  booktitle={CSC},
  year={2006}
}
A modified Montgomery modular multiplication algorithm using four-to-two CSA (carry save adder) was proposed. The modified algorithm avoids the carry delay and the repeated output/input format conversions. We use this modified algorithm to design the RSA processing unit with 512-bit and 1024-bit key size .The resulting RSA units have a high throughput. 

References

SHOWING 1-6 OF 6 REFERENCES
Implementation of RSA Cryptoprocessor Based on Modified Montgomery Modular Multiplication Algorithm
TLDR
The proposed algorithm only uses one CSA (carry save adder)CSA, so it speeds up the implementation of RSA cryptoprocesser, and also improves the time of the algorithm. Expand
Modified Montgomery modular multiplication and RSA exponentiation techniques
Modified Montgomery multiplication and associated RSA modular exponentiation algorithms and circuit architectures are presented. These modified multipliers use carry save adders (CSAs) to performExpand
Montgomery Algorithm and Its Fast Implementation
This paper presents three methods to fasten the traditional Montgomery algorithm.They are constructed respectively from seeking inverse,modular multiplication and square of large integer,whichExpand
A new RSA cryptosystem hardware design based on Montgomery's algorithm
TLDR
A new algorithm based on Montgomery's algorithm to calculate modular multiplication that is the core arithmetic operation in an RSA cryptosystem is proposed that eliminates over large residue and has very short critical path delay that yields a very high speed processing. Expand
A hardware version of the RSA using the Montgomery's algorithm with systolic arrays
TLDR
The novel idea in this paper is to use the systolic array cells with increased performance of up to 20% and use them in a single row organization to speed up the modular multiplication and squaring operation. Expand
An improved scheme & circuit implementation on Montgomery's modular multiplication algorithm,
  • Computer Engineering and Applications,
  • 2004