This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Low Complexity Multiplication in a Finite Field Using Ring Representation
April 2003 (vol. 52 no. 4)
pp. 418-427

Abstract—Elements of a finite field, GF(2^m ), are represented as elements in a ring in which multiplication is more time efficient. This leads to faster multipliers with a modest increase in the number of XOR and AND gates needed to construct the multiplier. Such multipliers are used in error control coding and cryptography. We consider rings modulo trinomials and 4-term polynomials. In each case, we show that our multiplier is faster than multipliers over elements in a finite field defined by irreducible pentanomials. These results are especially significant in the field of elliptic curve cryptography, where pentanomials are used to define finite fields. Finally, an efficient systolic implementation of a multiplier for elements in a ring defined by x^n + x + 1 is presented.

[1] D.R. Hankerson, D.G. Hoffman, D.A. Leonard, C.C. Lindner, K.T. Phelps, C.A. Rodger, and J.R. Wall, Coding Theory and Cryptography: The Essentials, second ed. Marcel Dekker, 2000.
[2] E. Trichina, M. Bucci, D. De Seta, and R. Luzzi, “Supplemental Cryptographic Hardware for Smart Cards,” IEEE Micro, pp. 26-35, Nov./Dec. 2001.
[3] J. Dhem and N. Feyt, “Hardware and Software Symbiosis Helps Smart Card Evolution,” IEEE Micro, pp. 14-25, Nov./Dec. 2001.
[4] M. Smith, “Smart Cards: Integrating for Portable Complexity,” Computer, pp. 110-115, Aug. 1998.
[5] P.W. Dowd and J.T. McHenry, “Network Security,” Computer, pp. 24-28, Sept. 1998.
[6] B. Schneier, Applied Cryptography. John Wiley&Sons, 1996.
[7] N. Koblitz, A Course in Number Theory and Cryptography, GTM. Springer-Verlag, 1987.
[8] Ç.K. Koç and B. Sunar, Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields IEEE Trans. Computers, vol. 47, no. 3, pp. 353-356, Mar. 1998.
[9] A. Halbutogullari and C.K. Koc, Mastrovito Multiplier for General Irreducible Polynomials IEEE Trans. Computers, vol. 49, no. 5, pp. 503-518, May 2000.
[10] M.A. Hasan and A.G. Wassal, “VLSI Algorithms, Architectures, and Implementation of a Versatile$\big. {\rm GF}(2^m)\bigr.$Processor,” IEEE Trans. Computers, vol. 49, no. 10, pp. 1064-1073, Oct. 2000.
[11] G. Drolet, “A New Representation of Elements of Finite Fields$\big. {\rm GF}(2^m)\bigr.$Yielding Small Complexity Arithmetic Circuits,” IEEE Trans. Computers, vol. 47, no. 9, pp. 938-946, Sept. 1998.
[12] C. Paar, P. Fleishmann, and P. Soria-Rodriguez, Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents IEEE Trans. Computers, vol. 48, no. 10, pp. 1025-1034, Oct. 1999.
[13] T.W. Hungerford, Algebra, eighth ed. Springer-Verlag, 1997.
[14] W.V. Vasconcelos, Computational Methods in Commutative Algebra and Algebraic Geometry. Springer-Verlag, 1997.
[15] C. Lee, E. Lu, and J. Lee, “Bit-Parallel Systolic Multipliers for$\big. GF(2^m)\bigr.$Fields Defined by All-One and Equally Spaced Polynomials,” IEEE Trans. Computers, vol. 50, no. 5, pp. 385-393, May 2001.
[16] T. Zhang and K.K. Parhi, Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials IEEE Trans. Computers, vol. 50, no. 7, pp. 734-748, July 2001.

Index Terms:
Finite field multiplication, ring representation, systolic arrays.
Citation:
Rajendra Katti, Joseph Brennan, "Low Complexity Multiplication in a Finite Field Using Ring Representation," IEEE Transactions on Computers, vol. 52, no. 4, pp. 418-427, April 2003, doi:10.1109/TC.2003.1190583
Usage of this product signifies your acceptance of the Terms of Use.