Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2007-11-20
2007-11-20
Do, Chat C. (Department: 2193)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
C380S044000
Reexamination Certificate
active
09948793
ABSTRACT:
This invention describes a method for evaluating a polynomial in an extension field FqM, wherein the method comprises the steps of partitioning the polynomial into a plurality of parts, each part is comprised of smaller polynomials using a q-thpower operation in a field of characteristic q; and computing for each part components of q-thpowers from components of smaller powers. A further embodiment of the invention provides for a method of converting a field element represented in terms of a first basis to its representation in a second basis, comprising the steps of partitioning a polynomial, being a polynomial in the second basis, into a plurality of parts, wherein each part is comprised of smaller polynomials using a q-thpower operation in a field of characteristic q; evaluating the polynomial at a root thereof by computing for each part components of q-thpowers from components of smaller powers; and evaluating the field element at the root of the polynomial.
REFERENCES:
patent: 4031370 (1977-06-01), Catherall
patent: 4417338 (1983-11-01), Davida
patent: 4847801 (1989-07-01), Tong
patent: 4866716 (1989-09-01), Weng
patent: 5485474 (1996-01-01), Rabin
patent: 5761102 (1998-06-01), Weng
patent: 6192497 (2001-02-01), Yang et al.
patent: 6895422 (2005-05-01), Walster et al.
patent: 0 806 838 (1997-11-01), None
Eric W. Weisstein, “Polynomial.” from MathWorld—A Wolfram Web Resource. http://mathworld.wolfram.com/Polynomial.html, no date filed.
Agnew, G. B. et al., “An Implementation of Elliptic Curve Cryptosystems over F2155,” IEEE Journal of Selected Areas in Communications, Jun. 1993, pp. 804-813, vol. 11, No. 5.
Lu, E. H. et al., “VLSI Architectures for computing Polynomials in GF(2n),” International Conference on Systems Engineering, 1987, pp. 555-558, IEEE, New York, US.
Kovac, M. et al., “Ace: A VLSI Chip for Galois Field GF(2m) Based Exponentiation,” IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, Apr. 1996, pp. 289-297, vol. 43, No. 4, IEEE, New York, US.
Blake Cassels & Graydon LLP
Certicom Corp.
Do Chat C.
Orange John R. S.
Slaney Brett J.
LandOfFree
System and method for efficient basis conversion does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for efficient basis conversion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for efficient basis conversion will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3814951