Publication 2005 Issue No. 9 - September Abstract - Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)
Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)
September 2005 (vol. 54 no. 9)
pp. 1061-1070
 ASCII Text x "Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)," IEEE Transactions on Computers, vol. 54, no. 9, pp. 1061-1070, September, 2005.
 BibTex x @article{ 10.1109/TC.2005.147,author = {},title = {Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)},journal ={IEEE Transactions on Computers},volume = {54},number = {9},issn = {0018-9340},year = {2005},pages = {1061-1070},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.147},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)IS - 9SN - 0018-9340SP1061EP1070EPD - 1061-1070PY - 2005KW - Index Terms- Bit-parallel systolic multiplierKW - finite fieldKW - irreducible trinomialKW - montgomery multiplicationKW - irreducible AOP.VL - 54JA - IEEE Transactions on ComputersER -
Recently, cryptographic applications based on finite fields have attracted much interest. This paper presents a transformation method to implement low-complexity Montgomery multipliers for all-one polynomials and trinomials. Using this method, we proposed a new bit-parallel systolic architecture for computing multiplications over GF(2^m). These new multipliers have a latency m+1 clock cycles and each cell incorporates at most one 2-input AND gate, two 2-input XOR gates, and four 1-bit latches. Moreover, these new multipliers are shown to exhibit significantly lower latency and circuit complexity than the related systolic multipliers and are highly appropriate for VLSI systems because of their regular interconnection pattern, modular structure, and fully inherent parallelism.

[1] E.R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
[2] M.Y. Rhee, Cryptography and Secure Communications. Singapore: McGraw-Hill, 1994.
[3] N. Kobliz, “Elliptic Curve Cryptography,” Math. Computation, vol. 48, no. 177, pp. 203-209, Jan. 1987.
[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] C.K. Koc 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.
[6] B. Sunar and C.K. Koc, “Mastrovito Multiplier for All Trinomials,” IEEE Trans. Computers, vol. 48, no. 5, pp. 522-527, May 1999.
[7] M. Diab and A. Poli, “New Bit-Serial Systolic Multiplier for ${\rm GF}(2^{m})$ Using Irreducible Trinomials,” Electronics Letters, vol. 27, no. 20, pp. 1183-1184, June 1991.
[8] J.H. Guo and C.L. Wang, “A Low-Complexity Power-Sum Circuit for ${\rm GF}(2^{m})$ and Its Applications,” IEEE Trans. Circuits and Systems II, vol. 47, no. 10, pp. 1091-1097, Oct. 2000.
[9] C.L. Wang and J.L. Lin, “Systolic Array Implementation of Multipliers for ${\rm GF}(2^{m})$ ,” IEEE Trans. Circuits and Systems II, vol. 38, pp. 796-800, July 1991.
[10] C.S. Yeh, S. Reed, and T.K. Truong, “Systolic Multipliers for Finite Fields ${\rm GF}(2^{m})$ ,” IEEE Trans. Computers, vol. 33, no. 4, pp. 357-360, Apr. 1984.
[11] C.Y. Lee, E.H. Lu, and J.Y. Lee, “Bit-Parallel Systolic Multipliers for ${\rm GF}(2^{m})$ Fields Defined by All-One and Equally-Spaced Polynomials,” IEEE Trans. Computers, vol. 50, no. 5, pp. 385-393, May 2001.
[12] C.Y. Lee, E.H. Lu, and L.F. Sun, “Low-Complexity Bit-Parallel Systolic Architecture for Computing $AB^{2}+C$ in a Class of Finite Field ${\rm GF}(2^{m})$ ,” IEEE Trans. Circuits and Systems II, vol. 48, no. 5, pp. 519-523, May 2001.
[13] C.K. Koc and T. Acar, “Montgomery Multiplication in ${\rm GF}(2^{k}$ ),” Designs, Codes and Cryptography, vol. 14, no. 1, pp. 57-69, Apr. 1998.
[14] H. Wu, “Montgomery Multiplier and Squarer for a Class of Finite Fields,” IEEE Trans. Computers, vol. 51, no. 5, pp. 521-529, May 2002.
[15] J.C. Bajard, L. Imbert, C. Negre, and T. Plantard, “Efficient Multiplication in GF($p^{k}$ ) for Elliptic Curve Cryptography,” Proc. IEEE Symp. Computer Arithmetic, pp. 181-187, June 2003.
[16] C.L. Wang, “Bit-Level Systolic Array for Fast Exponentiation in ${\rm GF}(2^{m})$ ,” IEEE Trans. Computers, vol. 43, no. 7, pp. 838-841, July 1994.
[17] C.Y. Lee, “Low Complexity Bit-Parallel Systolic Multiplier over ${\rm GF}(2^{m})$ Using Irreducible Trinomials,” IEE Proc. Computers and Digital Technology, vol. 150, pp. 39-42, Jan. 2003.
[18] A.J. Menezes, Applications of Finite Fields. Kluwer Academic, 1993.
[19] I.F. Blake, S. Gao, and R.L. Lambert, “Construction and Distribution Problems for Irreducible Trinomials over Finite Fields,” Applications of Finite Fields, pp. 19-32, Oxford: Clarendon Press, 1996.
[20] W. Stahnke, “Primitive Binary Polynomials,” Math. Computation, vol. 27, pp. 977-980, 1973.
[21] R.P. Brent and P. Zimmermann, “Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials,” Proc. Conf. in Honor of Professor H.C. Williams, May 2003.
[22] G. Seroussi, “Table of Low-Weight Binary Irreducible Polynomials,” Visual Computing Dept., Hewlett Packard Laboratories, Aug. 1998, http://www.hpl.hp.com/techreports/98HPL-98-135.html .
[23] P.L. Montgomery, “Modular Multiplication without Trial Division,” Math. Computation, no. 44, pp. 519-521, 1985.

Index Terms:
Index Terms- Bit-parallel systolic multiplier, finite field, irreducible trinomial, montgomery multiplication, irreducible AOP.
Citation:
"Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)," IEEE Transactions on Computers, vol. 54, no. 9, pp. 1061-1070, Sept. 2005, doi:10.1109/TC.2005.147