Corpus ID: 20811150

AREA EFFICIENT MONTGOMERY MODULAR MULTIPLICATION ARCHITECTURE WITH LOW-MEMORY BANDWIDTH REQUIREMENT

@inproceedings{Suresh2015AREAEM,
  title={AREA EFFICIENT MONTGOMERY MODULAR MULTIPLICATION ARCHITECTURE WITH LOW-MEMORY BANDWIDTH REQUIREMENT},
  author={V. Suresh and S. Malik},
  year={2015}
}
Montgomery modular multiplication is widely used in public-key cryptosystems. This work shows how to relax the data dependency in conventional word-based algorithms to maximize the possibility of reusing the current words of variables. With the greatly relaxed data dependency, we then proposed a novel scheduling scheme to alleviate the number of memory access in the developed scalable architecture. Analytical results show that the memory bandwidth requirement of the proposed scalable… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 10 REFERENCES
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
A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem
TLDR
This paper presents a new modular exponentiation architecture with a unified modular multiplication/square module and shows how to reduce the number of input operands for the CSA tree by mathematical manipulation and shows that the developed architecture obtains the least hardware complexity compared with the existing work. Expand
A Scalable Architecture for Montgomery Multiplication
TLDR
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
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
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 onlyExpand
Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS)
This document describes how to use Elliptic Curve Cryptography (ECC) public key algorithms in the Cryptographic Message Syntax (CMS). The ECC algorithms support the creation of digital signatures andExpand
Elliptic curve cryptosystems
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
McCanny, “Modified MontgomeryModular Multiplication and RSA Exponentiation Techniques,”IEE
  • Proc. Computer and Digital Techniques,
  • 2004
Modular Multiplication without Trial Division,”Math
  • Computation, vol
  • 1985
A Method for ObtainingDigital Signatures and Public-Key Cryptosystems,
  • Comm. ACM,vol
  • 1978