Corpus ID: 27896392

An RNS Based Montgomery Modular Multiplication Algorithm For Cryptography

@inproceedings{Shenbagapriya2017AnRB,
  title={An RNS Based Montgomery Modular Multiplication Algorithm For Cryptography},
  author={P. Shenbagapriya},
  year={2017}
}
Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystem. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more number of addition stages for large word length addition, where n is the size of operands in bits. In this paper, new Montgomery modular multiplier is proposed which performs the same operation in approximately n… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 10 REFERENCES
New Hardware Architectures for Montgomery Modular Multiplication Algorithm
TLDR
Two new hardware architectures that are able to perform the same operation in approximately n clock cycles with almost the same clock period are proposed, based on precomputing partial results using two possible assumptions regarding the most significant bit of the previous word. 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
Cellular-array modular multiplier for fast RSA public-key cryptosystem based on modified Booth's algorithm
TLDR
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
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, suchExpand
An efficient CSA architecture for montgomery modular multiplication
TLDR
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
A parallel k-partition method to perform Montgomery Multiplication
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/kExpand
High-radix systolic modular multiplication on reconfigurable hardware
TLDR
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
An improved unified scalable radix-2 Montgomery multiplier
TLDR
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
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm
TLDR
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
Low Power and Area-Efficient Carry Select Adder
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 scopeExpand