Breaking Symmetric Cryptosystems Using Quantum Period Finding

DOI10.1007/978-3-662-53008-5_8zbMath1391.94766arXiv1602.05973OpenAlexW2284942299MaRDI QIDQ2829216

Anthony Leverrier, Gaëtan Leurent, María Naya-Plasencia, M. A. Kaplan

Publication date: 27 October 2016

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

Full work available at URL: https://arxiv.org/abs/1602.05973

zbMATH Keywords

block ciphers symmetric cryptography post-quantum cryptography slide attack quantum attacks modes of operation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (90)

On tight quantum security of HMAC and NMAC in the quantum random oracle model ⋮ Noisy Simon period finding ⋮ On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability ⋮ Quantum algorithms for the $k$-XOR problem ⋮ Hidden shift quantum cryptanalysis and implications ⋮ Tight bounds for Simon's algorithm ⋮ Towards quantum large-scale password guessing on real-world distributions ⋮ Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings ⋮ Evaluation of quantum cryptanalysis on SPECK ⋮ Pholkos -- efficient large-state tweakable block ciphers from the AES round function ⋮ Quantum reversible circuit of AES-128 ⋮ Quantum differential and linear cryptanalysis ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Post-quantum security of the Even-Mansour cipher ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Efficient quantum algorithms related to autocorrelation spectrum ⋮ Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 ⋮ Quantum attacks on some Feistel block ciphers ⋮ Efficient slide attacks ⋮ Using Bernstein-Vazirani algorithm to attack block ciphers ⋮ Quantum security analysis of Rocca ⋮ New results on quantum boomerang attacks ⋮ Quantum meet-in-the-middle attack on Feistel construction ⋮ Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm ⋮ Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ Block encryption of quantum messages ⋮ QCB is blindly unforgeable ⋮ Improved attacks against reduced-round Whirlwind ⋮ Quantum circuit implementation and resource analysis of LBlock and LiCi ⋮ Finding many collisions via reusable quantum walks. Application to lattice sieving ⋮ Complete analysis of Simon's quantum algorithm with additional collisions ⋮ Triangulating rebound attack on AES-like hashing ⋮ A quantum related-key attack based on the Bernstein-Vazirani algorithm ⋮ Grover on $SIMON$ ⋮ Post-quantum security on the Lai-Massey scheme ⋮ Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks ⋮ Quantum impossible differential attacks: applications to AES and SKINNY ⋮ Quantum algorithms for the Goldreich-Levin learning problem ⋮ A quantum distinguisher for 7/8-round SMS4 block cipher ⋮ Optimizing the depth of quantum implementations of linear layers ⋮ Synthesizing quantum circuits of AES with lower $T$-depth and less qubits ⋮ Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms ⋮ Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm ⋮ Quantum attacks against BBB secure PRFs or MACs built from public random permutations ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Quantum linearization attacks ⋮ QCB: efficient quantum-secure authenticated encryption ⋮ Quantum resource estimation for FSR based symmetric ciphers and related Grover's attacks ⋮ Applications of Simon's algorithm in quantum attacks on Feistel variants ⋮ 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 beyond-birthday-bound MACs ⋮ Quantum attacks on PRFs based on public random permutations ⋮ On security notions for encryption in a quantum world ⋮ Related-key differential cryptanalysis of GMiMC used in post-quantum signatures ⋮ On the post-quantum security of classical authenticated encryption schemes ⋮ Quantum linear key-recovery attacks using the QFT ⋮ Quantum search for scaled hash function preimages ⋮ Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms ⋮ Quantum collision attacks on AES-like hashing with low quantum random access memories ⋮ Quantum key-length extension ⋮ Relationships between quantum IND-CPA notions ⋮ Quantum algorithm design: techniques and applications ⋮ Quantum attacks on sum of Even-Mansour pseudorandom functions ⋮ Quantum spin half algebra and generalized Megrelishvili protocol for confidentiality of digital images ⋮ Quantum key-recovery on full AEZ ⋮ Quantum key search with side channel advice ⋮ Breaking LWC candidates: sESTATE and Elephant in quantum setting ⋮ Breaking tweakable enciphering schemes using Simon's algorithm ⋮ Dispelling myths on superposition attacks: formal security model and attack analyses ⋮ Query complexity of generalized Simon's problem ⋮ Quantum-access-secure message authentication via blind-unforgeability ⋮ On Quantum Chosen-Ciphertext Attacks and Learning with Errors ⋮ Breaking Symmetric Cryptosystems Using Quantum Period Finding ⋮ Semantic Security and Indistinguishability in the Quantum World ⋮ Quantum algorithms for learning Walsh spectra of multi-output Boolean functions ⋮ Quantum cryptographic property testing of multi-output Boolean functions ⋮ Quantum generic attacks on key-alternating Feistel ciphers for shorter keys ⋮ A new post-quantum voting protocol based on physical laws ⋮ Quantum zero correlation linear cryptanalysis ⋮ A cluster-based networking approach for large-scale and wide-area quantum key agreement ⋮ Improved BV-based quantum attack on block ciphers ⋮ Простейшие надгруппы регулярных представлений неабелевых $2$-групп с циклической подгруппой индекса $2$ ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts ⋮ Attacks on beyond-birthday-bound MACs in the quantum setting ⋮ Quantum indistinguishability for public key encryption ⋮ Quantum Demiric-Selcuk meet-in-the-middle attacks on reduced-round AES ⋮ Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound

Uses Software

Minalpher

Cites Work

This page was built for publication: Breaking Symmetric Cryptosystems Using Quantum Period Finding