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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Modular multiplication is basic operation in public key cryptosystems like RSA. Montgomery modular multiplication being efficient… (More)
  • figure 1
  • figure 2
  • table I
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2009
2009
This paper describes a hardware implementation of modular multiplication coprocessor for both RSA and ECC Cryptosystems. Using a… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
2006
2006
The efficiency of public key encryption schemes like RSA and elliptic curve cryptography can be improved using fast modular… (More)
  • figure 1
  • table I
  • table II
  • figure 2
  • figure 3
Is this relevant?
2004
2004
Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems… (More)
  • figure 1
  • figure 3[7
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
New, generic silicon architectures for implementing Montgomery’s multiplication algorithm are presented. These use Carry Save… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
  • ArithmeticJean, - Claude, BajardLIRMMMontpellier
  • 2000
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper discusses several Montgomery multiplication algorithms, two of which have been proposed before. We describe three… (More)
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Hardware is described for implementing the fast modular multiplication algorithm of P. L. Montgomery. Comparison with previous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?