Skip to main content
SpringerLink
Log in

Almost weakly self-dual bases for finite fields

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We characterize almost weakly self-dual polynomial bases for the finite field

over

, where

denotes the finite field of order q a prime power. We also extend a formula for the excess of certain polynomial bases from the case q = 2 to general q.

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

Access this article

Log in via an institution

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. Cohen, S. D.: The distribution of polynomials over finite fields. Acta Arith. 17, 255–271 (1970)

    MATH  MathSciNet  Google Scholar 

  2. Cohen, S. D.: The distribution of polynomials over finite fields, II. Acta Arith. 20, 53–62 (1972)

    MATH  MathSciNet  Google Scholar 

  3. Cohen, S. D.: Uniform distribution of polynomials over finite fields. J. Lond. Math. Soc. 6, 93–102 (1972)

    Article  MATH  Google Scholar 

  4. Cohen, S. D.: Primitive elements and polynomials with arbitrary trace. Discrete Math. 83, 1–7 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gao, S., Lenstra, H. W., Jr.:Optimal normal bases. Designs, Codes Cryptography, 2, 315–323 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Geiselmann, W.: Weakly self-dual normal bases in finite fields, submitted to Proc. Applications of Finite Fields. London, July, 1994

  7. Geiselmann, W., Gollmann, D.: Self-dual bases in . Designs, Codes Cryptography, 3, 333–345 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gollmann, D.: Efficient bit-serial multiplication in 30-02, 3-rd Symp. on State and Progress of Research in Cryptography, Rome, Feb., 1993

  9. Gollmann, D.: Algorithmenentwurf in der Kryptographie, Bibliographisches Institut, Mannheim, Germany 1994

    MATH  Google Scholar 

  10. Hansen, T., Mullen, G. L.: Primitive polynomials over finite fields. Math. Computation 59 (1992), pp. 639–643; Suppl: 59(1992), S47-S50

    Article  MATH  MathSciNet  Google Scholar 

  11. Hansen, T., Mullen, G. L.: Primitive polynomials of low weight, Finite Fields, Coding Theory, and Advances in Communications and Computing, Mullen, G. L., Shiue, P. J.-S. (eds) Lect. Notes Pure Appl. Math., Vol. 141, Marcel Dekker, New York, 1993, p. 434

    Google Scholar 

  12. Jungnickel, D.: Finite Fields, Bibliographisches Institut, Mannheim, Germany, 1993

    MATH  Google Scholar 

  13. Jungnickel, D.: Trace-orthogonal normal bases. Discrete Appl. Math. 47, 233–249 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. Jungnickel, D., Menezes A. J., Vanstone, S. A.: On the number of selfdual bases of GF(q m) over GF(q). Proc. Am. Math. Soc. 109, 23–29 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  15. Menezes A. J.: Applications of Finite Fields. Kluwer Academic Publishers, Dordrecht 1993

    MATH  Google Scholar 

  16. Mullen, G. L.: Bases and the distribution of irreducible and primitive polynomials over finite fields, to appear, Proc. “Applications of Finite Fields,” London, July, 1994

  17. Mullin, R. C., Onyszchuk, I. M., Vanstone, S. A. Wilson, R. M.: Optimal normal bases, Discrete Appl. Math. 22, 149–161 (1988/89)

    Article  MathSciNet  Google Scholar 

  18. Ree, R.: Proof of a conjecture of S. Chowla. J. Number Theory 3, 210–212(1971); Erratum, ibid. 4, 223 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  19. Séguin, J. E., Low complexity normal bases. Discrete Appl. Math. 28, 309–312 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  20. Shparlinski, I., On primitive polynomials. Problemy Peredachi Infor. 23, 100–103 (1987) (In Russian)

    MathSciNet  Google Scholar 

  21. Shparlinski, I. E.: Computational and Algorithmic Problems in Finite Fields, Math. & Its Appls., Kluwer Academic Publishers, Dordrecht 1992

    Google Scholar 

  22. Stinson, D. R.: On bit-serial multiplication and dual bases in GF(2m) IEEE Trans. Infor. Theory, IT-37, 1733–1736 (1991)

    Google Scholar 

  23. živković, M.: A table of primitive binary polynomials. Math. Computation 62, 385–386 (1994); See also Microfiche Supplement

    Article  MATH  Google Scholar 

  24. živković, M.: Table of primitive binary polynomials, II. Math. Computation, 63, 301–306 (1994)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Missouri-Rolla, 65401-0249, Rolla, MO, USA

    Ilene H. Morgan

  2. Department of Mathematics, The Pennsylvania State University, 16802, University Park, PA, USA

    Gary L. Mullen

  3. Faculty of Mathematics, University of Belgrade Studentski trg 16, P.P. 550, 11000, Belgrade, Yugoslavia

    Miodrag živković

Authors
  1. Ilene H. Morgan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gary L. Mullen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Miodrag živković
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ilene H. Morgan.

Additional information

M. živković’s, research was supported by the Science Fund of Serbia grant #0401A, through the Matematički Institut

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morgan, I.H., Mullen, G.L. & živković, M. Almost weakly self-dual bases for finite fields. AAECC 8, 25–31 (1997). https://doi.org/10.1007/s002000050049

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050049

Keywords

Search

Navigation