Skip to main content

Permutations amongst the Dembowski-Ostrom Polynomials

  • Conference paper
Book cover Finite Fields and Applications

Abstract

We note that certain Dembowski-Ostrom polynomials can be obtained from the product of two linearised polynomials. We examine this subclass for permutation behaviour over finite fields. In particular, a new infinite class of permutation polynomials is identified.

Supported by an Australian Research Council grant

Supported by the Australian Research Council and the University of Ghent

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. H.W. Bao, On two exponential sums and their applications, Finite Fields Appl. 3 (1997), 115–130.

    Article  MathSciNet  Google Scholar 

  2. W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24 (1997), 235–265.

    Article  MathSciNet  MATH  Google Scholar 

  3. R.S. Coulter, On the evaluation of a class of Weil sums in characteristic 2, New Zealand J. Math. 28 (1999), 171–184.

    MathSciNet  MATH  Google Scholar 

  4. P. Dembowski and T.G. Ostrom, Planes of order n with collineation groups of order n 2 Math. Z. 103 (1968), 239–258.

    Article  MathSciNet  MATH  Google Scholar 

  5. R. Lidl and G.L. Mullen, When does a polynomial over a finite field permute the elements of the field?, Amer. Math. Monthly 95 (1988), 243–246.

    Article  MathSciNet  MATH  Google Scholar 

  6. R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia Math. Appl., vol. 20, Addison-Wesley, Reading, 1983, (now distributed by Cambridge University Press).

    Google Scholar 

  7. J. Patarin, Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms, Advances in Cryptology-Eurocrypt’ 96 (U. Maurer, ed.), Lecture Notes in Computer Science, vol. 1070, 1996, pp. 33–48.

    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

Blokhuis, A., Coulter, R.S., Henderson, M., O’Keefe, C.M. (2001). Permutations amongst the Dembowski-Ostrom Polynomials. In: Jungnickel, D., Niederreiter, H. (eds) Finite Fields and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56755-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56755-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62498-8

  • Online ISBN: 978-3-642-56755-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics