
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
JeanClaude Bajard, LaurentStéphane Didier, Peter Kornerup, "An RNS Montgomery Modular Multiplication Algorithm," IEEE Transactions on Computers, vol. 47, no. 7, pp. 766776, July, 1998.  
BibTex  x  
@article{ 10.1109/12.709376, author = {JeanClaude Bajard and LaurentStéphane Didier and Peter Kornerup}, title = {An RNS Montgomery Modular Multiplication Algorithm}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {7}, issn = {00189340}, year = {1998}, pages = {766776}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.709376}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An RNS Montgomery Modular Multiplication Algorithm IS  7 SN  00189340 SP766 EP776 EPD  766776 A1  JeanClaude Bajard, A1  LaurentStéphane Didier, A1  Peter Kornerup, PY  1998 KW  Computer arithmetic KW  residue number system KW  modular multiplication KW  cryptography. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—We 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 on a ring of fairly simple processors, an effect corresponding to a redundant highradix implementation is achieved. The algorithm can be implemented to run in
[1] E.F. Brickell, "A Survey of Hardware Implementations of RSA," Advances in Cryptology—CRYPTO '89, G. Brassard, ed., pp. 368370. SpringerVerlag, 1990.
[2] S.E. Eldridge and C.D. Walter, “Hardware Implementation of Montgomery's Modular Multiplication Algorithm,” IEEE Trans. Computers, vol. 42, no. 7, pp. 693699, July 1993.
[3] A. Fiat and A. Shamir, "How to Prove Yourself: Practical Solutions to Identification and Signature Problems," Proc. Crypto 86, Lecture Notes in Computer Science 263, Advances in Cryptology, SpringerVerlag, New York, 1987, pp. 186194.
[4] D. Gamberger, "Incompletely Specified Numbers in the Residue Number System—Definition and Applications," Proc. Ninth IEEE Symp. Computer Arithmetic, M.D. Ercegovac and E. Swartzlander, eds., pp. 210215,Santa Monica, Calif., 1989.
[5] D. Knuth, The Art of Computer Programming, Vol. 2, AddisonWesley, Reading, Mass., 1998.
[6] P. Kornerup, "HighRadix Modular Multiplication for Cryptosystems," Proc. 11th IEEE Symp. Computer Arithmetic, G. Jullien, M.J Irwin, and E. Swartzlander, eds., pp. 277283,Windsor, Canada, 1993.
[7] P. Montgomery, "Modular Multiplication without Trial Division," Mathematics of Computation, vol. 44, no. 170, pp. 519521, Apr. 1985.
[8] S. Micali and A. Shamir, "An Improvement of the FiatShamir Identification and Signature Scheme," Advances in Cryptology—Proc. Crypto '88, pp. 244247, 1988.
[9] H. Orup, “Simplifying Quotient Determination in HighRadix Modular Multiplication,” Proc. 12th Symp. Computer Arithmetic, pp. 193199, 1995.
[10] R.L. Rivest,A. Shamir, and L.A. Adleman,"A Method for Obtaining Digital Signatures and Public Key Cryptosystems," Comm. ACM, vol. 21, pp. 120126, 1978.
[11] A.P. Shenoy and R. Kumaresan, Fast Base Extension Using a Redundant Modulus in RNS IEEE Trans. Computers, vol. 38, no. 2, pp. 292297, Feb. 1989.
[12] N. Szabo and R.I. Tanaka, Residue Arithmetic and Its Application to Computer Technology. McGrawHill, 1967.
[13] M. Shand and J. Vuillemin, “Fast Implementations of RSA Cryptography,” Proc. 11th IEEE Symp. Computer Arithmetic, pp. 252259, 1993.
[14] N. Takagi, "Modular Multiplication Algorithm with Triangle Addition," Proc. 11th IEEE Symp. Computer Arithmetic, M.J. Irwin, E. Swartzlander, and G. Jullien, eds., pp. 272276, 1993.
[15] F.J. Taylor, "Residue Arithmetic: A Tutorial with Examples," Computer, pp. 5062, May 1984.
[16] C.D. Walter, “Systolic Modular Multiplier,” IEEE Trans. Computers, vol. 42, no. 3, pp. 376378, Mar. 1993.