Quantum attacks on two-round even-mansour

被引:8
|
作者
Cai, BinBin [1 ,2 ]
Gao, Fei [1 ]
Leander, Gregor [3 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R China
[2] Henan Key Lab Network Cryptog Technol, Zhengzhou, Peoples R China
[3] Ruhr Univ Bochum, Bochum, Germany
基金
中国国家自然科学基金;
关键词
even-mansour; grover algorithm; grover-meets-simon algorithm; offline simon algorithm; resource estimation; CRYPTANALYSIS;
D O I
10.3389/fphy.2022.1028014
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Even-Mansour is one of the most important constructions in symmetric cryptography, both from a theoretical and practical perspective. With the rapid development of quantum computing, the security of Even-Mansour construction in quantum setting needs to be considered. For one round Even-Mansour construction, it is well settled by classical and quantum attacks. While for the iterated scheme, the situation is much more complex. In this paper, we study the next case in line in detail and depth: quantum attacks against two rounds case. We first make an asymptotic comparison with existing classical and quantum attacks. Then we give concrete resource estimation for the proposed quantum attacks on round reduced LED cipher and AES(2). The resource estimation allows to deduce the most efficient attacks based on the trade-off of the number of qubits and Toffoli depth.
引用
收藏
页数:14
相关论文
共 50 条
  • [21] On the Resilience of Even-Mansour to Invariant Permutations
    Mennink, Bart
    Neves, Samuel
    DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (05) : 859 - 893
  • [22] Forking Tweakable Even-Mansour Ciphers
    Kim, Hwigyeom
    Lee, Yeongmin
    Lee, Jooyoung
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2020, 2020 (04) : 71 - 87
  • [23] From Distinguishers to Key Recovery: Improved Related-Key Attacks on Even-Mansour
    Karpman, Pierre
    INFORMATION SECURITY, ISC 2015, 2015, 9290 : 177 - 188
  • [24] The Offline Quantum Attack Against Modular Addition Variant of Even-Mansour Cipher
    Liu, Fangzhou
    Zhu, Xueqi
    Xu, Ruozhou
    Shi, Danping
    Wang, Peng
    INFORMATION SECURITY AND PRIVACY, PT I, ACISP 2024, 2024, 14895 : 3 - 19
  • [25] Minimalism in Cryptography: The Even-Mansour Scheme Revisited
    Dunkelman, Orr
    Keller, Nathan
    Shamir, Adi
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2012, 2012, 7237 : 336 - 354
  • [26] Eliminating random permutation oracles in the Even-Mansour cipher
    Gentry, C
    Ramzan, Z
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2004, PROCEEDINGS, 2004, 3329 : 32 - 47
  • [27] Universal tweakable Even-Mansour cipher and its applications
    ZHANG Ping
    Frontiers of Computer Science, 2023, 17 (04)
  • [28] Security Analysis of Even-Mansour Structure Hash Functions
    Chen, Shiwei
    Cui, Ting
    Jin, Chenhui
    INFORMATION AND COMMUNICATIONS SECURITY (ICICS 2021), PT II, 2021, 12919 : 163 - 173
  • [29] Universal tweakable Even-Mansour cipher and its applications
    Zhang, Ping
    FRONTIERS OF COMPUTER SCIENCE, 2023, 17 (04)
  • [30] Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
    Dinur, Itai
    Dunkelman, Orr
    Keller, Nathan
    Shamir, Adi
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2013, PT I, 2013, 8269 : 337 - 356