Quantum attacks without superposition queries: the offline Simon's algorithm
From MaRDI portal
Publication:2181896
DOI10.1007/978-3-030-34578-5_20zbMath1456.94052arXiv2002.12439OpenAlexW2991519650MaRDI QIDQ2181896
Xavier Bonnetain, Yu Sasaki, André Schrottenloher, María Naya-Plasencia, Akinori Hosoyamada
Publication date: 20 May 2020
Full work available at URL: https://arxiv.org/abs/2002.12439
symmetric cryptographyquantum cryptanalysisSimon's algorithmclassical queriesEven-Mansour constructionFX construction
Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (33)
Noisy Simon period finding ⋮ On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability ⋮ Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security ⋮ Tight bounds for Simon's algorithm ⋮ Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings ⋮ Evaluation of quantum cryptanalysis on SPECK ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Post-quantum security of the Even-Mansour cipher ⋮ Quantum security analysis of Rocca ⋮ Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm ⋮ Triangulating rebound attack on AES-like hashing ⋮ Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting ⋮ Grover on \(SIMON\) ⋮ Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks ⋮ Quantum impossible differential attacks: applications to AES and SKINNY ⋮ A quantum distinguisher for 7/8-round SMS4 block cipher ⋮ Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Quantum linearization attacks ⋮ Simon's algorithm and symmetric crypto: generalizations and automatized applications ⋮ Quantum attacks on Lai-Massey structure ⋮ Sponge-based authenticated encryption: security against quantum attackers ⋮ On quantum ciphertext indistinguishability, recoverability, and OAEP ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Quantum linear key-recovery attacks using the QFT ⋮ Quantum search for scaled hash function preimages ⋮ Quantum collision attacks on AES-like hashing with low quantum random access memories ⋮ Quantum key-length extension ⋮ Breaking LWC candidates: sESTATE and Elephant in quantum setting ⋮ Breaking tweakable enciphering schemes using Simon's algorithm ⋮ Some efficient quantum circuit implementations of Camellia ⋮ Простейшие надгруппы регулярных представлений неабелевых $2$-групп с циклической подгруппой индекса $2$ ⋮ Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
This page was built for publication: Quantum attacks without superposition queries: the offline Simon's algorithm
