Skip to search formSkip to main contentSkip to account menu

Montgomery modular multiplication

Known as: Montgomery reduction, Montgomery modular reduction, Montgomery multiplication 
In modular arithmetic computation, Montgomery modular multiplication, more commonly referred to as Montgomery multiplication, is a method for… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Montgomery modular multiplication constitutes the “arithmetic foundation” of modern public-key cryptography with applications… 
2011
2011
This paper describes a comparison of two Montgomery modular multiplication architectures: a systolic and a multiplexed. Both… 
2009
2009
This paper presents a new processor array architecture for scalable radix 2 Montgomery modular multiplication algorithm. In this… 
2006
2006
The efficiency of public key encryption schemes like RSA and elliptic curve cryptography can be improved using fast modular… 
2004
2004
Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems… 
Highly Cited
2004
Highly Cited
2004
Subgrade soil characterization in terms of Resilient Modulus (MR) has become crucial for pavement design. For a new design, MR… 
2003
2003
We propose a new unified architecture that utilizes the Montgomery multiplication algorithm to perform a modular multiplication… 
2002
2002
Modular exponentiation and modular multiplication are the cornerstone computations performed in public-key cryptography systems… 
2000
2000
  • A. GutubA. Amin
  • 2000
  • Corpus ID: 54911130
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. A design for expandable… 
Highly Cited
1996
Highly Cited
1996
Variation in female mating preferences was compared with variation in male traits across populations of Xiphophorus pygmaeus…