Advertisement

A New Reconfigurable-Oriented Method for Canonical Basis Multiplication over a Class of Finite Fields GF(2m)

  • José Luis Imaña
  • Juan Manuel Sánchez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2778)

Abstract

A new method for multiplication in the canonical basis over GF(2m) generated by an all-one-polynomial (AOP) is introduced. The theoretical complexities of the bit-parallel canonical multiplier constructed using our approach are equal to the smallest ones found in the literature for similar methods, but the multiplier implementation over reconfigurable hardware using our method reduces the area requirements.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Menezes, A.J. (ed.): Applications of Finite Fields. Kluwer Academic Publishers, Dordrecht (1993)Google Scholar
  2. 2.
    Itoh, T., Tsujii, S.: Structure of Parallel Multipliers for a Class of Finite Fields GF(\(2^{\it m}\)). Information and Computation 83, 21–40 (1989)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Halbutogullari, A., Koç, Ç.K.: Mastrovito Multiplier for General Irreducible Polynomials. IEEE Trans. Computers 49(5), 503–518 (2000)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Hasan, M.A., Wang, M.Z., Bhargava, V.K.: Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(\(2^{\it m}\)). IEEE Trans. Computers 41(8), 962–971 (1992)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Koç, Ç.K., Sunar, B.: Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a class of Finite Fields. IEEE Trans. Computers 47(3), 353–356 (1998)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Zhang, T., Parhi, K.K.: Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible polynomials. IEEE Trans. Computers 50(7), 734–749 (2001)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Imaña, J.L., Sánchez, J.M., Fernández, M.: Método de multiplicación canónica sobre campos GF(\(2^{\it m}\)) generados por AOPs orientado a hardware reconfigurable. In: II Jornadas sobre Computación Reconfigurable y Aplicaciones, JCRA, pp. 215–220 (2002)Google Scholar
  8. 8.
    Imaña, J.L.: Bit-Parallel Arithmetic Implementations over Finite Fields GF(\(2^{\it m}\)) with Reconfigurable Hardware. Acta Applicandae Mathematicae 73(3), 337–356 (2002)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Kao, C.C., Lai, Y.T.: A Routability Driven Technology Mapping Algorithm for LUT Based FPGA Designs. IEICE Trans. Fundamentals E84-A(11), 2690–2696 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • José Luis Imaña
    • 1
  • Juan Manuel Sánchez
    • 2
  1. 1.Dpto. Arquitectura de Computadores y AutomáticaUniversidad ComplutenseMadridSpain
  2. 2.Dpto. Informática, Escuela PolitécnicaUniversidad de ExtremaduraCáceresSpain

Personalised recommendations