Skip to main content

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

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1746))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. C. Koc and B. Sunar, “Mastrovito Multiplier for All Trinomials,” IEEE Trans. Computers, 1999.

    Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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. 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.

    Chapter  Google Scholar 

  7. C. Koc and T. Acar, “Montgomery Multiplication in GF(2k),” Design, Codes and Cryptography, vol. 14(1), pp. 57–69, Apr. 1998.

    Article  Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  10. Certicom Research, “GEC1: Recommended Elliptic Curve Domain Parameters,” in Standards for Efficient Cryptography Group, http://www.secg.org, 1999.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hasan, M.A. (1999). Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems (Extended Abstract). In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66887-9

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics