Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2005-10-18
2005-10-18
Mai, Tan V. (Department: 2193)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
06957243
ABSTRACT:
Finite field elements from the Galois field GF(2k) are represented as polynomials with binary valued coefficients. As such, multiplication in the field is defined modulo an irreducible polynomial of degree k−1. One of the multiplicands is treated in blocks of polynomials of degree n−1 so that the multiplier operates over T cycles where k=nT. If k is not a composite number to start with, higher order terms are added, so that multipliers are now constructable even when k is prime. Since n<k, the construction of the needed multiplier circuits are much simpler. Designers are now provided with an opportunity of easily trading off circuit speed for circuit complexity in an orderly and structured fashion.
REFERENCES:
patent: 5272661 (1993-12-01), Raghavan et al.
patent: 5680340 (1997-10-01), Glover et al.
patent: 5745398 (1998-04-01), Monier
patent: 5787028 (1998-07-01), Mullin
patent: 6044390 (2000-03-01), Golnabi et al.
patent: 6049815 (2000-04-01), Lambert et al.
Paar, et al., Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m), Advances in Cryptography-EUROCRYPT, 1997, W. Fumy, ed., pp363-378.
Paar et al., Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents, IEEE Transactions on Computers, vol. 48, Oct., 1999, pp. 1025-1034.
Mastrovito, E., VISI Designs for Multiplication over Finite Fields GF(2m), Lecture Notes in Computer Science, vol. 357, Berlin: Springer-Verlag, Mar., 1989, pp. 297-309.
Peterson, W., Error-Correcting Codes, The MIT Press, 1961.
Song et al., Low-Energy Digit-Serial/Parallel Finite Field Multipliers, Journal of VLSI Signal Processing 19, Kluwer Academic Publishers, 1998, pp. 150-166.
Cutter Lawrence D.
Mai Tan V.
LandOfFree
Block-serial finite field multipliers does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Block-serial finite field multipliers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block-serial finite field multipliers will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3486556