On the inherent space complexity of fast parallel multipliers for GF(2m)

IEEE Transactions on Computers

Volumn 51, Issue 3, 2002, Pages 346-351

  Elia, Michele ^a   Leone, Manuel ^b  

^a POLITECNICO DI TORINO   (Italy)

^b TILAB   (Italy)

Author keywords

Finite fields; Optimal normal basis; Parallel multiplier

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; LOGIC GATES; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; SET THEORY; TENSORS; VECTORS;

OPTIMAL NORMAL BASES; PARALLEL MULTIPLIERS; PRIMITIVE NORMAL BASES;

MULTIPLYING CIRCUITS;

EID: 0036523306     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.990131     Document Type: Article

References (20)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison-Wesley, 1975.
2. L.E. Dickson, Linear Groups with an Exposition of the Galois Field Theory. New York: Dover, 1958.
3. A.J. Menezes, I. Blake, X. Gao, R. Mullin, S. Vanstone, and T. Yaghoobian, Applications of Finite Fields. Boston: Kluwer Academic, 1993.
4. R. Lidl and H. Niederreiter, Finite Fields. Reading, Mass.: Addison-Wesley, 1983.
5. I.E. Shparlinski, Computational and Algorithmic Problems in Finite Fields. Boston: Kluwer Academic, 1992.
6. S. Winograd, Arithmetic Complexity of Computation. Philadelphia: SIAM, 1980.
7. m) Yielding Small Complexity Arithmetic Circuits," IEEE Trans. Computers, vol. 47, pp. 938-946, 1998.
8. J. Hastad, "Tensor Rank Is NP-Complete," J. Algorithms, vol. 11, no. 4, pp. 644-654, 1990.
9. C.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.
10. C.K. Koç and B. Sunar, "Mastrovito Multiplier for All Trinomials," IEEE Trans. Computers, vol. 48, no. 5, pp. 522-527, May 1999.
11. J. Omura and J. Massey, "Computational Method and Apparatus for Finite Field Arithmetic," US Patent Number 4,587,627, May 1986.
12. m)," IEEE Trans. Computers, vol. 41, no. 8, pp. 962-971, Aug. 1992.
13. M.A. Hasan, M.Z. Wang, and V.K. Bhargava, "A Modified Massey-Omura Multiplier for a Class of Finite Fields," IEEE Trans. Computers, vol. 42, no. 10, pp. 1278-1280, Oct. 1993.
14. t)," IEEE Trans. Computers, vol. 47, pp. 960-970, 1998.
15. m)," Information and Computation, vol. 83, pp. 21-40, 1989.
16. 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. 846-861, July 1996.
17. E.D. Mastrovito, "VLSI Architectures for Computation in Galois Fields," PhD thesis, Dept. of Electrical Eng., Linköping, Univ., Sweden, 1991.
18. m)," Proc. 20th Biennal Symp. Comm., May 2000.
19. C.K. Koç and B. Sunar, "An Efficient Optimal Normal Basis Type II Multiplier," IEEE Trans. Computers, vol. 50, no. 1, pp. 83-87, Jan. 2001.
20. k + 1," Electronics Letters, vol. 35, no. 7, pp. 551-552, Apr. 1999.