Massive Superpoly Recovery with a Meet-in-the-Middle Framework Improved Cube Attacks on Trivium and Kreyvium

被引:0
|
作者
He, Jiahui [1 ,3 ]
Hu, Kai [1 ,3 ,4 ]
Lei, Hao [1 ,3 ]
Wang, Meiqin [1 ,2 ,3 ]
机构
[1] Shandong Univ, Sch Cyber Sci & Technol, Qingdao, Shandong, Peoples R China
[2] Quan Cheng Shandong Lab, Jinan, Peoples R China
[3] Shandong Univ, Key Lab Cryptol Technol & Informat Secur, Minist Educ, Jinan, Peoples R China
[4] Nanyang Technol Univ, Sch Phys & Math Sci, Singapore, Singapore
基金
中国国家自然科学基金;
关键词
Cube Attack; Superpoly; Trivium; Grain-128AEAD; Kreyvium; Division Property; Monomial Prediction; Core Monomial Prediction; DIVISION PROPERTY; KEY-RECOVERY; AUTOMATIC SEARCH;
D O I
10.1007/978-3-031-58716-0_13
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The cube attack extracts the information of secret key bits by recovering the coefficient called superpoly in the output bit with respect to a subset of plaintexts/IV, which is called a cube. While the division property provides an efficient way to detect the structure of the superpoly, superpoly recovery could still be prohibitively costly if the number of rounds is sufficiently high. In particular, Core Monomial Prediction (CMP) was proposed at ASIACRYPT 2022 as a scaled-down version of Monomial Prediction (MP), which sacrifices accuracy for efficiency but ultimately gets stuck at 848 rounds of Trivium. In this paper, we provide new insights into CMP by elucidating the algebraic meaning to the core monomial trails. We prove that it is sufficient to recover the superpoly by extracting all the core monomial trails, an approach based solely on CMP, thus demonstrating that CMP can achieve perfect accuracy as MP does. We further reveal that CMP is still MP in essence, but with variable substitutions on the target function. Inspired by the divide-and-conquer strategy that has been widely used in previous literature, we design a meet-in-the-middle (MITM) framework, in which the CMP-based approach can be embedded to achieve a speedup. To illustrate the power of these new techniques, we apply the MITM framework to Trivium, Grain-128AEAD and Kreyvium. As a result, not only can the previous computational cost of superpoly recovery be reduced (e.g., 5x faster for superpoly recovery on 192-round Grain-128AEAD), but we also succeed in recovering superpolies for up to 851 rounds of Trivium and up to 899 rounds of Kreyvium. This surpasses the previous best results by respectively 3 and 4 rounds. Using the memory-efficient Mobius transform proposed at EUROCRYPT 2021, we can perform key recovery attacks on target ciphers, even though the superpoly may contain over 2(40) monomials. This leads to the best cube attacks on the target ciphers.
引用
收藏
页码:368 / 397
页数:30
相关论文
共 50 条
  • [21] Correlation Cube Attack Revisited Improved Cube Search and Superpoly Recovery Techniques
    Wang, Jianhua
    Qin, Lu
    Wu, Baofeng
    ADVANCES IN CRYPTOLOGY, ASIACRYPT 2023, PT III, 2023, 14440 : 190 - 222
  • [22] Improved Meet-in-the-Middle Cryptanalysis of KTANTAN
    Wei, Lei
    Rechberger, Christian
    Guo, Jian
    Wu, Hongjun
    Wang, Huaxiong
    Ling, San
    INFORMATION SECURITY AND PRIVACY, 2011, 6812 : 433 - +
  • [23] Meet-in-the-Middle Attacks on SHA-3 Candidates
    Khovratovich, Dmitry
    Nikolic, Ivica
    Weinmann, Ralf-Philipp
    FAST SOFTWARE ENCRYPTION, 2009, 5665 : 228 - 245
  • [24] Meet-in-the-Middle Attacks on Round-Reduced Khudra
    Tolba, Mohamed
    Abdelkhalek, Ahmed
    Youssef, Amr M.
    SECURITY, PRIVACY, AND APPLIED CRYPTOGRAPHY ENGINEERING (SPACE 2015), 2015, 9354 : 127 - 138
  • [25] Extended meet-in-the-middle attacks on some Feistel constructions
    Guo, Jian
    Jean, Jeremy
    Nikolic, Ivica
    Sasaki, Yu
    DESIGNS CODES AND CRYPTOGRAPHY, 2016, 80 (03) : 587 - 618
  • [26] Extended meet-in-the-middle attacks on some Feistel constructions
    Jian Guo
    Jérémy Jean
    Ivica Nikolić
    Yu Sasaki
    Designs, Codes and Cryptography, 2016, 80 : 587 - 618
  • [27] A New Method for Meet-in-the-Middle Attacks on Reduced AES
    Dong Xiaoli
    Hu Yupu
    Wei Yongzhuang
    Chen Jie
    CHINA COMMUNICATIONS, 2011, 8 (02) : 21 - 25
  • [28] New Meet-in-the-Middle Attacks on FOX Block Cipher
    Dong, Xiaoli
    Wei, Yongzhuang
    Gao, Wen
    Chen, Jie
    COMPUTER JOURNAL, 2023, 66 (05): : 1195 - 1212
  • [29] Meet-in-the-Middle Attacks on Reduced-Round XTEA
    Sekar, Gautham
    Mouha, Nicky
    Velichkov, Vesselin
    Preneel, Bart
    TOPICS IN CRYPTOLOGY - CT-RSA 2011, 2011, 6558 : 250 - +
  • [30] Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks
    Derbez, Patrick
    Fouque, Pierre-Alain
    ADVANCES IN CRYPTOLOGY (CRYPTO 2016), PT II, 2016, 9815 : 157 - 184