On generalizing the power function exponent constructions with genetic programming (CROSBI ID 723760)
Prilog sa skupa u časopisu | prethodno priopćenje | međunarodna recenzija
Podaci o odgovornosti
Carlet, Claude ; Jakobovic, Domagoj ; Picek, Stjepan
engleski
On generalizing the power function exponent constructions with genetic programming
Many works are investigating Almost Perfect Nonlinear (APN) functions and, in particular, APN power functions. Such functions are of the form F(x) = xd, and they have practical relevance as they reach in characteristic 2 the best possible differential uniformity. This work investigates whether genetic programming (GP) can "reinvent" the known expressions used to obtain exponent values d resulting in APN functions. The ultimate goal is to find classes of exponents that would be "transversal" to the known infinite classes of APN exponents, and would contain new APN exponents (for values of n necessarily larger than those for which an exhaustive search could be made so far). This would be already a breakthrough, and our hope is to find this way new infinite classes of APN exponents. Our results show this is possible but difficult, and a careful trade-off between finding new values and skipping known values is required.
Cryptographic primitives ; genetic programming
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
691-694.
2022.
nije evidentirano
objavljeno
10.1145/3520304.3529081
Podaci o matičnoj publikaciji
The Association for Computing Machinery (ACM)
Podaci o skupu
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '22)
poster
09.07.2022-13.07.2022
Boston (MA), Sjedinjene Američke Države