A method of construction of differentially 4-uniform permutations over Vm for even m
-
Stepan A. Davydov
and
Igor A. Kruglov
Abstract
A generalization of the method of C. Carlet for constructing differentially 4-uniform permutations of binary vector spaces in even dimension 2k is suggested. It consists in restricting APN-functions in 2k+1 variables to a linear manifold of dimension 2k. The general construction of the method is proposed and a criterion for its applicability is established. Power permutations to which this construction is applicable are completely described and a class of suitable not one-to-one functions is presented.
Note: Originally published in Diskretnaya Matematika (2019) 31,№2, 69–76 (in Russian).
References
[1] Carlet C., “Vectorial Boolean functions for cryptography”, Boolean models and methods in mathematics, computer science, and engineering, Cambridge University Press, 2010, 398-469.10.1017/CBO9780511780448.012Search in Google Scholar
[2] Kazimirov A. V., Kazimirova V. N., Oleynikov R. V., “A method for generation of high-nonlinear S-boxes based on gradient descent”, Matematicheskie Voprosy Kriptografii, 5:2 (2014), 71-78 (in Russian).Search in Google Scholar
[3] Y. Edel, A. Pott, “A new almost perfect nonlinear functions which is not quadratic”, Adv. Math. Communic., 3:1 (2009), 59-81.10.3934/amc.2009.3.59Search in Google Scholar
[4] L. Qu, Y. Tan, C. Tan, C. Li, “Differentially 4-uniform permutations over F2k via the switching method”, IEEE Trans. Inf. Theory, 59:7 (2013), 4675-4686.10.1109/TIT.2013.2252420Search in Google Scholar
[5] C. Carlet, “On known and new differentially uniform functions”, Lect. Notes Comput. Sci., 6812 (2011), 1-15.10.1007/978-3-642-22497-3_1Search in Google Scholar
[6] L. Qu, Y. Tan, C. Li, G. Gong, “More constructions of differentially 4-uniform permutations on F2k ”, Design, Codes and Cryptography, 78:2 (2016), 391-408.Search in Google Scholar
[7] Y. Yu, M. Wang, Y. Li, “Constructing differentially 4-uniform permutations over F2k from known ones”, Chinese Journal of Electronics, 22:3 (2013), 495-499.Search in Google Scholar
[8] D. Tang, C. Carlet, X. Tang, “Differentially 4-uniform bijections by permuting the inverse function”, Design, Codes and Cryptography, 77:1 (2015), 117-141.10.1007/s10623-014-9992-ySearch in Google Scholar
[9] L. Li, M. Wang, “Constructing differentially 4-uniform permutations over F2m from quadratic APN permutations over F2m+1 ”, Design, Codes and Cryptography, 72:2 (2014), 249-264.10.1007/s10623-012-9760-9Search in Google Scholar
[10] G. Kyureghyan, “Crooked maps in F2n”, Finite Fields and Their Appl., 13:3 (2007), 713-726.10.1016/j.ffa.2006.03.003Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- A method of construction of differentially 4-uniform permutations over Vm for even m
- Ergodicity of the probabilistic converter, a serial connection of two automata
- On distance-regular graphs with c2 = 2
- Minimal contact circuits for characteristic functions of spheres
- Approximation of restrictions of q-valued logic functions to linear manifolds by affine analogues
- Multiaffine polynomials over a finite field
- Large deviations of branching process in a random environment. II
Articles in the same Issue
- Frontmatter
- A method of construction of differentially 4-uniform permutations over Vm for even m
- Ergodicity of the probabilistic converter, a serial connection of two automata
- On distance-regular graphs with c2 = 2
- Minimal contact circuits for characteristic functions of spheres
- Approximation of restrictions of q-valued logic functions to linear manifolds by affine analogues
- Multiaffine polynomials over a finite field
- Large deviations of branching process in a random environment. II
