# An Optimized Montgomery Modular Multiplication Algorithm for Cryptography

@inproceedings{Shenbagapriya2017AnOM, title={An Optimized Montgomery Modular Multiplication Algorithm for Cryptography}, author={P. Shenbagapriya}, year={2017} }

Montgomery modular multiplication is one of the fundamental operations used in cryptographicalgorithms, such as RSA andElliptic Curve Cryptosystem. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more numberof addition stages for large word length addition, where nis the size of of operandsoperands inbits. Inthis paper, new Montgomery modularmultiplier isproposed whichperformsthesame operationin approximatelyn clock… Expand

#### References

SHOWING 1-10 OF 13 REFERENCES

Modified Montgomery modular multiplication and RSA exponentiation techniques

- Mathematics
- 2004

Modified Montgomery multiplication and associated RSA modular exponentiation algorithms and circuit architectures are presented. These modified multipliers use carry save adders (CSAs) to perform… Expand

Cellular-array modular multiplier for fast RSA public-key cryptosystem based on modified Booth's algorithm

- Mathematics, Computer Science
- IEEE Trans. Very Large Scale Integr. Syst.
- 2003

An algorithm based on Montgomery's algorithm, and a fast radix-4 modular exponentiation algorithm for Rivest, Shamir, and Adleman (RSA) public-key cryptosystem are proposed and simulated. Expand

Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers

- Computer Science
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- 2011

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… Expand

An efficient CSA architecture for montgomery modular multiplication

- Computer Science
- Microprocess. Microsystems
- 2007

This paper reuse the CSA architecture to perform the result format conversion, which leads to small area and fast speed in Montgomery multipliers of carry save adder architecture. Expand

High-radix systolic modular multiplication on reconfigurable hardware

- Computer Science
- Proceedings. 2005 IEEE International Conference on Field-Programmable Technology, 2005.
- 2005

Novel high radix systolic array Montgomery multiplier designs are presented, as it is believed that the inherent regular structure and absence of global interconnect associated with these, make them well-suited for implementation on modern FPGAs. Expand

A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm

- Computer Science
- IEEE Trans. Computers
- 2003

A word-based version of MM is presented and used to explain the main concepts in the hardware design and gives enough freedom to select the word size and the degree of parallelism to be used, according to the available area and/or desired performance. Expand

An improved unified scalable radix-2 Montgomery multiplier

- Mathematics, Computer Science
- 17th IEEE Symposium on Computer Arithmetic (ARITH'05)
- 2005

An improved version of the Tenca-Koc unified scalable radix-2 Montgomery multiplier with half the latency for small and moderate precision operands and half the queue memory requirement is described. Expand

Low Power and Area-Efficient Carry Select Adder

- Engineering
- 2013

Carry Select Adder (CSLA) is one of the fastest adders used in many data-processing processors to perform fast arithmetic functions. From the structure of the CSLA, it is clear that there is scope… Expand

A Scalable Architecture for Montgomery Multiplication

- Computer Science
- CHES
- 1999

The general view of the new architecture is described, hardware organization for its parallel computation is analyzed, and design tradeoffs which are useful to identify the best hardware configuration are discussed. Expand

Ghazawi,”New Hardware Architectures for Montgomery Modular Multiplication

- Algorithm”,IEEE transactions on computers,
- 2011