Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2005-07-19
2005-07-19
Chaki, Kakali (Department: 2124)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
C708S446000
Reexamination Certificate
active
06920473
ABSTRACT:
A multiplicand is multiplied by a multiplier using a modulus. The multiplicand, the multiplier and the modulus are polynomials of variable. A multiplication look-ahead method to obtain a multiplication shift value is carried out. An intermediate result polynomial is shifted to the left by the number of digits of the multiplication shift value. A reduction shift value equalling the difference of the degree of the shifted intermediate result polynomial and the degree of the modulus polynomial is obtained in a reduction look-ahead method. The modulus polynomial is then shifted by a number of digits equalling the reduction shift value. In a three-operands addition, the shifted polynomial and the multiplicand are summed and the shifted modulus polynomial is subtracted. The modular multiplication are iteratively executed and processed progressively until all the powers of the multiplier polynomial have been processed. With a carry disabling function Z/NZ arithmetic and GF arithmetic can be carried out on a single long number calculating unit.
REFERENCES:
patent: 4346451 (1982-08-01), Katayama
patent: 4625076 (1986-11-01), Okamoto et al.
patent: 4870681 (1989-09-01), Sedlak
patent: 5251164 (1993-10-01), Dodson et al.
patent: 36 31 992 (1987-11-01), None
patent: 00/38047 (2000-06-01), None
Guido, Should left shift test for overflow?, Jan. 20, 1992, http://www.python.org/search/hypermail/python-1992/0298.html, pp. 1-2.
çetin K. Koç et al.: “Montgomery Multiplication in GF (2k)”,Designs, Codes and Crytography, vol. 14, No. 1, Apr. 1998, pp. 57-69.
Drescher, W. et al.: “VLSI Architectures for Multiplication in GF (2m) for Application Tailored Digital Signal Processors”, IEEE, 1996, pp. 55-64.
Orton, G. A. et al.: “VLSI Implementation of Public-Key Encryption Algorithms”, edited by G. Goos and J. Hartmanis, Lecture Notes in Computer Science, Advances in Cryptotology-CRYPTO '86, Springer-Verlag, pp. 277-301.
Alfred J. Menezes et al.: “Handbook of Applied Cryptography”,CRC Press, Boca Raton, pp. 600-603.
Erkay Savas et al.: “A Scalable and Unified Multiplier Architecture for Finite Fields GF(P) and GF(2m)*”,in ç.K. Koç et al.(ed.):CHES 200, LNCS 1965, pp. 277-292, Springer-Verlag, Berlin, 2000.
Elbe Astrid
Janssen Norbert
Sedlak Holger
Seifert Jean-Pierre
Chaki Kakali
Do Chat C.
Greenberg Laurence A.
Infineon - Technologies AG
Locher Ralph E.
LandOfFree
Method and apparatus for modular multiplying and calculating... 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 modular multiplying and calculating..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for modular multiplying and calculating... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3394743