Geodesic
The change in linear and differential characteristics of substitution after the multiplication by transposition
Matematičeskie voprosy kriptografii, Tome 11 (2020) no. 2, pp. 111-123 
A. V. Menyachikhin. The change in linear and differential characteristics of substitution after the multiplication by transposition. Matematičeskie voprosy kriptografii, Tome 11 (2020) no. 2, pp. 111-123. http://geodesic.mathdoc.fr/item/MVK_2020_11_2_a8/
@article{MVK_2020_11_2_a8,
     author = {A. V. Menyachikhin},
     title = {The change in linear and differential characteristics of substitution after the multiplication by transposition},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {111--123},
     year = {2020},
     volume = {11},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MVK_2020_11_2_a8/}
}
TY  - JOUR
AU  - A. V. Menyachikhin
TI  - The change in linear and differential characteristics of substitution after the multiplication by transposition
JO  - Matematičeskie voprosy kriptografii
PY  - 2020
SP  - 111
EP  - 123
VL  - 11
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MVK_2020_11_2_a8/
LA  - en
ID  - MVK_2020_11_2_a8
ER  - 
%0 Journal Article
%A A. V. Menyachikhin
%T The change in linear and differential characteristics of substitution after the multiplication by transposition
%J Matematičeskie voprosy kriptografii
%D 2020
%P 111-123
%V 11
%N 2
%U http://geodesic.mathdoc.fr/item/MVK_2020_11_2_a8/
%G en
%F MVK_2020_11_2_a8

Voir la notice de l'article provenant de la source Math-Net.Ru

It is shown that the linearity and differential uniformity of the substitution multiplied by transposition may be calculated with time complexities $O\left(2^{2n}\right)$ and $O\left(2^{n}\right)$ respectively. Some heuristic algorithms of constructing s-boxes are optimized in this paper.

[1] Isa H., Jamil N., Z'aba M., “Hybrid heuristic methods in constructing cryptographically strong S-boxes”, Int. J. Cryptology Research, 6:1 (2016), 1–15 | MR

[2] Ivanov G., Nikolov N., Nikova S., “Cryptographically strong S-boxes generated by modified immune algorithm”, Lect. Notes Comput. Sci., 9540, 2015, 31–42 | DOI

[3] Ivanov G., Nikolov N., Nikova S., “Reversed genetic algorithms for generation of bijective S-boxes with good cryptographic properties”, Cryptogr. and Communic., 8:2 (2016), 247–276 | DOI | MR | Zbl

[4] Menyachihin A.V., “Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters”, Matematicheskie Voprosy Kriptografii, 8:2 (2017), 97–116 | DOI | MR

[5] Menyachihin A.V., The method for generating s-boxes by using elements of linear and differential spectra and device implementing it, Patent RU 2633132, 29, 2017

[6] Kazymyrov O.V., Kazymyrova V.N., Oliynykov R.V., “A method for generation of high-nonlinear S-boxes based on gradient descent”, Mathematicheskie Voprosy Kriptografii, 5:2 (2014), 71–78 | DOI

[7] Millan W., Clark A., Dawson E., “Boolean functions design using hill climbing methods”, Lect. Notes Comput. Sci., 1587, 1999, 1–11 | DOI | Zbl

[8] Millan W., “How to improve the nonlinearity of bijective S-boxes”, Australian Conf. Inf. Security and Privacy, Lect. Notes Comput. Sci., 1438, 1998, 181–192 | DOI | MR | Zbl

[9] Tesar P., “A new method for generating high non-linearity S-boxes”, Radioengineering, 19:1 (2010), 23–26

[10] Yu Y., Wang M., Li Y., “Constructing differentially 4-uniform permutation from known ones”, Chinese J. Electronics, 22:2 (2013), 495–499