Skip to main content

A Note on a Class of Quadratic Permutations over \({\mathbb F}_{{2^n}}\)

  • Conference paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4851))

Abstract

Finding new classes of permutation polynomials is a challenging problem. Blockhuis at al. investigated the permutation behavior of polynomials of the form \(\sum_{i=0}^{n-1}a_iX^{2^i+1}\) over \({\mathbb F}_{{2^n}}\). In this paper, we extend their results and propose as a new conjecture that if nā€‰=ā€‰2e then X 2 is the only unitary permutation polynomial of this type.

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 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. Lidl, R., Mullen, G.: When does a Polynomial over a Finite Field Permute the Elements of the Field? Amer. Math. MonthlyĀ 100, 71ā€“74 (1993)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  2. Lidl, R., Niederreiter, H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997)

    Google ScholarĀ 

  3. Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.Ā 1070, pp. 33ā€“48. Springer, Heidelberg (1996)

    Google ScholarĀ 

  4. Dobbertin, H.: Almost Perfect Nonlinear Power Functions on GF(2N): The Niho Case. Inf. Comput.Ā 151(1-2), 57ā€“72 (1999)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  5. Budaghyan, L., Carlet, C., Leander, G.: A Class of Quadratic APN Binomials Inequivalent to Power Functions. Cryptology ePrint Archive, Report 2006/445 (2006), http://eprint.iacr.org/

  6. Blokhuis, A., Coulter, R.S., Henderson, M., Oā€™Keefe, C.M.: Permutations Amongst the Dembowski-Ostrom Polynomials. In: 1999 Finite Fields and Applications, pp. 37ā€“42. Springer, Berlin (2001)

    Google ScholarĀ 

  7. Payne, S.: A Complete Determination of Translation Ovoids in Finite Desarguian Planes. Lincei - Rend. Sc. fis. mat. e nat. (1971)

    Google ScholarĀ 

  8. Berger, T., Canteaut, A., Charpin, P., Laigle-Chapuy, Y.: Almost Perfect Nonlinear Functions. Technical Report RR-5774, INRIA Rocquencourt (2005), http://www.inria.fr/rrrt/rr-5774.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Serdar Boztaş Hsiao-Feng (Francis) Lu

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laigle-Chapuy, Y. (2007). A Note on a Class of Quadratic Permutations over \({\mathbb F}_{{2^n}}\) . In: Boztaş, S., Lu, HF.(. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2007. Lecture Notes in Computer Science, vol 4851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77224-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77224-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77223-1

  • Online ISBN: 978-3-540-77224-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics