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 条
  • [31] Improved Meet-in-the-Middle Attacks on Nine Rounds of the AES-192 Block Cipher
    Lu, Jiqiang
    Zhou, Wenchang
    TOPICS IN CRYPTOLOGY, CT-RSA 2024, 2024, 14643 : 136 - 159
  • [32] Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly
    Hao, Yonglin
    Isobe, Takanori
    Jiao, Lin
    Li, Chaoyun
    Meier, Willi
    Todo, Yosuke
    Wang, Qingju
    IEEE TRANSACTIONS ON COMPUTERS, 2019, 68 (10) : 1470 - 1486
  • [33] Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly
    Wang, Qingju
    Hao, Yonglin
    Todo, Yosuke
    Li, Chaoyun
    Isobe, Takanori
    Meier, Willi
    ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT I, 2018, 10991 : 275 - 305
  • [34] Improved Meet-in-the-Middle Attacks on Reduced-Round Deoxys-BC-256
    Liu, Ya
    Shi, Bing
    Gu, Dawu
    Zhao, Fengyu
    Li, Wei
    Liu, Zhiqiang
    COMPUTER JOURNAL, 2020, 63 (12): : 1859 - 1870
  • [35] Improved meet-in-the-middle attack on ARIA cipher
    Institute of Cyberspace Security, The PLA Information Engineering University, Zhengzhou
    450001, China
    不详
    450001, China
    Tongxin Xuebao, 3
  • [36] Meet-in-the-Middle Attacks on Classes of Contracting and Expanding Feistel Constructions
    Guo, Jian
    Jean, Jeremy
    Nikolic, Ivica
    Sasaki, Yu
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2016, 2016 (02) : 307 - 337
  • [37] Meet-in-the-Middle Preimage Attacks on Sponge-Based Hashing
    Qin, Lingyue
    Hua, Jialiang
    Dong, Xiaoyang
    Yan, Hailun
    Wang, Xiaoyun
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2023, PT IV, 2023, 14007 : 158 - 188
  • [38] Memoryless Unbalanced Meet-in-the-Middle Attacks: Impossible Results and Applications
    Sasaki, Yu
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2014, 2014, 8479 : 253 - 270
  • [39] Improved Meet-in-the-Middle Attacks on Reduced-Round Kiasu-BC and Joltik-BC
    Liu, Ya
    Shi, Yifan
    Gu, Dawu
    Zeng, Zhiqiang
    Zhao, Fengyu
    Li, Wei
    Liu, Zhiqiang
    Bao, Yang
    COMPUTER JOURNAL, 2019, 62 (12): : 1761 - 1776
  • [40] Improved Meet-in-the-Middle Attacks on Reduced-Round Tweakable Block Cipher Deoxys-BC
    Li, Manman
    Chen, Shaozhen
    COMPUTER JOURNAL, 2022, 65 (09): : 2411 - 2420