An RNS Montgomery modular multiplication algorithm

@article{Bajard1997AnRM,
  title={An RNS Montgomery modular multiplication algorithm},
  author={Jean-Claude Bajard and Laurent-St{\'e}phane Didier and Peter Kornerup},
  journal={Proceedings 13th IEEE Sympsoium on Computer Arithmetic},
  year={1997},
  pages={234-239}
}
The authors present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to mixed radix, and is performed using a residue number system. By choosing the moduli of the RNS system reasonably large, and implementing the system an a ring of fairly simple processors, an effect corresponding to a redundant high-radix implementation is achieved. The algorithm call be implemented to run in O(n) time on O(n) processors, where n is the number of… 

Figures and Tables from this paper

Montgomery Modular Multiplication inResidue
TLDR
A new RNS modular multiplication for very large operands is presented, based on Montgomery's method adapted to residue arithmetic, which achieves an effect corresponding to a redundant high-radix implementation by choosing the moduli of the RNS system reasonably large.
Modular multiplication and base extensions in residue number systems
TLDR
A new RNS modular multiplication for very large operands is presented, based on Montgomery's (1985) method adapted to residue arithmetic, which achieves an effect corresponding to a redundant high-radix implementation by choosing the moduli of the RNS system reasonably large.
An improved RNS Montgomery modular multiplier
TLDR
An improved RNS modular multiplication for large operands is presented, using Montgomery's method together with the Chinese Remainder Theorem, and is performed using a Residue Number System.
Improved RNS Montgomery Modular Multiplication with Residue Recovery
TLDR
A new residue recovery method is proposed that directly employs binary system rather than mixed radix system to perform RNS modular multiplications, in which it is more efficient than parallel base conversion method.
Some improvements on RNS Montgomery modular multiplication
TLDR
An algorithmic parallel algorithm is proposed for this translation from RNS to Mixed Radix, using a result that comes from an RNS division algorithm, and obtaining in a logarithmic time an approximation of the Mixed radix representation.
Montgomery modular multiplication and exponentiation in the residue number system
  • W. Freking, K. Parhi
  • Computer Science, Mathematics
    Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020)
  • 1999
TLDR
A new sequential modular multiplication method suitable for smart cards is proposed which achieves the best known operation count for an all-modular-arithmetic approach in the residue number system (RNS).
Implementation of RSA Algorithm Based on RNS Montgomery Multiplication
TLDR
An implementation of RSA cryptosystem using the RNS Montgomery multiplication is described, and an implementation method using the Chinese Remainder Theorem (CRT) is presented.
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
TLDR
The main contribution of this paper is to provide a new RNS base extension algorithm, which can be adapted to an existing standard radix interface of RSA cryptosystem.
An iterative modular multiplication algorithm in RNS
Parallel Modular Multiplication Algorithm in Residue Number System
TLDR
A novel method for the parallelization of the modular multiplication algorithm in the Residue Number System (RNS) is presented, which only requires L moduli which is half the number needed in the previous algorithm.
...
...

References

SHOWING 1-10 OF 36 REFERENCES
Simplifying quotient determination in high-radix modular multiplication
  • Holger Orup
  • Computer Science
    Proceedings of the 12th Symposium on Computer Arithmetic
  • 1995
TLDR
Algorithms that are obtained through rewriting of Montgomery's algorithm are presented, where the determination of quotients becomes trivial and the cycle time becomes independent of the choice of radix.
High-radix modular multiplication for cryptosystems
  • Peter Kornerup
  • Computer Science, Mathematics
    Proceedings of IEEE 11th Symposium on Computer Arithmetic
  • 1993
Two algorithms for modular multiplication with very large moduli are analyzed specifically for their applicability when a high radix is used for the multiplier. Both algorithms perform modulo
Fast Base Extension Using a Redundant Modulus in RNS
TLDR
A technique to extend the base of a residue number system (RNS) based on the Chinese remainder theorem (CRT) and the use of a redundant modulus, is proposed and superiority of the technique, compared in terms of latency and hardware requirements to the traditional Szabo-Tanaka method is demonstrated.
Modular multiplication without trial division
TLDR
A method for multiplying two integers modulo N while avoiding division by N, a representation of residue classes so as to speed modular multiplication without affecting the modular addition and subtraction algorithms.
A modular multiplication algorithm with triangle additions
  • N. Takagi
  • Computer Science
    Proceedings of IEEE 11th Symposium on Computer Arithmetic
  • 1993
TLDR
An algorithm for multiple-precision modular multiplication is proposed that is efficient for implementation on small computers, such as card computers, and is useful for application of a public-key cryptosystem to such computers.
Hardware Implementation of Montgomery's Modular Multiplication Algorithm
TLDR
Hardware is described for implementing the fast modular multiplication algorithm developed by P.L. Montgomery (1985), showing that this algorithm is up to twice as fast as the best currently available and is more suitable for alternative architectures.
Systolic Modular Multiplication
  • C. D. Walter
  • Computer Science, Mathematics
    IEEE Trans. Computers
  • 1993
TLDR
A systolic array for modular multiplication is presented using the ideally suited algorithm of P.L. Montgomery (1985), where its main use would be where many consecutive multiplications are done, as in RSA cryptosystems.
Fast implementations of RSA cryptography
TLDR
The authors detail and analyze the critical techniques that may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd division, carry-save representation, quotient pipelining, and asynchronous carry completion adders.
Residue Arithmetic A Tutorial with Examples
TLDR
One of the common rules of converting remainders, or residues, into integers as the Chinese Remainder Theorem, or CRT is referred to as the CRT today.
Incompletely specified numbers in the residue number system-definition and applications
  • D. Gamberger
  • Mathematics
    Proceedings of 9th Symposium on Computer Arithmetic
  • 1989
TLDR
Two efficient algorithms for transformation of incompletely to completely specified RNS numbers are shown and their application in divisibility testing and integer matrix inversion are described.
...
...