Quantum attacks: a view of data complexity on offline Simon's algorithm

DOI10.1007/978-981-97-0945-8_19MaRDI QIDQ6575058zbMATH OpenFDO

Authors Bo Yu, Tairong Shi, Xiaoyang Dong, Xuan Shen, Yiyuan Luo, Bing Sun

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0945-8_19

zbMATH Keywords

block cipherclassical queryFeistel structureoffline Simon's algorithmquantum key recovery attack

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• Breaking symmetric cryptosystems using quantum period finding
• Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
• Grover meets Simon -- quantumly attacking the FX-construction
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• New attacks on Feistel structures with improved memory complexities
• Quantum attacks without superposition queries: the offline Simon's algorithm
• Quantum chosen-ciphertext attacks against Feistel ciphers
• Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
• Random oracles in a quantum world

This page was built for publication: Quantum attacks: a view of data complexity on offline Simon's algorithm

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