Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm

DOI10.1007/S11128-023-04089-9MaRDI QIDQ6050243zbMATH OpenFDO

Authors Bao-Min Zhou, Zheng Yuan

Publication date 18 September 2023

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-023-04089-9

zbMATH Keywords

distributed Simon's algorithmGrover's algorithmkey-recovery attackssymmetric cryptanalysis

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Quantum attacks without superposition queries: the offline Simon's algorithm
• Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms
• Parallel quantum addition for Korean block ciphers
• Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
• Breaking symmetric cryptosystems using quantum period finding

Cites work

• A construction of a cipher from a single pseudorandom permutation.
• A method for obtaining digital signatures and public-key cryptosystems
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Application of distributed semi-quantum computing model in phase estimation
• Breaking symmetric cryptosystems using quantum period finding
• Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
• Efficient distributed quantum computing
• Grover meets Simon -- quantumly attacking the FX-construction
• Hidden shift quantum cryptanalysis and implications
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• On the Power of Quantum Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum all-subkeys-recovery attacks on 6-round Feistel-2^ structure based on multi-equations quantum claw finding
• Quantum attacks against BBB secure PRFs or MACs built from public random permutations
• Quantum attacks against iterated block ciphers
• Quantum attacks without superposition queries: the offline Simon's algorithm
• Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions

Cited in

(3)

• A chosen-plaintext attack on quantum permutation pad
• Exact distributed quantum algorithm for generalized Simon's problem
• Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms

This page was built for publication: Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6050243)