Advertisement

Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems (Extended Abstract)

  • M. A. Hasan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1746)

Abstract

In this article, a look-up table based algorithm for GF(2n) multiplication is presented. In each iteration of the algorithm, a group of bits of one of the input operands are examined and two look-up tables are accessed. The group size determines the table sizes but does not affect the utilization of the processor resources. It can be used for both software and hardware realizations and is particularly suitable for implementations in memory constrained environment, such as, smart cards and embedded cryptosystems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E.D. Mastrovito, VLSI Architectures for Computations in Galois Fields. PhD thesis, Dept. Elect. Eng., Linköping University, Linköping, Sweden, 1991.Google Scholar
  2. 2.
    C. Koc and B. Sunar, “Mastrovito Multiplier for All Trinomials,” IEEE Trans. Computers, 1999.Google Scholar
  3. 3.
    T. Itoh and S. Tsujii, “Structure of Parallel Multipliers for a Class of Fields GF(2m),” Inform. and Comp., vol. 83, pp. 21–40, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    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 Trans. Comput., vol. 41, pp. 962–971, Aug. 1992.CrossRefMathSciNetGoogle Scholar
  5. 5.
    G. Harper, A. Menezes, and S. Vanstone, “Public-key cryptsystems with very small key lengths,” inAdvances in Cryptology-EUROCRYPT’ 92, Lecture Notes in Computer Science, pp. 163–173, Springer-Verlag, 1992.Google Scholar
  6. 6.
    E. Win, A. Bosselaers, S. Vandenberghe, P.D. Gersem, and J. Vandewalle, “A Fast Software Implementation for Arithmetic Operations in GF(2n),” inAdvances in Cryptology-ASIACRYPT’ 96, Lecture Notes in Computer Science, pp. 65–76, Springer, 1996.CrossRefGoogle Scholar
  7. 7.
    C. Koc and T. Acar, “Montgomery Multiplication in GF(2k),” Design, Codes and Cryptography, vol. 14(1), pp. 57–69, Apr. 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    J. Guajardo and C. Paar, “Efficient Algorithms for Elliptic Curve Cryptosystems,” in Advances in Cryptology-CRYPTO’ 97, Lecture Notes in Computer Science, pp. 342–356, Springer-Verlag, 1997.CrossRefGoogle Scholar
  9. 9.
    C. Paar, “A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields,” IEEE Trans. Computers, vol. 45(7), pp. 856–861, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Certicom Research, “GEC1: Recommended Elliptic Curve Domain Parameters,” in Standards for Efficient Cryptography Group, http://www.secg.org, 1999.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • M. A. Hasan
    • 1
  1. 1.University of WaterlooWaterlooSchaumburgCanadaUSA

Personalised recommendations