Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Quantum Chosen-Ciphertext Attacks Based on Simon’s Algorithm Against Unified Structures

Xiaoyu Wang, Zejun Xiang, Shasha Zhang, Siwei Chen, Xiangyong Zeng

Published Jan 1, 2025• 5 citations
Publisher
DOI
10.1007/978-3-031-88661-4_5

Related papers

Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment

Oleg Izmerly, Tal Mor

Theoretical Computer Science•Sep 29, 2006•9 citations

Quantum Chosen-Ciphertext Attacks Against Feistel Ciphers

Gembu Ito, Akinori Hosoyamada, Ryutaroh Matsumoto +2 more

Lecture notes in computer science•Jan 1, 2019•71 citations

Quantum Attacks Without Superposition Queries: The Offline Simon’s Algorithm

Xavier Bonnetain, Akinori Hosoyamada, María Naya‐Plasencia +2 more

arXiv:2002.12439•Lecture notes in computer science•Jan 1, 2019•121 citations

Quantum Attacks: A View of Data Complexity on Offline Simon’s Algorithm

Bo Yu, Tairong Shi, Xiaoyang Dong +3 more

Lecture notes in computer science•Jan 1, 2024•3 citations

Applications of Simon’s algorithm in quantum attacks on Feistel variants

Cui Jingyi, Jiansheng Guo, Shuzhen Ding

Quantum Information Processing•Mar 1, 2021•25 citations

The construction of quantum distinguishers for GFS based on Simon’s algorithm

Chengdong Ma, Jie Guan, Tairong Shi +1 more

With the application of quantum algorithms in cryptanalysis keeping increasing. Currently, there are many works based on Simon’s algorithm for generalized Feistel scheme (GFS), mostly using manual derivation to construct periodic functions. We present the functional form of the output component’s algebraic expression. Then we propose the transformation rules of functional form of algebraic expression through round function. Afterwards, we present an algorithm to find GFS’s longest round distinguishers based on Simon’s algorithm. Based on this, we get quantum distinguishers of Type-1 GFS, Type-2 GFS and Type-3 GFS under quantum chosen plaintext attack (qCPA) setting and quantum chosen ciphertext attack (qCCA) setting. For Type-1 GFS, the longest round quantum distinguisher based on Simon’s algorithm is unique under qCPA/qCCA setting, which is [Formula: see text]-round/[Formula: see text]-round. For [Formula: see text]-branch Type-2 GFS, [Formula: see text] kinds of [Formula: see text]-round distinguishers have been found under qCPA/qCCA setting. For Type-3 GFS, the longest round distinguisher based on Simon’s algorithm is unique under qCPA/qCCA setting, which is [Formula: see text]-round/3-round.

International Journal of Quantum Information•Sep 12, 2025•0 citations
With the application of quantum algorithms in cryptanalysis keeping increasing. Currently, there are many works based on Simon’s algorithm for generalized Feistel scheme (GFS), mostly using manual derivation to construct periodic functions. We present the functional form of the output component’s algebraic expression. Then we propose the transformation rules of functional form of algebraic expression through round function. Afterwards, we present an algorithm to find GFS’s longest round distinguishers based on Simon’s algorithm. Based on this, we get quantum distinguishers of Type-1 GFS, Type-2 GFS and Type-3 GFS under quantum chosen plaintext attack (qCPA) setting and quantum chosen ciphertext attack (qCCA) setting. For Type-1 GFS, the longest round quantum distinguisher based on Simon’s algorithm is unique under qCPA/qCCA setting, which is [Formula: see text]-round/[Formula: see text]-round. For [Formula: see text]-branch Type-2 GFS, [Formula: see text] kinds of [Formula: see text]-round distinguishers have been found under qCPA/qCCA setting. For Type-3 GFS, the longest round distinguisher based on Simon’s algorithm is unique under qCPA/qCCA setting, which is [Formula: see text]-round/3-round.