Miloserdov, A. V.
Published in
Journal of Applied and Industrial Mathematics
We consider binomial functions over a finite field of order 2n. Some necessary condition is found for such a binomial function to be a permutation. It is proved that there are no permutation binomial functions in the case that 2n − 1 is prime. Permutation binomial functions are constructed in the case when n is composite and found for n ≥ 8.
Rodinko, Mariia Oliynykov, Roman Gorbenko, Yurii
Published in
Tatra Mountains Mathematical Publications
The known method of high nonlinear S-boxes generation based on the gradient descent [Kazymyrov, O. V.: Methods and Techniques of Generation of Nonlinear Substitutions for Symmetric Encryption Algorithms. The thesis for the scholarly degree of candidate of technical sciences, speciality 05.13.21 - - Information security systems, Kharkiv National Uni...
Gorodilova, Anastasiya A.
Published in
Discrete Mathematics and Applications
The paper is concerned with combinatorial description of almost perfect nonlinear functions (APN-functions). A complete characterization of n-place APN-functions in terms of (n − 1)-place subfunctions is obtained. An n-place function is shown to be an APN-function if and only if each of its (n − 1)-place subfunctions is either an APN-function or ha...
Pokrasenko, D. P.
Published in
Journal of Applied and Industrial Mathematics
Under study is the component algebraic immunity of vectorial Boolean functions. We prove a theorem on the correspondence between the maximal component algebraic immunity of a function and its balancedness. Some relationship is obtained between the maximal component algebraic immunity and matrices of a special form. We construct several functions wi...
Vitkup, V. A.
Published in
Journal of Applied and Industrial Mathematics
We study the symmetric properties of APN functions as well as the structure and properties of the range of an arbitrary APN function. We prove that there is no permutation of variables that preserves the values of an APN function. Upper bounds for the number of symmetric coordinate Boolean functions in an APN function and its coordinate functions i...
Pasalic, Enes
In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...
Pasalic, Enes
In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...
Pasalic, Enes
In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...
Pasalic, Enes
In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...
Pasalic, Enes
In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...