Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2006-04-25
2006-04-25
Mai, Tan V. (Department: 2193)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
07035889
ABSTRACT:
A method and apparatus for Montgomery multiplication comprising adding at least one multiplicand bit from a first multiplicand add multiplexer in a main array of a Montgomery multiplier with at least one modulus bit from a first modulus-add multiplexer in the main array; adding at least one modulus bit from a first modulus-add multiplexer in a quotient pre-calculation array with at least one modulus bit from a second modulus-add multiplexer in the quotient pre-calculation array; pre-calculating the quotient during a first cycle; and sending at least one value to control the first modulus-add multiplexer in the main array, the first modulus-add multiplexer in the quotient pre-calculation array, and the second modulus-add multiplexer in the quotient pre-calculation array so that the value of the quotient is evenly divisible by the radix during a second cycle through the Montgomery multiplier.
REFERENCES:
patent: 6209016 (2001-03-01), Hobson et al.
patent: 6748410 (2004-06-01), Gressel et al.
patent: 2002/0194237 (2002-12-01), Takahashi
patent: 2004/0054705 (2004-03-01), Le Quere
Blum, T. and Paar, C., “High Radix Montgomery Modular Exponentiation on Reconfigurable Hardware”, ECE Department, Worcester Polytechnic Institute, pp. 1-13.
Blum, Thomas, “Modular Exponentiation on Reconfigurable Hardware”, Thesis Submitted to the Faculty of Worcester Polytechnic Institute, Apr. 8, 1999, 113 pages.
Elbirt, AJ and Paar, C., “Towards an FPGA Architecture Optimized for Public-Key Algorithms”, Presented at the SPIE;s Symposium on Voice, Video, and Comm., Sep. 20, 1999, pp. 1-10.
Kim, Chinuk, “VHDL Implementation of Systolic Modular Multiplications on RSA Cryptosystem”, Thesis at The City College of the City University of New York, Jan. 2001, 43 pages.
Gutub, Adnan, “A Modulo Multiplication Hardware Design”, Project Report at Oregon State University, Electrical & Computer Engineering Department, Winter 2000, 8 pages.
Poldre, J. et al., “Modular Exponent realization on FPGAs”, Tallinn Technical University, Computer Engineering Depatrment, 12 pages.
Savas, E. et al., “A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)”, Oregon State University, Electrical and Computer Engineering, 20 pages.
Shand, M. et al., “Fast Implementation of RSA Cryptography”, Digital Equipment Corp., Paris Research Laboratory, 9 pages.
Tenca, Alexandre F. and Koc, Cetin K., “A Scalable Architecture For Montgomery Multiplication”, Oregon State University, Electrical and Computer Engineering Department, 13 pages.
“How SSL Works”, http://developer.netscape.com/tech/security/ssl/howitworks.html, Jun. 1, 2001.
Savolainen, Sampo, “Internet Key Exchange (IKE)”, Helsinki University of Technology, Department of Electrical and Communications Engineering, Nov. 22, 1999, http://www.niksula.cs.hut.fi/sjsavola/SoN/essay.html, 12 pages.
Internet Key Exchange Security Protocol, http://www.cisco.com/univercd/cc/td/doc/product/software/ios113ed/113t/113t—3/isakmp.htm,. Jun. 1, 2001, 45 pages.
Internet Key Exchange Security Protocol, http://www.cisco.com/univercd/cc/td/doc/product/software/ios113ed/113t/113t—3/isakmp.htm, Feb. 6, 2002.
Carlson David A.
Yalala Vishnu V.
Blakely , Sokoloff, Taylor & Zafman LLP
Cavium Networks, Inc.
Mai Tan V.
LandOfFree
Method and apparatus for montgomery multiplication does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for montgomery multiplication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for montgomery multiplication will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3534281