Skip to main content

A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation

  • Conference paper
  • First Online:

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

Abstract

This paper proposes a new arithmetic unit (AU) in GF(2m) for reconfigurable hardware implementation such as FPGAs, which overcomes the well-known drawback of reduced flexibility that is associated with traditional ASIC solutions. The proposed AU performs both division and multiplication in GF(2m). These operations are at the heart of elliptic curve cryptosystems (ECC). Analysis shows that the proposed AU has significantly less area complexity and has roughly the same or lower latency compared with some related circuits. In addition, we show that the proposed architecture preserves a high clock rate for large m (up to 571), when it is implemented on Altera’s EP2A70F1508C-7 FPGA device. Furthermore, the new architecture provides a high flexibility and scalability with respect to the field size m, since it does not restrict the choice of irreducible polynomials and has the features of regularity, modularity, and unidirectional data flow. Therefore, the proposed architecture is well suited for both division and multiplication unit of ECC implemented on FPGAs.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)

    Book  Google Scholar 

  2. Orlando, G., Parr, C.: A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m). In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, p. 41. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Bednara, M., Daldrup, M., von zur Gathen, J., Shokrollahi, J., Teich, J.: Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. In: Proc. of the International Parallel and Distributed Processing Symposium (IPDPS 2002), pp. 157–164 (2002)

    Google Scholar 

  4. Wang, C.-L., Lin, J.-L.: A Systolic Architecture for Computing Inverses and Divisions in Finite Fields GF(2m). IEEE Trans. Computers 42(9), 1141–1146 (1993)

    Article  MathSciNet  Google Scholar 

  5. Hasan, M.A., Bhargava, V.K.: Bit-Level Systolic Divider and Multiplier for Finite Fields GF(2m). IEEE Trans. Computers 41(8), 972–980 (1992)

    Article  MathSciNet  Google Scholar 

  6. Guo, J.-H., Wang, C.-L.: Systolic Array Implementation of Euclid’s Algorithm for Inversion and Division in GF(2m). IEEE Trans. Computers 47(10), 1161–1167 (1998)

    Article  Google Scholar 

  7. Goodman, J.R.: Energy Scalable Reconfigurable Cryptographic Hardware for Portable Applications. PhD thesis, MIT (2000)

    Google Scholar 

  8. Guo, J.-H., Wang, C.-L.: Bit-serial Systolic Array Implementation of Euclid’s Algorithm for Inversion and Division in GF(2m). In: Proc. 1997 Int. Symp. VLSI Tech., Systems and Applications, pp. 113–117 (1997)

    Google Scholar 

  9. Wang, C.L., Lin, J.L.: Systolic Array Implementation of Multipliers for Finite Field GF(2m). IEEE Trans. Circuits and Syst. 38(7), 796–800 (1991)

    Article  Google Scholar 

  10. Blum, T., Paar, C.: High Radix Montgomery Modular Exponentiation on Reconfigurable Hardware. IEEE Trans. Computers 50(7), 759–764 (2001)

    Article  Google Scholar 

  11. Han, S.D., Kim, C.H., Hong, C.P.: Characteristic Analysis of Modular Multiplier for GF(2m). In: Proc. of IEEK Summer Conference 2002, vol. 25(1), pp. 277–280 (2002)

    Google Scholar 

  12. Tessier, R., Burleson, W.: Reconfigurable Computing for Digital Signal Processing: A Survey. J. VLSI Signal Processing 28(1), 7–27 (1998)

    MATH  Google Scholar 

  13. Compton, K., Hauck, S.: Reconfigurable Computing: A Survey of Systems and Software. ACM Computing Surveys 34(2), 171–210 (2002)

    Article  Google Scholar 

  14. Kung, S.Y.: VLSI Array Processors. Prentice Hall, Englewood Cliffs (1988)

    Google Scholar 

  15. NIST, Recommended elliptic curves for federal government use (May 1999), http://csrc.nist.gov/encryption

  16. Altera, APEXTMII Programable Logic Device Family Data Sheet (August 2000), http://www.altera.com/literature/lit-ap2.html

  17. Kim, C.H., Hong, C.P.: High Speed Division Architecture for GF(2m). Electronics Letters 38(15), 835–836 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, C.H., Kwon, S., Kim, J.J., Hong, C.P. (2003). A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation. In: Y. K. Cheung, P., Constantinides, G.A. (eds) Field Programmable Logic and Application. FPL 2003. Lecture Notes in Computer Science, vol 2778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45234-8_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45234-8_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40822-2

  • Online ISBN: 978-3-540-45234-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics