[Resource Topic] 2022/782: Simon’s Algorithm and Symmetric Crypto: Generalizations and Automatized Applications

Welcome to the resource topic for 2022/782

Simon’s Algorithm and Symmetric Crypto: Generalizations and Automatized Applications

Authors: Federico Canale, Gregor Leander, and Lukas Stennes


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 ac- complish that, and we conclude that exploiting non-standard Hadamard matrices with quantum computers to break symmetric primitives will require fundamentally new attacks.

ePrint: https://eprint.iacr.org/2022/782

Talk: https://www.youtube.com/watch?v=gw7FY9YhV6I

Slides: https://iacr.org/submit/files/slides/2022/crypto/crypto2022/40/slides.pdf

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .