HomeIssuesCharacterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group

Characterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. DOI: 10.17223/20710410/60/1

We study bijective APN mappings defined on a finite field of even characteristic. The property of a bijective mapping to be an APN mapping is expressed in terms of the Hamming distance between subgroups of the symmetric group. A new approach to the construction of bijective APN-mappings is proposed: the problem of constructing an APN-permutation is reduced to finding a subgroup of a symmetric group that is far (in the sense of the Hamming distance) from the shift group of a finite field F2n, and solving a system of conjugation equations.
Download file
Counter downloads: 7
  • Title Characterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group
  • Headline Characterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 60
  • Date:
  • DOI 10.17223/20710410/60/1
Keywords
APN mapping, permutation, symmetric group, Hamming distance, simultaneous conjugacy
Authors
References
Городилова А. А. От криптоанализа шифра к криптографическому свойству булевой функции // Прикладная дискретная математика. 2016. №3(33). С. 16-44.
Hou X.-D. Affinity of permutations of F. // Discr. Appl. Math. Special Issue: Coding and Cryptography Archive. 2006. V. 154. P.313-325.
McQuistan M. T., Wolfe A. J., Browning K. A., and Dillon J. F. An apn permutation in dimension six // Amer. Math. Soc. 2010. No. 518. P.33-42.
Глухов М.М., Елизаров В. П., Нечаев А. А. Алгебра: Учебник. 2-е изд., испр. и доп. СПб.: Лань, 2015. 608с.
Fontet M. Calcul de Centralisateur d'un Grupe de Permutatations // Bull. Soc. Math. France Mem. 1977. No. 49-50. P. 53-63.
Sridhar M. A. A fast algorithm for testing isomorphism of permutation networks // IEEE Trans.Computers. 1989. No. 38 (6). P.903-909.
Brodnik A., Malnic A, and Pozar R. The Simultaneous Conjugacy Problem in the Symmetric Group. https://arxiv.org/abs/1907.07889. 2020.
Tsukiyama S., Ide M., Ariyoshi H., and Shirakawa I. A new algorithm for generating all the maximal independent sets // SIAM J.Comput. 1977. No.6. P.505-517.
Zhao Y. The number of independent sets in a regular graph // Combinatorics, Probability and Computing. 2010. V. 19. P.315-320.
Characterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. DOI: 10.17223/20710410/60/1
Characterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. DOI: 10.17223/20710410/60/1
Download full-text version
Counter downloads: 128