The introduction of the automatic search boosts the cryptanalysis of symmetric-key primitives
to some degree. However, the performance of the automatic search is not always …

Smaller, smarter and faster edge devices in the Internet of things era demand secure data
analysis and transmission under resource constraints of hardware architecture. Lightweight …

Impossible differential and zero-correlation linear cryptanalysis are two of the most powerful
cryptanalysis methods in the field of symmetric key cryptography. There are several …

We introduce subspace trail cryptanalysis, a generalization of invariant subspace
cryptanalysis. With this more generic treatment of subspaces we do no longer rely on …

Abstract Impossible differential (ID), zero-correlation (ZC), and integral attacks are a family of
important attacks on block ciphers. For example, the impossible differential attack was the …

AES is probably the most widely studied and used block cipher. Also versions with a
reduced number of rounds are used as a building block in many cryptographic schemes, eg …

In this study, the authors settle the feasibility of mixed integer linear programming (MILP)‐
aided bit‐based division property for ciphers with non‐bit‐permutation linear layers. First …

Search for different types of distinguishers are common tasks in symmetric-key cryptanalysis.
In this work, we employ the constraint programming (CP) technique to tackle such problems …

The two main classes of statistical cryptanalysis are the linear and differential attacks. They
have many variants and enhancements such as the multidimensional linear attacks and the …

Impossible differential and zero correlation linear cryptanalysis are two of the most important
cryptanalytic vectors. To characterize the impossible differentials and zero correlation linear …