Skip to main content

Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2m)1

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2001)

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

Included in the following conference series:

Abstract

This paper presents a new exponentiation architecture and multiplier/squarer for GF(2m), which uses a standard basis representation. The proposed multiplier/squarer is used as kernel architecture of exponentiation. Although the proposed multiplier/squarer computes the multiplication and squaring operations at the same time in GF(2m), the common parts existing in both operations are only executed once, thereby reducing the required hardware compared to related systolic circuits. The proposed multiplier/squarer can be easily applied to exponentiation architecture. It is also well suited to VLSI implementation because of its regularity, modularity, and unidirectional data flow.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Diffie and M. Hellman, “New Directions in Cryptography”, IEEE Trans. on Info. Theory, vol. IT-22(6) pp. 644–654, 1976.

    Article  MathSciNet  Google Scholar 

  2. I.S. Hsu, I.S. Reed, T.K. Truong, K. Wang, C.S. Yeh, and L.J. Deutsch, “The VLSI implementation of a Reed-Solomon encoder using Berlekamp’s bit-serial multiplier algorithm”, IEEE Trans. Computer, vol. C-33, pp. 906–911. Oct. 1984.

    Article  Google Scholar 

  3. S.K. Jain, L. Song, and K.K. Parhi, “Efficient Semisystolic Architectures for Finite-Field Arithmetic,” IEEE Trans. On VLSI Systems, vol. 6,no. 1, pp. 101–113, 1998.

    Article  Google Scholar 

  4. S.Y. Kung, VLSI Array Processors, Prentice-Hall, 1987.

    Google Scholar 

  5. R.J. McEliece, Finite Fields for Computer Scientists and Engineers, New York: Kluwer-Academic, 1987.

    MATH  Google Scholar 

  6. C.L. Wang and J.L. Lin, “Systolic Array Implementation of Multipliers for finite fields GF(2m)”, IEEE Trans. Circuits Systems, vol. 38, pp. 796–800, July 1991.

    Article  Google Scholar 

  7. C.S. Yeh, I.S. Reed, and T.K. Truong, “Systolic multipliers for finite fields GF(2m)”, IEEE Trans. Computer, vol. C-33, pp.357–360, Apr., 1984.

    Article  MathSciNet  Google Scholar 

  8. P.A. Scott, S.J. Simmons, S.E. Tavares, and L.E. Peppard, “Architectures for Exponentiation in GF(2m)”, IEEE J. Selected Areas in Comm., vol. 6.,no.3, pp.578–586, April., 1988.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, HS., Yoo, KY. (2001). Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2m)1 . In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-44679-6_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics