Skip to main content

New Classes of APN and AB Polynomials

  • Chapter
  • First Online:
Construction and Analysis of Cryptographic Functions
  • 707 Accesses

Abstract

In this chapter we present several methods for construction of APN functions. Using these methods we construct 7 out of 11 known infinite families of quadratic APN polynomials CCZ-inequivalent to power functions, 4 of which are also AB when n is odd.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.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

References

  1. T. Bending, D. Fon-Der-Flaass. Crooked functions, bent functions and distance-regular graphs. Electron. J. Comb., 5 (R34), 14, 1998.

    MathSciNet  Google Scholar 

  2. J. Bierbrauer. New semifields, PN and APN functions. Designs, Codes and Cryptography, v. 54, pp. 189–200, 2010.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. W. Bluher. On existence of Budaghyan-Carlet APN hexanomials. http://arxiv.org/abs/1208.2346 (2012)

  4. C. Bracken, Z. Zha. On the Fourier Spectra of the Infinite Families of QuadraticAPNFunctions. Finite Fields and Their Applications 18(3), pp. 537–546, 2012.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Bracken, E. Byrne, N. Markin, G. McGuire. New families of quadratic almost perfect nonlinear trinomials and multinomials. Finite Fields and TheirApplications 14(3), pp. 703–714, 2008.

    Article  MATH  MathSciNet  Google Scholar 

  6. C. Bracken, E. Byrne, N. Markin, G. McGuire. On the Fourier spectrum of Binomial APN functions. SIAM journal of Discrete Mathematics, 23(2), pp. 596–608, 2009.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Bracken, E. Byrne, N. Markin, G. McGuire. A Few More Quadratic APN Functions. Cryptography and Communications 3(1), pp. 43–53, 2011.

    Article  MATH  MathSciNet  Google Scholar 

  8. C. Bracken, C. H. Tan, Y. Tan. Binomial differentially 4 uniform permutations with high nonlinearity. Finite Fields and Their Applications 18(3), pp. 537–546, 2012.

    Article  MATH  MathSciNet  Google Scholar 

  9. K. A. Browning, J. F. Dillon, R. E. Kibler, M. T. McQuistan. APN Polynomials and Related Codes. Journal of Combinatorics, Information and System Science, Special Issue in honor of Prof. D.K Ray-Chaudhuri on the occasion of his 75th birthday, vol. 34, no. 1–4, pp. 135–159, 2009.

    MATH  Google Scholar 

  10. L. Budaghyan. The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions. Proceedings of First International Workshop on Arithmetic of Finite Fields, WAIFI 2007, Lecture Notes in Computer Science 4547, pp. 177–188, 2007.

    MathSciNet  Google Scholar 

  11. L. Budaghyan and C. Carlet. Classes of Quadratic APN Trinomials and Hexanomials and Related Structures. IEEE Trans. Inform. Theory, vol. 54, no. 5, pp. 2354–2357, May 2008.

    Article  MATH  MathSciNet  Google Scholar 

  12. L. Budaghyan and A. Pott. On Differential Uniformity and Nonlinearity of Functions. Special Issue of Discrete Mathematics devoted to “Combinatorics 2006”, 309(2), pp. 371–384, 2009.

    Article  MATH  MathSciNet  Google Scholar 

  13. L. Budaghyan, C. Carlet, A. Pott. New Classes of Almost Bent and Almost Perfect Nonlinear Functions. IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1141–1152, March 2006.

    Article  MATH  MathSciNet  Google Scholar 

  14. L. Budaghyan, C. Carlet, G. Leander. Two classes of quadratic APN binomials inequivalent to power functions. IEEE Trans. Inform. Theory, 54(9), pp. 4218–4229, 2008.

    Article  MATH  MathSciNet  Google Scholar 

  15. L. Budaghyan, C. Carlet, G. Leander. On a construction of quadratic APN functions. Proceedings of IEEE Information TheoryWorkshop, ITW'09, pp. 374–378, Taormina, Sicily, Oct. 2009.

    Google Scholar 

  16. L. Budaghyan, C. Carlet, G. Leander. Constructing new APN functions from known ones. Finite Fields and Their Applications, v. 15, issue 2, pp. 150–159, April 2009.

    Article  MATH  MathSciNet  Google Scholar 

  17. A. Canteaut, P. Charpin, H. Dobbertin. Weight divisibility of cyclic codes, highly nonlinear functions on \(\mathbb{F2}^m\), and crosscorrelation of maximum-length sequences. SIAM Journal on Discrete Mathematics, 13(1), pp. 105–138, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  18. A. Canteaut, P. Charpin and H. Dobbertin. Binary m-sequences with three-valued crosscorrelation: A proof of Welch’s conjecture. IEEE Trans. Inform. Theory, 46 (1), pp. 4–8, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  19. C. Carlet. Vectorial Boolean Functions for Cryptography. Chapter of the monography Boolean Methods and Models, Yves Crama and Peter Hammer eds, Cambridge University Press, pp. 398–469, 2010.

    Google Scholar 

  20. C. Carlet. Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions. Designs, Codes and Cryptography, v. 59(1–3), pp. 89–109, 2011.

    Article  MATH  MathSciNet  Google Scholar 

  21. C. Carlet, P. Charpin and V. Zinoviev. Codes, bent functions and permutations suitable for DES-like cryptosystems. Designs, Codes and Cryptography, 15(2), pp. 125–156, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  22. J. F. Dillon. Elementary Hadamard Difference sets. Ph. D. Thesis, Univ. of Maryland, 1974.

    Google Scholar 

  23. J. F. Dillon. APN Polynomials and Related Codes. Polynomials over Finite Fields and Applications, Banff International Research Station, Nov. 2006.

    Google Scholar 

  24. J. F. Dillon. Private communication, Feb. 2007.

    Google Scholar 

  25. H. Dobbertin. Almost perfect nonlinear power functions over \(GF(2^n)\): a new case for n divisible by 5. Proceedings of Finite Fields and Applications FQ5, pp. 113–121, 2000.

    Google Scholar 

  26. H. Dobbertin, Uniformly representable permutation polynomials, T. Helleseth, P.V. Kumar and K. Yang eds., Proceedings of “Sequences and their applications–SETA '01”, Springer Verlag, London, 1–22, 2002.

    Google Scholar 

  27. Y. Edel and A. Pott. A new almost perfect nonlinear function which is not quadratic. Advances in Mathematics of Communications 3, no. 1, pp. 59–81, 2009.

    Article  MATH  MathSciNet  Google Scholar 

  28. Y. Edel, G. Kyureghyan and A. Pott. A new APN function which is not equivalent to a power mapping. IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 744–747, Feb. 2006.

    Article  MATH  MathSciNet  Google Scholar 

  29. G. Lachaud and J. Wolfmann. The Weights of the Orthogonals of the Extended Quadratic Binary Goppa Codes. IEEE Trans. Inform. Theory, vol. 36, pp. 686–692, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  30. G. Leander. Monomial bent functions. IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 738–743, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  31. K. Nyberg. S-boxes and Round Functions with Controllable Linearity and Differential Uniformity. Proceedings of Fast Software Encryption 1994, LNCS 1008, pp. 111–130, 1995.

    Google Scholar 

  32. S. Yoshiara. Equivalence of quadraticAPN functions. J. Algebr. Comb. 35, pp. 461–475, 2012.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lilya Budaghyan .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Budaghyan, L. (2014). New Classes of APN and AB Polynomials. In: Construction and Analysis of Cryptographic Functions. Springer, Cham. https://doi.org/10.1007/978-3-319-12991-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12991-4_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12990-7

  • Online ISBN: 978-3-319-12991-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics