Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique
Reexamination Certificate
2007-07-03
2007-07-03
Shiekh, Avaz (Department: 2131)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Particular communication authentication technique
C713S164000, C708S007000, C708S492000, C708S503000, C708S620000
Reexamination Certificate
active
09637229
ABSTRACT:
Scalable and unified multipliers for multiplication of cryptographic parameters represented as elements of either of the prime field (GF(p)) and the binary extension field (GF(2m)) include processing elements arranged to execute in pipeline stages. The processing elements are configurable to perform operations corresponding to either the prime field or the binary extension field. In an example, the processing elements include a dual-field adder having a field-select input that permits selection of a field arithmetic. In a representative example, multipliers are implemented as integrated circuits having processing units that each receive a single bit of one operand and partial words of the remaining operand.
REFERENCES:
patent: 4322577 (1982-03-01), Brandstrom
patent: 4763332 (1988-08-01), Glover
patent: 5144574 (1992-09-01), Morita
patent: 5321752 (1994-06-01), Iwamura et al.
patent: 5349551 (1994-09-01), Petro
patent: 5513133 (1996-04-01), Cressel et al.
patent: 5742530 (1998-04-01), Gressel et al.
patent: 5745398 (1998-04-01), Monier
patent: 5867412 (1999-02-01), Suh
patent: 5933504 (1999-08-01), Vanstone et al.
patent: 5954788 (1999-09-01), Suh et al.
patent: 5974580 (1999-10-01), Zook et al.
patent: 6035317 (2000-03-01), Guy
patent: 6049815 (2000-04-01), Lambert et al.
patent: 6061706 (2000-05-01), Gai et al.
patent: 6151393 (2000-11-01), Jeong
patent: 6182104 (2001-01-01), Foster et al.
patent: 6185596 (2001-02-01), Hadad et al.
patent: 6209016 (2001-03-01), Hobson et al.
patent: 6252959 (2001-06-01), Paar et al.
patent: 6356636 (2002-03-01), Foster et al.
patent: 6397241 (2002-05-01), Glaser et al.
patent: 6560336 (2003-05-01), Arita
patent: 6668267 (2003-12-01), Pomet
patent: 6820105 (2004-11-01), Blaker
patent: 6925563 (2005-08-01), Jennings
patent: 7046800 (2006-05-01), Tenca et al.
patent: 2002/0013799 (2002-01-01), Blaker
patent: 2002/0039418 (2002-04-01), Dror et al.
patent: 2005/0033790 (2005-02-01), Hubert
patent: 2005/0041811 (2005-02-01), Kobayashi et al.
EPS/Solutions, CypherCalc-Cryptographer's Calculotr, Mar. 3, 1999, http://cyphercalc.com. Last accessed: Feb. 26, 2004.
CypherCalc, the Cryptographers Calculator. Oct. 8, 1999. http://www.archive.org and http://www.cyphercalc.com. p. 1-9.
Koc et al. Analyzing and Comparing Motogomery multiplication algorithms. 1996. IEEE. p. 26-33.
M. Alain Guyot. Conception et Etude d'une Architecture Numerique de Haute Performance pour le Calcul de la Fonction Exponentielle Modulaire. Oct. 22, 1999.
Kaliski, Jr., B.S., “The Montgomery Inverse and Its Applications,”IEEE Trans. on Computers 44:1064-1065 (Aug. 1995).
Montgomery, P.L., “Modular Multiplication Without Trial Division,”Math. of Computation 44:519-521 (Apr. 1985).
Koç,img id="CUSTOM-CHARACTER-00001" he="3.13mm" wi="2.46mm" file="US07240204-20070703-P00001.TIF" alt="custom character" img-content="character" img-format="tif" ?.K. et al., “Analyzing and Comparing Montgomery Multiplication Algorithms,”IEEE Micro 16:26-33 (Jun. 1996).
Dhem, J. et al., “SCALPS: Smart Card For Limited Payment Systems,”IEEE Micro 16:42-51 (Jun. 1996).
Diffie, W., Hellman, M.E., “New Directions in Cryptography,”IEEE Trans. on Information Theory 22:644-654 (1976).
Rivest, R.L. et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,”Communications of the ACM 21:120-126 (1978).
Koç,img id="CUSTOM-CHARACTER-00002" he="3.13mm" wi="2.46mm" file="US07240204-20070703-P00001.TIF" alt="custom character" img-content="character" img-format="tif" ?.K., Acar, T., “Fast Software Exponentiation in GF(2k)” inProceedings, 13thSymposium on Computer Arithmetic, pp. 225-231 (Jul. 1997) (T. Lang et al., editors).
Hamano, T. et al., “O(n)-Depth Circuit Algorithm for Modular Exponentiation” inProceedings, 12th Symposium on Computer Arithmetic, pp. 188-192 (Jul. 1995) (S. Knowles, W.H. McAllister, editors).
Orup, H., “Simplifying Quotient Determination in High-radix Modular Multiplication” inProceedings, 12th Symposium on Computer Arithmetic, pp. 193-199 (Jul. 1995) S. Knowles, W.H. McAllister, editors).
Bernal, A., Guyot, A., “Design of a Modular Multiplier Based on Montgomery's Algorithm” in13thConference on Design of Circuits and Integrated Systems, pp. 680-685 (Nov. 1998).
Eldridge, S.E., Walter, C.D., “Hardware Implementation of Montgomery's Modular Multiplication Algorithm,”IEEE Trans. Computers 42:693-699 (Jun. 1993).
Kornerup, P., “High-Radix Modular Multiplication for Cryptosystems” inProceedings, 11th Symposium on Computer Arithmetic, pp. 277-283 (Jun. 1993) (E. Swartzlander et al., editors).
Walter, C.D., “Space/Time Trade-offs for Higher Radix Modular Multiplication Using Repeated Addition,”IEEE Trans. Computers 46:139-141 (1997).
Royo, A., et al., “Design and Implementation of a Coprocessor for Cryptography Applications,”European Design and Test Conference, pp. 213-217 (Mar. 1997).
Koç,img id="CUSTOM-CHARACTER-00003" he="3.13mm" wi="2.46mm" file="US07240204-20070703-P00001.TIF" alt="custom character" img-content="character" img-format="tif" ?.K., Acar, T., Montgomery Multiplication in GF(2k),Designs, Codes and Cryptography 14:57-69 (1998).
Tenca, A.F., “Variable Long-Precision Arithmetic (VLPA) for Reconfigurable Coprocessor Architectures,” Ph.D. Thesis, University of California at Los Angeles (Mar. 1998).
Hong et al., “New Modular Multiplication Algorithms for Fast Modular Exponentiation,” EUROCRYPT '96 Proceedings, 166-177.
Walter, C., “Faster Modular Multiplication by Operand Scaling,” Advances in Cyrptology Proc., Crypto '91, LNCS 576, 313-323 (1992).
Even, S., “Systolic Modular Multiplication,” Crypto 90 Proc. Lecture Notes in Computer Science No. 537, 619-624.
Bosselaers et al., “Comparison of Three Modular Reduction Functions,” Crypto '94, 175.186.
Koç Çetin K.
Savas Erkay
Tenca Alexandre F.
Klarquist & Sparkman, LLP
LaForgia Christian
Shiekh Avaz
State of Oregon Acting by and through the State Board of Higher
LandOfFree
Scalable and unified multiplication methods and apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scalable and unified multiplication methods and apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable and unified multiplication methods and apparatus will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3820452