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

The Offline Quantum Attack Against Modular Addition Variant of Even-Mansour Cipher

Fangzhou Liu, Xueqi Zhu, Ruozhou Xu, Danping Shi, Peng Wang

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-981-97-5025-2_1

Related papers

On Quantum Related-Key Attacks on Iterated Even-Mansour Ciphers

Akinori Hosoyamada, Kazumaro Aoki

Lecture notes in computer science•Jan 1, 2017•24 citations

Post-Quantum Security of the Even-Mansour Cipher

Gorjan Alagic, Bai Chen, Jonathan I. Katz +1 more

arXiv:2112.07530•Lecture notes in computer science•Jan 1, 2022•31 citations

Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher

Akinori Kawachi, Yuki Naito

arXiv:2308.10418•Lecture notes in computer science•Dec 8, 2023•1 citation

Quantum Attacks on the Sum of Even-Mansour Pseudorandom Function

Kazuo Shinagawa, Tetsu Iwata

IEICE Technical Report; IEICE Tech. Rep.•Jul 13, 2020•0 citations

Offline dedicated quantum attacks on block cipher constructions based on two parallel permutation-based pseudorandom functions

Xiao-Fan Zhen, Zhenqiang Li, Jia-Cheng Fan +2 more

arXiv:2510.14475•Science China Information Sciences•Jul 16, 2026•1 citation

Poster: An Improved Quantum Attack on the Two-round Even-Mansour Cipher with Independent Permutations and Keys

Rentaro Shiba, Tetsu Iwata

In this study, we propose a quantum attack on the two-round iterated Even-Mansour cipher, which consists of two independent permutations and three independent subkeys. Our attack is in the Q1 model, where an adversary makes classical online queries and quantum offline queries. The complexity of our attack is O(2n/2), where n is the block size, while the best known attack for this variant is O(23n/5). Thus, our method significantly improves the computational complexity compared to existing quantum attacks.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 19, 2025•0 citations
In this study, we propose a quantum attack on the two-round iterated Even-Mansour cipher, which consists of two independent permutations and three independent subkeys. Our attack is in the Q1 model, where an adversary makes classical online queries and quantum offline queries. The complexity of our attack is O(2n/2), where n is the block size, while the best known attack for this variant is O(23n/5). Thus, our method significantly improves the computational complexity compared to existing quantum attacks.