Skip to main content
SpringerLink
Log in

Efficient Software Implementation for Finite Field Multiplication in Normal Basis

  • Conference paper
  • First Online:
Information and Communications Security (ICICS 2001)

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

Included in the following conference series:

Abstract

Finite field arithmetic is becoming increasingly important in today’s computer systems, particularly for implementing cryptographic operations. Among various arithmetic operations, finite field multiplication is of particular interest since it is a major building block for elliptic curve cryptosystems. In this paper, we present new techniques for ef- ficient software implementation of binary field multiplication in normal basis. Our techniques are more efficient in terms of both speed and memory compared with alternative approaches.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Ash, I. Blake, and S.A. Vanstone. Low Complexity Normal Basis. Discrete Applied Mathematics, Vol. 25, 1989.

    Google Scholar 

  2. E. De Win, A. Bosselaers, S. Vandenberghe, P. De Gersem, and J. Vandewalle. A fast software implementation for arithmetic operations in GF(2n). In Proc. Asiacrypt’96, 1996.

    Google Scholar 

  3. D. Hankerson, J.L. Hernandez, and A. Menesez. Software Implementation of Elliptic Curve Cryptography over Binary Fields. In Proc. CHES'2000, August 2000.

    Google Scholar 

  4. B. Kaliski and M. Liskov. Efficient Finite Field Basis Conversion Involvinga Dual Basis. In Proc. CHES’99, August 1999.

    Google Scholar 

  5. B. Kaliski and Y.L. Yin. Storage Efficient Finite Field Basis Conversion. In Proc. SAC’98, August 1998.

    Google Scholar 

  6. R.J. Lambert and A. Vadekar. Method and apparatus for finite field multiplication. US Patent 6,049,815, April 2000.

    Google Scholar 

  7. J. Lopez and R. Dahab. High-Speed software multiplication in F(2m). Technical report, IC-00-09, May 2000. Available at http://www.dcc.unicamp.br/ic-main/publications-e.html.

  8. J. L. Massey and J. K. Omura. Computational method and apparatus for finite field arithmetic. U.S. Patent 4,587,627, May 1986.

    Google Scholar 

  9. R.C. Mullin. Multiple Bit Multiplier. U.S. Patent 5,787,028, July 1998.

    Google Scholar 

  10. R.C. Mullin, I.M. Onyszchuk, and S.A. Vanstone. Computational Method and Apparatus for Finite Field Multiplication. U.S. Patent 4,745,568, May 1988.

    Google Scholar 

  11. R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone, and R. Wilson Optimal Normal Basis in GF(pm). Discrete Applied Mathematics, Vol. 22, 1988/1989.

    Google Scholar 

  12. P. Ning and Y. L. Yin. Efficient Software Implementation for Finite Field Multiplication in Normal Basis. Pending US Patent Application. Provisional patent application filed in December 1997.

    Google Scholar 

  13. M. Rosing. ImplementingEl liptic Curve Cryptography. Manning Publications Co., 1999.

    Google Scholar 

  14. A. Reyhani-Masoleh, M. A. Hasan. Fast Normal Basis Multiplication UsingGeneral Purpose Processors. To appear in the 8th Workshop on Selected Areas in Cryptography (SAC 2001). August 2001.

    Google Scholar 

  15. National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, February 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, North Carolina State University, 27695, Raleigh, NC, USA

    Peng Ning

  2. NTT Multimedia Communications Laboratories, Inc., 250 Cambridge Avenue, 94306, Palo Alto, CA, USA

    Yiqun Lisa Yin

Authors
  1. Peng Ning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yiqun Lisa Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineering Research Center for Information Security Technology (ERCIST), Chinese Academy of Sciences, P.O. Box 8718, 100080, Beijing, China

    Sihan Qing

  2. NTT Labs, 1-1 Hikarinooka, 239-0847, Yokosuka-shi, Japan

    Tatsuaki Okamoto

  3. Oracle Corporation, 500 Oracle Parkway, 94065, Redwood Shores, CA, USA

    Jianying Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ning, P., Yin, Y.L. (2001). Efficient Software Implementation for Finite Field Multiplication in Normal Basis. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45600-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42880-0

  • Online ISBN: 978-3-540-45600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation