Analysis of AES, SKINNY, and Others with Constraint Programming
Search for different types of distinguishers are common tasks in symmetrickey cryptanalysis. In this work, we employ the constraint programming (CP) technique to tackle such problems. First, we show that a simple application of the CP approach proposed by Gerault et al. leads to the solution of the...
Main Authors: | Siwei Sun, David Gerault, Pascal Lafourcade, Qianqian Yang, Yosuke Todo, Kexin Qiao, Lei Hu |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2017-03-01
|
Series: | IACR Transactions on Symmetric Cryptology |
Subjects: | |
Online Access: | https://tosc.iacr.org/index.php/ToSC/article/view/595 |
Similar Items
-
ShiftRows Alternatives for AES-like Ciphers and Optimal Cell Permutations for Midori and Skinny
by: Gianira N. Alfarano, et al.
Published: (2018-06-01) -
Cryptanalysis of Reduced round SKINNY Block Cipher
by: Sadegh Sadeghi, et al.
Published: (2018-09-01) -
Improved Security Evaluation of SPN Block Ciphers and its Applications in the Single-key Attack on SKINNY
by: Wenying Zhang, et al.
Published: (2020-01-01) -
MILP Modeling for (Large) S-boxes to Optimize Probability of Differential Characteristics
by: Ahmed Abdelkhalek, et al.
Published: (2017-12-01) -
Quantum Security Analysis of AES
by: Xavier Bonnetain, et al.
Published: (2019-06-01)