Algorithmic toolkit for linearization of S-boxes

Cites work

\textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function
\texttt{Midori}: a block cipher for low energy
Algebraic attacks on round-reduced \textsc{Rain} and full \textsf{AIM-III}
Banquet: short and fast signatures from AES
Bounds on the Nonlinearity of Differentially Uniform Functions by Means of Their Image Set Size, and on Their Distance to Affine Functions
Codes, bent functions and permutations suitable for DES-like cryptosystems
Diving deep into the preimage security of AES-like hashing
scientific article; zbMATH DE number 503238 (Why is no real title available?)
scientific article; zbMATH DE number 503329 (Why is no real title available?)
scientific article; zbMATH DE number 503330 (Why is no real title available?)
scientific article; zbMATH DE number 708833 (Why is no real title available?)
scientific article; zbMATH DE number 1394292 (Why is no real title available?)
scientific article; zbMATH DE number 1394295 (Why is no real title available?)
New block encryption algorithm MISTY
New collision attacks on round-reduced Keccak
New Instances of Quadratic APN Functions
Nonlinearity of APN functions: comparative analysis and estimates
On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
On the classification of APN functions up to dimension five
On the minimum Hamming distance between vectorial Boolean and affine functions
On the nonlinearity of S-boxes and linear codes
Practical collision attacks against round-reduced SHA-3
Sidon sets, thin sets, and the nonlinearity of vectorial Boolean functions
The LED block cipher
The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
Two generalizations of almost perfect nonlinearity

This page was built for publication: Algorithmic toolkit for linearization of S-boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304168)