Advertisement

Efficient Reconfigurable Implementation of Canonical and Normal Basis Multipliers Over Galois Fields GF(2 m ) Generated by AOPs

  • J.L. Imaña
  • J.M. Sánchez
Article
  • 75 Downloads

Abstract.

Galois fields GF(2 m ) are used in modern communication systems such as computer networks, satellite links, or compact disks, and they play an important role in a wide number of technical applications. They use arithmetic operations in the Galois field, where the multiplication is the most important and one of the most complex operations. Efficient multiplier architectures are therefore specially important. In this paper, a new method for multiplication in the canonical and normal basis over GF(2 m ) generated by an AOP (all-one-polynomial), which we have named the transpositional method, is presented. This new approach is based on the grouping and sharing of subexpressions. The theoretical space and time complexities of the bit-parallel canonical and normal basis multipliers constructed using our approach are equal to the smallest ones found in the literature for similar methods, but the practical implementation over reconfigurable hardware using our method reduces the area requirements of the multipliers.

Keywords:

Galois field GF(2mcanonical basis normal basis bit-parallel multiplier reconfigurable hardware 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Lidl and H. Niederreiter, Finite Fields, Reading, MA: Addison-Wesley, 1983.Google Scholar
  2. 2.
    I. Stewart, Galois Theory, 2nd edition. Chapman & Hall Mathematics, 1989.Google Scholar
  3. 3.
    A.J. Menezes, Applications of Finite Fields, Kluwer Academic, 1993.Google Scholar
  4. 4.
    C. Paar, Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields, PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1994.Google Scholar
  5. 5.
    T. Itoh and S. Tsujii, “Structure of Parallel Multipliers for a Class of Finite Fields GF(2m),” Information and Computation, vol. 83, 1989, pp. 21–40.MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    E.D. Mastrovito, “VLSI Architectures for Multiplication over Finite Fields GF(2m),” in Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, 6th Int'l Conf., AAECC-6, New York: Springer-Verlag, Rome, Italy, 1988, pp. 297–309.Google Scholar
  7. 7.
    J. Omura and J. Massey, “Computational Method and Apparatus for Finite Field Arithmetic,” U.S. Patent Number 4,587, 627, 1986.Google Scholar
  8. 8.
    M.A. Hasan, M.Z. Wang, and V.K. Bhargava, “A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields,” IEEE Transactions on Computers, vol. 42, no. 10, 1993, pp. 1278–1280.CrossRefMATHGoogle Scholar
  9. 9.
    B. Sunar, and Ç.K. Koç, “An Efficient Optimal Normal Basis Type II Multiplier,” IEEE Transactions on Computers, vol. 50, no. 1, 2001, pp. 83–87.CrossRefMATHGoogle Scholar
  10. 10.
    S.T.J. Fenn, M. Benaissa, and D. Taylor, “GF(2m) Multiplication and Division over the Dual Basis,” IEEE Transactions on Computers, vol. 45, no. 3, 1996, pp. 319–327.CrossRefMATHGoogle Scholar
  11. 11.
    M.A. Hasan, “Double-Basis Multiplicative Inversion over GF(2m),” IEEE Transactions on Computers, vol. 47, no. 9, 1998, pp. 960–970.MathSciNetCrossRefGoogle Scholar
  12. 12.
    M.A. Hasan, M.Z. Wang, and V.K. Bhargava, “Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2m),” IEEE Transactions on Computers, vol. 41, no. 8, 1992, pp. 962–971.MathSciNetCrossRefGoogle Scholar
  13. 13.
    Ç.K. Koç and B. Sunar, “Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields,” IEEE Transactions on Computers, vol. 47, no. 3, 1998, pp. 353–356.CrossRefMATHGoogle Scholar
  14. 14.
    A. Halbutogullari and Ç.K. Koç, “Mastrovito Multiplier for General Irreducible Polynomials,” IEEE Transactions on Computers, vol. 49, no. 5, 2000, pp. 503–518.CrossRefGoogle Scholar
  15. 15.
    T. Zhang and K.K. Parhi, “Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials,” IEEE Transactions on Computers, vol. 50, no. 7, 2001, pp. 734–749.MathSciNetCrossRefGoogle Scholar
  16. 16.
    W.-J. Woan, “Hankel Matrices and Lattice Paths,” Integer Sequences J., vol. 4, no. (01.1.2), 2001.Google Scholar
  17. 17.
    J.L. Imaña and J.M. Sánchez, “A New Reconfigurable-Oriented Method for Canonical Basis Multiplication over a Class of Finite Fields GF(2m),” in Field Programmable Logic and Applications. Proceedings of the 13th International Conference, FPL 2003, Lecture Notes in Computer Science, Springer-Verlag, Sept. 2003, pp. 1127–1130.Google Scholar
  18. 18.
    C.C. Kao and Y.T. Lai, “A Routability Driven Technology Mapping Algorithm for LUT Based FPGA Designs,” IEICE Trans. Fundamentals, vol. E84-A, no. 11, 2001, pp. 2690–2696.Google Scholar
  19. 19.
    J.L. Imaña and J.M. Sánchez, “Normal Basis Multipliers Construction over a Class of Finite Fields GF(2m),” in Design of Circuits and Integrated Systems. Proceedings of the XVIII Conference, Nov. 2003, pp. 659–663.Google Scholar
  20. 20.
    A. Reyhani-Masoleh and M. Anwar Hasan, “Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2m),” IEEE Transactions on Computers, vol. 53, no. 8, 2004, pp. 945–959.CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Departamento de Arquitectura de Computadores y Automática, Facultad Ciencias FísicasUniversidad Complutense de MadridMadridSpain
  2. 2.Departamento de Informática. Escuela PolitécnicaUniversidad de Extremadura, Avda. UniversidadCáceresSpain

Personalised recommendations