Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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

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

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

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

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

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Until now the use of high radices to implement modular multiplication has been questioned, because it involves complex… Expand

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

Is this relevant?