Using Bernstein-Vazirani algorithm to attack block ciphers
From MaRDI portal
Publication:2414939
DOI10.1007/s10623-018-0510-5zbMath1445.94029arXiv1711.00853OpenAlexW2963351393WikidataQ123361145 ScholiaQ123361145MaRDI QIDQ2414939
Publication date: 17 May 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.00853
Related Items (16)
Quantum differential and linear cryptanalysis ⋮ Quantum meet-in-the-middle attack on Feistel construction ⋮ Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ Quantum circuit implementation and resource analysis of LBlock and LiCi ⋮ Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation ⋮ A quantum related-key attack based on the Bernstein-Vazirani algorithm ⋮ Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions ⋮ Quantum impossible differential attacks: applications to AES and SKINNY ⋮ Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm ⋮ Quantum security of grain-128/grain-128a stream cipher against HHL algorithm ⋮ Models in quantum computing: a systematic review ⋮ Simon's algorithm and symmetric crypto: generalizations and automatized applications ⋮ Quantum attacks on beyond-birthday-bound MACs ⋮ Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms ⋮ A new post-quantum voting protocol based on physical laws ⋮ Improved BV-based quantum attack on block ciphers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- A construction of a cipher from a single pseudorandom permutation.
- Characterization of linear structures
- Quantum differential cryptanalysis
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Semantic Security and Indistinguishability in the Quantum World
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
- Superposition Attacks on Cryptographic Protocols
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- On the Power of Quantum Computation
- Quantum Complexity Theory
- A quantum algorithm to approximate the linear structures of Boolean functions
- Quantum algorithms for testing and learning Boolean functions
This page was built for publication: Using Bernstein-Vazirani algorithm to attack block ciphers