Skip to main content

Determining the Nonlinearity of a New Family of APN Functions

  • 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

We compute the Walsh spectrum and hence the nonlinearity of a new family of quadratic multi-term APN functions. We show that the distribution of values in the Walsh spectrum of these functions is the same as the Gold function.

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. Bracken, C., Byrne, E., Markin, N., McGuire, G.: New Families of Quadratic Almost Perfect Nonlinear Trinomials and Multinomials (preprint, 2007)

    Google Scholar 

  2. Budaghyan, L., Carlet, C., Felke, P., Leander, G.: An Infinite Class of Quadratic APN Functions Which Are Not Equivalent to Power Mappings. In: 2006 IEEE Internation Symposium on Information Theory, IEEE Press, New York (2006)

    Google Scholar 

  3. Budaghyan, L., Carlet, C., Leander, G.: A Class of Quadratic APN Binomials Inequivalent to Power Functions (preprint, 2007)

    Google Scholar 

  4. Carlet, C.: Vectorial Boolean Functions for Cryptography. In: Hammer, P., Crama, Y. (eds.) Boolean methods and models, Cambridge University Press, Cambridge

    Google Scholar 

  5. Canteaut, A., Charpin, P., Dobbertin, H.: Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on GF(2m) and Crosscorrelation of Maximum-Length Sequences. SIAM J. Discrete Mathematics 13(1), 105–138 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Carlet, C., Charpin, P., Zinoviev, V.: Codes, Bent Functions and Permutations Suitable for Des-Like Cryptosystems. Designs, Codes and Cryptography 15(2), 125–156 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chabaud, F., Vaudenay, S.: Links Between Differential and Linear Cryptanalysis. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356–365. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  8. Dobbertin, H.: Another Proof of Kasami’s Theorem. Designs, Codes and Cryptography 17, 177–180 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dillon, J.: Polynomials over Finite Fields and Applications. Slides from talk given at Banff International Research Station (2006)

    Google Scholar 

  10. Edel, Y., Kyureghyan, G., Pott, A.: A New APN Function Which is not Equivalent to a Power Mapping. IEEE Trans. Inform. Theory 52(2), 744–747 (2006)

    Article  MathSciNet  Google Scholar 

  11. Nyberg, K.: Differentially Uniform Mappings for Cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55–64. Springer, Heidelberg (1994)

    Google Scholar 

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

Bracken, C., Byrne, E., Markin, N., McGuire, G. (2007). Determining the Nonlinearity of a New Family of APN Functions. 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_11

Download citation

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

  • 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