Optimizing hill climbing algorithm for S-boxes generation
Nonlinear substitutions or S-boxes are important cryptographic primitives of modern
symmetric ciphers. They are designed to complicate the plaintext-ciphertext dependency …
symmetric ciphers. They are designed to complicate the plaintext-ciphertext dependency …
Recovering or testing extended-affine equivalence
Extended Affine (EA) equivalence is the equivalence relation between two vectorial Boolean
functions and such that there exist two affine permutations,, and an affine function satisfying …
functions and such that there exist two affine permutations,, and an affine function satisfying …
Deciding EA-equivalence via invariants
N Kaleyski - Cryptography and communications, 2022 - Springer
We define a family of efficiently computable invariants for (n, m)-functions under EA-
equivalence, and observe that, unlike the known invariants such as the differential spectrum …
equivalence, and observe that, unlike the known invariants such as the differential spectrum …
Deciding and reconstructing linear equivalence of uniformly distributed functions
I Ivkovic, N Kaleyski - Cryptology ePrint Archive, 2022 - eprint.iacr.org
We describe an efficient algorithm for testing and recovering linear equivalence between a
pair of $ k $-to-$1 $ discrete functions with a specific structure. In particular, for $ k= 3$ this …
pair of $ k $-to-$1 $ discrete functions with a specific structure. In particular, for $ k= 3$ this …
Invariants for EA-and CCZ-equivalence of APN and AB functions
NS Kaleyski - Cryptography and Communications, 2021 - Springer
Abstract An (n, m)-function is a mapping from F 2 n F_2^n to F 2 m F_2^m. Such functions
have numerous applications across mathematics and computer science, and in particular …
have numerous applications across mathematics and computer science, and in particular …
Towards a deeper understanding of APN functions and related longstanding problems
NS Kaleyski - 2021 - bora.uib.no
This dissertation is dedicated to the properties, construction and analysis of APN and AB
functions. Being cryptographically optimal, these functions lack any general structure or …
functions. Being cryptographically optimal, these functions lack any general structure or …
An efficient affine equivalence algorithm for multiple S-boxes and a structured affine layer
An affine equivalence problem is to find affine mappings A and B such that F= B ∘ S ∘ A for
given two permutations F and S, which was first studied by Biryukov et al. Their algorithm for …
given two permutations F and S, which was first studied by Biryukov et al. Their algorithm for …