# Modified VLSI Architecture for Montgomery Modular Multiplication

@inproceedings{Nto2017ModifiedVA, title={Modified VLSI Architecture for Montgomery Modular Multiplication}, author={Jo{\~a}o Carlos N{\'e}to and A. Tenca}, year={2017} }

This paper proposes a simple and efficient Montgomery multiplication algorithm such that the low-cost and highperformance Montgomery modular multiplier can be implemented accordingly. The proposed multiplier receives and outputs the data with binary representation and uses only one-level carry-save adder (CSA) to avoid the carry propagation at each addition operation. This CSA is also used to perform operand pre computation and format conversion from the carry save format to the binary… Expand

No Paper Link Available

#### Figures and Tables from this paper

#### References

SHOWING 1-10 OF 12 REFERENCES

Pipelined VLSI Architecture for RSA Based on Montgomery Modular Multiplication

- 2016

Modular multiplication forms a key operation in many public key cryptosystems. Montgomery Multiplication is one of the wellknown algorithms to carry out the modular multiplication more quickly. Carry… Expand

Montgomery modular multiplication on reconfigurable hardware: Fully systolic array vs parallel implementation

- Computer Science
- 2010 VI Southern Programmable Logic Conference (SPL)
- 2010

A comparison of two FPGA Montgomery modular multiplication architectures: a fully systolic array and a parallel implementation and it is compared the time x area efficiency for both architectures as well as a RSA application. Expand

Parallel high-radix Montgomery multipliers

- Computer Science
- 2008 42nd Asilomar Conference on Signals, Systems and Computers
- 2008

The algorithm and design tradeoffs for multiple hardware implementations of parallel high-radix scalable Montgomery multipliers, and processing element designs exploring combinations of radices 2, 4, and 8, right vs. left shifting, and Booth encoding. Expand

A parallel k-partition method to perform Montgomery Multiplication

- Computer Science
- ASAP 2011 - 22nd IEEE International Conference on Application-specific Systems, Architectures and Processors
- 2011

This paper proposes a new approach to speed up the Montgomery Multiplication by distributing the multiplier operand bits into k partitions that can process in parallel. Each partition executes in n/k… Expand

Design and Implementation of Energy Efficient and High Throughput Vedic Multiplier

- Mathematics
- 2016

Low power and Highspeed computing systems have been very much demand in recent years, because of the fast growing technologies in scientific computing applications. Designing a low power and high… Expand

Analyzing and comparing the Montgomery multiplication algorithms for their power consumption

- Computer Science
- The 2010 International Conference on Computer Engineering & Systems
- 2010

This study analyses and compares the most popular Montgomery multiplication algorithms for their power dissipation on FPGA devices and indicates that the sequential setting with a single cell gives the most efficient employment of the algorithm for dynamic power Dissipation. Expand

Montgomery exponentiation needs no final subtractions

- Computer Science
- 1999

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

Complexity-Effective Version of Montgomery ’ s Algorihm

- 2002

A new version of Montgomery's algorithm for modular multiplication of large integers and its implementation in hardware is presented. It has been designed to meet the predominant

A method for obtaining digital signatures and public-key cryptosystems

- Computer Science
- CACM
- 1983

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important… Expand

Elliptic curve cryptosystems

- Mathematics
- 1987

We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure,… Expand