Abstract:
Orthomorphisms of Abelian groups with the minimum possible Cayley distance between them are studied. We describe the class of transformations mapping the given orthomorphism into the set of all orthomorphisms such that their Cayley distance from this orthomorphism takes the minimal possible value 2. Algorithms are suggested that construct all orthomorphisms separated from the given one by the minimum possible distance, and the complexity of these algorithms is estimated. Examples of Abelian groups are presented such that the set of all their orthomorphisms contains elements which are separated from all other orthomorphisms by a distance larger than the minimum possible.
Keywords:
orthomorphism, Abelian group, Latin square, orthogonal Latin squares, Cayley distance, quasigroup, s-box, nonlinear transformation, permutation.
Citation:
A. V. Menyachikhin, “Orthomorphisms of Abelian groups with minimum possible pairwise distances”, Diskr. Mat., 30:4 (2018), 55–65; Discrete Math. Appl., 30:3 (2020), 177–186
This publication is cited in the following 5 articles:
O. A. Kozlitin, “Protokoly distantsionnogo golosovaniya. II”, Matem. vopr. kriptogr., 15:3 (2024), 83–100
S. V. Spiridonov, “Ortomorfizmy grupp s minimalno vozmozhnymi poparnymi rasstoyaniyami”, PDM, 2024, no. 66, 45–59
O. A. Kozlitin, M. A. Suleimanov, “Protokoly distantsionnogo golosovaniya. I”, Matem. vopr. kriptogr., 14:4 (2023), 89–110
R. A. de la Cruz Jiménez, “Constructing 8-bit permutations, 8-bit involutions and 8-bit orthomorphisms with almost optimal cryptographic parameters”, Matem. vopr. kriptogr., 12:3 (2021), 89–124
A. V. Menyachikhin, “The limited deficit method and the problem of constructing orthomorphisms and almost orthomorphisms of Abelian groups”, Discrete Math. Appl., 31:5 (2021), 327–343