Advertisement

Designs, Codes and Cryptography

, Volume 87, Issue 2–3, pp 203–224 | Cite as

On APN exponents, characterizations of differentially uniform functions by the Walsh transform, and related cyclic-difference-set-like structures

  • Claude CarletEmail author
Article
  • 93 Downloads
Part of the following topical collections:
  1. Special Issue: Coding and Cryptography

Abstract

In this paper, we summarize the results obtained recently in three papers on differentially uniform functions in characteristic 2, and presented at the workshop WCC 2017 in Saint-Petersburg, and we give new results on these functions. Firstly, we recall the recent connection between almost perfect nonlinear (APN) power functions and the two notions in additive combinatorics of Sidon sets and sum-free sets; we also recall a characterization of APN exponents which leads to a property of Dickson polynomials in characteristic 2 previously unobserved, which is generalizable to all finite fields. We also give a new characterization of APN exponents in odd dimension by Singer sets. Secondly, after recalling the recent multiple generalization to differentially \(\delta \)-uniform functions of the Chabaud–Vaudenay characterization of APN functions by their Walsh transforms, we generalize the method to all criteria on vectorial functions dealing with the numbers of solutions of equations of the form \(\sum _{i\in I}F(x+u_{i,a})+L_a(x)+u_a=0\), with \(L_a\) linear; we give the examples of injective functions and of o-polynomials; we also deduce a generalization to differentially \(\delta \)-uniform functions of the Nyberg characterization of APN functions by means of the Walsh transforms of their derivatives. Thirdly, we recall the two notions of componentwise APNness (CAPNness) and componentwise Walsh uniformity (CWU). We recall why CAPN functions can exist only if n is odd and why crooked functions (in particular, quadratic APN functions) are CWU. We also recall that the inverse of one of the Gold permutations is CWU and not the others. Another potential class of CWU functions is that of Kasami functions. We consider the difference sets with Singer parameters equal to the complement of \(\varDelta _F=\{F(x)+F(x+1)+1; x\in \mathbb {F}_{2^n}\}\) where F is a Kasami function. These sets have another potential property, called the cyclic-additive difference set property, which is related to the CWU property in the case of power permutations (n odd). We study cyclic-additive difference sets among Singer sets. We recall the main properties of Kasami functions and of the related set \(\varDelta _F\) shown by Dillon and Dobbertin and we observe and prove new expressions for \(\varDelta _F\).

Keywords

Boolean function Vectorial function Walsh–Hadamard transform APN function Kasami function Cyclic difference set 

Notes

Acknowledgements

The author is grateful to Stjepan Picek for his kind help with computer investigations.

References

  1. 1.
    Berger T., Canteaut A., Charpin P., Laigle-Chapuy Y.: On almost perfect nonlinear functions. IEEE Trans. Inf. Theory 52(9), 4160–4170 (2006).MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Budaghyan L.: Construction and Analysis of Cryptographic Functions. Springer, New York (2015).zbMATHGoogle Scholar
  3. 3.
    Carlet C.: Boolean functions for cryptography and error correcting codes. Chapter of the monography. In: Crama Y., Hammer P. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257–397. Cambridge University Press, Cambridge (2010).CrossRefGoogle Scholar
  4. 4.
    Carlet C.: Vectorial boolean functions for cryptography. Chapter of the monography. In: Crama Y., Hammer P. (eds.) Boolean Models and Methods in Mathematics, Computer Science and Engineering, pp. 398–469. Cambridge University Press, Cambridge (2010).CrossRefGoogle Scholar
  5. 5.
    Carlet C.: Boolean and vectorial plateaued functions, and APN functions. IEEE Trans. Inf. Theory 61(11), 6272–6289 (2015).MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Carlet C.: Characterizations of the differential uniformity of vectorial functions by the Walsh transform. IEEE Trans. Inf. Theory (see a preliminary version in IACR ePrint Archive 2017/516).Google Scholar
  7. 7.
    Carlet C.: Componentwise APNness, Walsh uniformity of APN functions and cyclic-additive difference sets. IACR ePrint Archive 2017/528.Google Scholar
  8. 8.
    Carlet C., Mesnager S.: Characterizations of o-polynomials by the Walsh transform (2017). arXiv:1709.03765.
  9. 9.
    Carlet C., Picek S.: On the exponents of APN power functions and Sidon sets, sum-free sets and Dickson polynomials. IACR ePrint Archive 2017/1179.Google Scholar
  10. 10.
    Carlet C., Charpin P., Zinoviev V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125–156 (1998).MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Carlet C., Danger J.-L., Desjardins M., Guilley S., Schaub A.: DIBO functions and white box cryptography (2017).Google Scholar
  12. 12.
    Chabaud F., Vaudenay S.: Links between differential and linear cryptanalysis. In: Proceedings of EUROCRYPT’94, Lecture Notes in Computer Science, vol. 950, pp. 356–365 (1995).Google Scholar
  13. 13.
    Cohen S.D., Matthews R.W.: A class of exceptional polynomials. Trans. Am. Math. Soc. 345, 897–909 (1994).MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Dillon J.F., Dobbertin H.: New cyclic difference sets with Singer parameters. Finite Fields Appl. 10, 342–389 (2004).MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Hou X., Mullen G.L., Sellers J.A., Yucas J.: Reversed Dickson polynomials over finite fields. Finite Fields Appl. 15, 748–773 (2009).MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Kyureghyan G.: Crooked maps in \({\mathbb{F}}_2^n\). Finite Fields Appl. 13(3), 713–726 (2007).MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Nyberg K.: Perfect non-linear S-boxes. In: Proceedings of EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, pp. 378–386 (1992).Google Scholar
  18. 18.
    Nyberg K.: Differentially uniform mappings for cryptography. In: Proceedings of EUROCRYPT’ 93, Lecture Notes in Computer Science, vol. 765, pp. 55–64 (1994).Google Scholar
  19. 19.
    Nyberg K.: S-boxes and round functions with controllable linearity and differential uniformity. In: Proceedings of Fast Software Encryption 1994, Lecture Notes in Computer Science, vol. 1008, pp. 111–130 (1995).Google Scholar
  20. 20.
    Piret G., Roche T., Carlet C.: PICARO—a block cipher allowing efficient higher-order side-channel resistance. In: Proceedings of ACNS 2012, Lecture Notes in Computer Science, vol. 7341, pp. 311–328 (2012).Google Scholar
  21. 21.
    Shannon C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949).MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.LAGA, Department of MathematicsUniversity of Paris 8 (and Paris 13 and CNRS)Saint-DenisFrance
  2. 2.University of BergenBergenNorway

Personalised recommendations