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 条
  • [1] Minimizing the Two-Round Even-Mansour Cipher
    Chen, Shan
    Lampe, Rodolphe
    Lee, Jooyoung
    Seurin, Yannick
    Steinberger, John
    JOURNAL OF CRYPTOLOGY, 2018, 31 (04) : 1064 - 1119
  • [2] Minimizing the Two-Round Even-Mansour Cipher
    Chen, Shan
    Lampe, Rodolphe
    Lee, Jooyoung
    Seurin, Yannick
    Steinberger, John
    ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT I, 2014, 8616 : 39 - 56
  • [3] New Key Recovery Attacks on Minimal Two-Round Even-Mansour Ciphers
    Isobe, Takanori
    Shibutani, Kyoji
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT I, 2017, 10624 : 244 - 263
  • [4] Meet-in-the-Middle Key Recovery Attacks on a Single-Key Two-Round Even-Mansour Cipher
    Isobe, Takanori
    Shibutani, Kyoji
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (01): : 17 - 26
  • [5] Low-Memory Attacks Against Two-Round Even-Mansour Using the 3-XOR Problem
    Leurent, Gaetan
    Sibleyras, Ferdinand
    ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT II, 2019, 11693 : 210 - 235
  • [6] Quantum Key Recovery Attacks on 4-Round Iterated Even-Mansour with Two Keys
    Anand, Ravi
    Ghosh, Shibam
    Isobe, Takanori
    Shiba, Rentaro
    INFORMATION SECURITY, PT I, ISC 2024, 2025, 15257 : 87 - 103
  • [7] Quantum attacks on Sum of Even-Mansour pseudorandom functions
    Shinagawa, Kazuo
    Iwata, Tetsu
    INFORMATION PROCESSING LETTERS, 2022, 173
  • [8] Minimizing the Two-Round Even–Mansour Cipher
    Shan Chen
    Rodolphe Lampe
    Jooyoung Lee
    Yannick Seurin
    John Steinberger
    Journal of Cryptology, 2018, 31 : 1064 - 1119
  • [9] Quantum key recovery attacks on tweakable Even-Mansour ciphers
    Zhang, Ping
    Luo, Yiyuan
    QUANTUM INFORMATION PROCESSING, 2023, 22 (09)
  • [10] On Quantum Related-Key Attacks on Iterated Even-Mansour Ciphers
    Hosoyamada, Akinori
    Aoki, Kazumaro
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (01): : 27 - 34