Skip to main content

Uniformly Representable Permutation Polynomials

  • Conference paper
Book cover Sequences and their Applications

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

Abstract

We outline the basics for a systematic study of permutation polynomials on finite fields with characteristic 2, which admit a certain uniform representation. We describe a general technique to confirm the permutation property of such polynomials by algebraic calculations with multivariate polynomials over the two-element field. These computations are simple, but so extensive that they have to be done with computer support. We demonstrate that our method can be applied to all of the presently known classes of uniformly representable permutation polynomials, in particular to the o-polynomials of Glynn and Cherowitzo.

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. A Canteaut, P Charpin and H Dobbertin Couples der suites binaires de longueur maximale ayant une corrélation croisée à trois valeurs: conjecture de Welch C.R. Acad. Sci. Paris, Automatique théorique/Automation (theoretical) t. 328, Serie I, (1999), pp. 173–178.

    Google Scholar 

  2. A. Canteaut, P. Charpin and H. Dobbertin, A three-valued crosscorrelation function for binary m-sequences: a proof of Welch’s conjecture IEEE Transactions on Information Theory, to appear.

    Google Scholar 

  3. S. D. Cohen, private communication.

    Google Scholar 

  4. S. D. Cohen and R. W. Matthews, A class of exceptional polynomials Trans. Amer. Math. Soc. 345 (1994), pp. 897–909.

    Article  MathSciNet  MATH  Google Scholar 

  5. W. Cherowitzo, α-fiocks and hyperovals, Geometriae Dedicata, 72 (1998), pp. 221–246.

    Article  MathSciNet  MATH  Google Scholar 

  6. J. Dillon and H. Dobbertin, New difference sets with Singer parameters Finite Fields and their Applications, submitted.

    Google Scholar 

  7. H. Dobbertin, Almost perfect nonlinear power functions on GF(2π); The Welch case IEEE Transactions on Information Theory 45 (1999), pp. 1271–1275.

    Article  MathSciNet  MATH  Google Scholar 

  8. H. Dobbertin, Almost perfect nonlinear power functions on GF(2π); The Niho case Information and Computation 151 (1999), pp. 57–72.

    Article  MathSciNet  MATH  Google Scholar 

  9. H. Dobbertin, Kasami power functions, permutation polynomials and cyclic difference sets, Proceedings of the NATO-A.S.I. Workshop “Difference sets, sequences and their correlation properties”, Bad Windsheim, August 3–14, 1998, Kluwer Verlag, to appear.

    Google Scholar 

  10. R. Evans, H. Hollmann, C. Krattenthaler and Q. Xiang, Gauss sums, Jacobi sums, and p-ranks of cyclic difference sets, J. Combin. Theory Ser. A, to appear.

    Google Scholar 

  11. D Glynn Two new sequences of ovals in finite Desarguesian planes of even order Lecture Notes in Mathematics 1036 Springer, 1983, pp. 217–229.

    Article  MathSciNet  Google Scholar 

  12. H. Hollmann and Q. Xiang, A proof of the Welch and Niho conjectures on crosscorrelation on binary m-sequences, Finite Fields and their Applications, submitted.

    Google Scholar 

  13. A. Maschietti, Difference sets and hyperovals Designs, Codes and Cryptograrphy 14 (1998), pp. 89–98.

    Article  MathSciNet  MATH  Google Scholar 

  14. P Müller New examples of exceptional polynomials Finite Fields: Theory, Applications and Algorithms (GL Mullen and PJ Shiue eds.), Contemp. Math 168 (1994), pp. 245–249.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag London

About this paper

Cite this paper

Dobbertin, H. (2002). Uniformly Representable Permutation Polynomials. In: Helleseth, T., Kumar, P.V., Yang, K. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0673-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0673-9_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-529-8

  • Online ISBN: 978-1-4471-0673-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics