# Montgomery modular multiplication

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- 2nd International Conference on Signal Processingâ€¦
- 2015

Modular multiplication is basic operation in public key cryptosystems like RSA. Montgomery modular multiplication being efficientâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- IEEE Transactions on Computers
- 2011

Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Ellipticâ€¦Â (More)

Is this relevant?

2009

2009

- WRI International Conference on Communicationsâ€¦
- 2009

This paper describes a hardware implementation of modular multiplication coprocessor for both RSA and ECC Cryptosystems. Using aâ€¦Â (More)

Is this relevant?

2006

2006

- IFIP International Conference on Very Large Scaleâ€¦
- 2006

The efficiency of public key encryption schemes like RSA and elliptic curve cryptography can be improved using fast modularâ€¦Â (More)

Is this relevant?

2004

2004

- Proceedings. The 16th International Conference onâ€¦
- 2004

Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystemsâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

New, generic silicon architectures for implementing Montgomeryâ€™s multiplication algorithm are presented. These use Carry Saveâ€¦Â (More)

Is this relevant?

2000

2000

- 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

- IEEE Trans. Computers
- 1998

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

1996

Highly Cited

1996

- IEEE Micro
- 1996

This paper discusses several Montgomery multiplication algorithms, two of which have been proposed before. We describe threeâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- IEEE Trans. Computers
- 1993

Hardware is described for implementing the fast modular multiplication algorithm of P. L. Montgomery. Comparison with previousâ€¦Â (More)

Is this relevant?