Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized Applications2022
Konferenz / Medium
Research Hub A: Kryptographie der Zukunft
RC 2: Quantum-Resistant Cryptography
In this paper we deepen our understanding of how to apply Simon’s algorithm to break symmetric cryptographic primitives.
On the one hand, we automate the search for new attacks. Using this approach we automatically find the first efficient key-recovery attacks against constructions like 5-round MISTY L-FK or 5-round Feistel-FK (with internal permutation) using Simon’s algorithm.
On the other hand, we study generalizations of Simon’s algorithm using non-standard Hadamard matrices, with the aim to expand the quantum symmetric cryptanalysis toolkit with properties other than the periods. Our main conclusion here is that none of these generalizations can accomplish that, and we conclude that exploiting non-standard Hadamard matrices with quantum computers to break symmetric primitives will require fundamentally new attacks.