Simon's algorithm and symmetric crypto: generalizations and automatized applications

DOI10.1007/978-3-031-15982-4_26zbMath1517.94076OpenAlexW4312361177MaRDI QIDQ6163974

Federico Canale, Gregor Leander, Lukas Stennes

Publication date: 30 June 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15982-4_26

zbMATH Keywords

Fourier transformWalsh-Hadamard transformBernstein-Vazirani algorithmSimon's algorithmautomatic searchsymmetric cryptanalysiscircuits normal form

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• (Quantum) cryptanalysis of misty schemes
• Grover meets Simon -- quantumly attacking the FX-construction
• Attacks on beyond-birthday-bound MACs in the quantum setting
• How to build pseudorandom functions from public random permutations
• Quantum attacks without superposition queries: the offline Simon's algorithm
• Quantum chosen-ciphertext attacks against Feistel ciphers
• Using Bernstein-Vazirani algorithm to attack block ciphers
• Automorphisms of the general linear group over a principal ideal domain
• Applications of Simon's algorithm in quantum attacks on Feistel variants
• Breaking Symmetric Cryptosystems Using Quantum Period Finding
• Quantum Complexity Theory
• New structure of block ciphers with provable security against differential and linear cryptanalysis
• Boolean Functions for Cryptography and Coding Theory
• A Hadamard matrix of order 428
• On the automorphisms of the classical groups. With a supplement by Loo-Keng Hua
• Quantum linearization attacks

This page was built for publication: Simon's algorithm and symmetric crypto: generalizations and automatized applications