Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents a scalable architecture for the computation of modular multiplication, based on the Montgomery multiplication… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's (1985) method adapted… Expand
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Seeks to present a better understanding of dynamic capabilities and the resource-based view of the firm. Dynamic capabilities are… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Montgomery's modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem. It has been observed… Expand
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… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Montgomery multiplication methods constitute the core of modular exponentiation, the most popular operation for encrypting and… Expand
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
  • Holger Orup
  • Proceedings of the 12th Symposium on Computer…
  • 1995
  • Corpus ID: 4519800
Until now the use of high radices to implement modular multiplication has been questioned, because it involves complex… Expand
  • figure 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A description of the ab initio quantum chemistry package GAMESS is presented. Chemical systems containing atoms through radon can… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Hardware is described for implementing the fast modular multiplication algorithm developed by P.L. Montgomery (1985). Comparison… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?