This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms
September 2006 (vol. 55 no. 9)
pp. 1202-1206
Applying the matrix-vector product idea of the Mastrovito multiplier to the GF(2^{m}) Montgomery multiplication algorithm, we present a new parallel multiplier for irreducible trinomials. This multiplier and the corresponding shifted polynomial basis (SPB) multiplier have the same circuit structure for the same set of parameters. Furthermore, by establishing isomorphisms between the Montgomery and the SPB constructions of GF(2^{m}), we show that the Montgomery algorithm can be used to perform the SPB multiplication without any changes and vice versa.

[1] B. Sunar and C.K. Koc, “Mastrovito Multiplier for All Trinomials,” IEEE Trans. Computers, vol. 48, no. 5, pp. 522-527, May 1999.
[2] 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-749, July 2001.
[3] A. Halbutogullari and C.K. Koc, “Mastrovito Multiplier for General Irreducible Polynomials,” IEEE Trans. Computers, vol. 49, no. 5, pp. 503-518, May 2000.
[4] C. Paar, “A New Architecture for a Parallel Finite Field Multiplier with Low Complexity based on Composite Fields,” IEEE Trans. Computers, vol. 45, no. 7, pp. 856-861, July 1996.
[5] H. Wu, “Bit Parallel Finite Field Multiplier and Squarer Using Polynomial Basis,” IEEE Trans. Computers, vol. 51, no. 7, pp. 750-758, July 2002.
[6] H. Wu, “Montgomery Multiplier and Squarer for a Class of Finite Fields,” IEEE Trans. Computers, vol. 51, no. 5, pp. 521-529, May 2002.
[7] C.K. Koc and T. Acar, “Montgomery Multiplication in $GF(2^{k})$ ,” Designs, Codes, and Cryptography, vol. 14, pp. 57-69, 1998.
[8] E.D. Mastrovito, “VLSI Architectures for Multiplication over Finite Field $GF(2^{m})$ ,” Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, T.Mora, ed., pp. 297-309, Springer-Verlag, 1988.
[9] A. Reyhani-Masoleh and M.A. Hasan, “Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over $GF(2^{m})$ ,” IEEE Trans. Computers, vol. 53, no. 8, pp. 945-959, Aug. 2004.
[10] S.O. Lee, S.W. Jung, C.H. Kim, J. Yoon, J. Koh, and D. Kim, “Design of Bit Parallel Multiplier with Lower Time Complexity,” Proc. Int'l Conf. Information and Comm. Security (ICICS 2003), pp. 127-139, 2004.
[11] H. Fan and Y. Dai, “Fast Bit Parallel $GF(2^{m})$ Multiplier for All Trinomials,” IEEE Trans. Computers, vol. 54, no. 4, pp. 485-490, Apr. 2005.
[12] A. Satoh and K. Takano, “A Scalable Dual-Field Elliptic Curve Cryptographic Processor,” IEEE Trans. Computers, vol. 52, no. 4, pp. 449-460, Apr. 2003.
[13] E. Savas, A.F. Tenca, and C.K. Koc, “A Scalable and Unified Multiplier Architecture for Finite Fields $GF(p)$ and $GF(2^{m})$ ,” Proc. Cryptographic Hardware and Embedded Systems (CHES 2000), C.K. Koc and C. Paar, eds., pp.277-292, Aug. 2000.
[14] A.F. Tenca and C.K. Koc, “A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm,” IEEE Trans. Computers, vol. 52, no. 9, pp. 1215-1221, Sept. 2003.
[15] R. Lidl and H. Niederreiter, Finite Fields. Addison-Wesley, 1983.
[16] B.S. Kaliski Jr. and Y.L. Yin, “Storage-Efficient Finite Field Basis Conversion,” Selected Areas in Cryptography, S. Tavares and H. Meijer, eds., pp. 81-93, Springer-Verlag, 1998.
[17] S.E. Eldridge and C.D. Walter, “Hardware Implementation of Montgomery's Modular Multiplication Algorithm,” IEEE Trans. Computers, vol. 42, no. 6, pp. 693-699, June 1993.
[18] S.R. Dusse and B.S. Kaliski Jr., “A Cryptographic Library for the Motorola DSP56000,” Advances in Cryptology, Proc. EUROCRYPT, I.B. Damgard, ed., pp. 230-244, 1990.

Index Terms:
Finite field, multiplication, Montgomery multiplication algorithm, polynomial basis, shifted polynomial basis, irreducible trinomial.
Citation:
Haining Fan, M. Anwar Hasan, "Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms," IEEE Transactions on Computers, vol. 55, no. 9, pp. 1202-1206, Sept. 2006, doi:10.1109/TC.2006.152
Usage of this product signifies your acceptance of the Terms of Use.