Skip to main content
Log in

On the complexity of the normal bases via prime Gauss period over finite fields

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

A formula on the complexity of the normal bases generated by prime Gauss period over finite fields is presented in terms of cyclotomic numbers. Then, the authors determine explicitly the complexity of such normal bases and their dual bases in several cases where the related cyclotomic numbers have been calculated. Particularly, the authors ¯nd several series of such normal bases with low complexity.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. B. Agnew, R. C. Mullin, I. M. Omyszchuk, and S. A. Vanstone, An implementation for a fast public key cryptosystem, J. Cryptology, 1991, 3: 63–79.

    MATH  MathSciNet  Google Scholar 

  2. G. B. Agnew, R. C. Mullin, and S. A. Vanstone, An implementation of elliptic curve cryptosystems over F2155, IEEE J. Select, Areas Commun., 1993, 11: 804–813.

    Article  Google Scholar 

  3. I. M. Onyszchuk, R. C. Mullin, and S. A. Vanstone, Computational Method and Apparatus for Finite Field Multiplication, U. S. Patent No. 4745568, May, 1998.

  4. X. H. Gao and H. W. Lenstra Jr., Optimal normal bases, Des. Codes and Cryptography, 1992, 2: 315–323.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Mullin, I. Onyszchuk, S. Vanstone, and R. Wilson, Optimal normal bases in GF(p n), Discrete Applied Math., 1988–1989, 22: 149–161.

    Article  MathSciNet  Google Scholar 

  6. B. Young and D. Panario, Low complexity normal bases in \( \mathbb {F}_{2^n}\), Finite Fields and Their Appl., 2004, 10: 53–64.

    Article  MATH  MathSciNet  Google Scholar 

  7. S. Feisel, J. V. Z. Gathen, and M. A. Shokro Llahi, Normal Bases via General Gauss Periods, Math. Comp., 1999, 68(225): 271–290.

    Article  MATH  MathSciNet  Google Scholar 

  8. X. H. Gao, Abelian groups, gauss periods, and normal bases, Finite Fields Appls., 2001, 7: 149–164.

    Article  Google Scholar 

  9. I. Blake, X. H. Gao, R. Mullin, S. Vanstone, and T. Yaghoobian, Applications of Finite Fields, Kluwer Academic Publishers, Dordrecht, 1993.

    MATH  Google Scholar 

  10. B. C. Berndt, R. J. Evans, and K. S. Williams, Gauss and Jacobi Sums, A Wiley-Interscience Pub., New York, 1998.

    MATH  Google Scholar 

  11. D. Jungnickel, Finite Fields: Structure and Arithmetics, Bibliographic schemes Institute, Mannerism, 1993.

    MATH  Google Scholar 

  12. M. Christopoulou, T. Garefalakis, D. Panario, and D. Thomson, The trace of an optimal normal element and low complexity normal bases, Des. Codes Cryptogr, DOI: 10.1007/s10623-008-9195-5.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qunying Liao.

Additional information

This research is supported by the National Fundamental Science Research Program 973 of China under Grant No. 2004 CB3180000 and the State Key Lab. (Information Security) of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liao, Q., Feng, K. On the complexity of the normal bases via prime Gauss period over finite fields. J Syst Sci Complex 22, 395–406 (2009). https://doi.org/10.1007/s11424-009-9172-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-009-9172-8

Key words

Navigation