Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm
From MaRDI portal
Publication:6050243
DOI10.1007/s11128-023-04089-9MaRDI QIDQ6050243
Publication date: 18 September 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Application of distributed semi-quantum computing model in phase estimation
- A construction of a cipher from a single pseudorandom permutation.
- Hidden shift quantum cryptanalysis and implications
- Grover meets Simon -- quantumly attacking the FX-construction
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Quantum all-subkeys-recovery attacks on 6-round Feistel-\(2^\ast\) structure based on multi-equations quantum claw finding
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Квантовые атаки на итерационные блочные шифры
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Efficient distributed quantum computing
- Mathematical Foundations of Computer Science 2003
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
This page was built for publication: Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm
