H Taniguchi - Cryptography and Communications, 2023 - Springer
C. Carlet [Boolean functions for Cryptography and Coding theory, p. 381] mentions an observation of Dillon, that is, APN functions f on F 2 n with n greater than 2 must satisfy the …
K Li, Y Zhou, C Li, L Qu - IEEE Transactions on Information …, 2022 - ieeexplore.ieee.org
In this paper, we present two new families of APN functions. The first family is in bivariate form over. It is obtained by adding certain terms of the form to a family of APN functions …
L Zheng, H Kan, Y Li, J Peng… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Let. In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66 (11): 7081-7087, 2020] considered a family of quadrinomials over of the form. They showed that two infinite classes …
Z Lu, S Mesnager, T Cui, Y Fan, M Wang - Designs, Codes and …, 2022 - Springer
The substitution box (S-box) is an important nonlinear component in most symmetric cryptosystems and thus should have good properties. Its difference distribution table (DDT) …
F Göloğlu - IEEE Transactions on Information Theory, 2022 - ieeexplore.ieee.org
In this paper, we classify-biprojective almost perfect nonlinear (APN) functions over under the natural left and right action of where is a finite field of characteristic 2. This shows in …
In this work, we present two families of quadratic APN functions. The first one (F1) is constructed via biprojective polynomials. This family extends one of the two APN families …
K Li, N Kaleyski - IEEE Transactions on Information Theory, 2023 - ieeexplore.ieee.org
We present two infinite families of APN functions in trivariate form over finite fields of the form. We show that the functions from both families are permutations when is odd, and are 3 …
K Kalgin, V Idrisova - Cryptography and Communications, 2023 - Springer
Almost perfect nonlinear functions possess optimal resistance to differential cryptanalysis and are widely studied. Most known APN functions are defined using their representation as …
M Abbondati, M Calderini, I Villa - Cryptography and Communications, 2024 - Springer
Dillon observed that an APN function F over F 2 n with n greater than 2 must satisfy the condition {F (x)+ F (y)+ F (z)+ F (x+ y+ z): x, y, z∈ F 2 n}= F 2 n. Recently, Taniguchi …