Cube attacks on round-reduced TinyJAMBU

被引:0
|
作者
Wil Liam Teng
Iftekhar Salam
Wei-Chuen Yau
Josef Pieprzyk
Raphaël C.-W. Phan
机构
[1] Xiamen University Malaysia,School of Computing and Data Science
[2] Data61,School of IT
[3] Commonwealth Scientific and Industrial Research Organisation,Department of Software Systems & Cybersecurity
[4] Institute of Computer Science,undefined
[5] Polish Academy of Sciences,undefined
[6] Monash University,undefined
[7] Faculty of IT,undefined
[8] Monash University,undefined
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Lightweight cryptography has recently gained importance as the number of Internet of things (IoT) devices connected to Internet grows. Its main goal is to provide cryptographic algorithms that can be run efficiently in resource-limited environments such as IoT. To meet the challenge, the National Institute of Standards and Technology (NIST) announced the Lightweight Cryptography (LWC) project. One of the finalists of the project is the TinyJAMBU cipher. This work evaluates the security of the cipher. The tool used for the evaluation is the cube attack. We present five distinguishing attacks DA1–DA5 and two key recovery attacks KRA1–KRA2. The first two distinguishing attacks (DA1 and DA2) are launched against the initialisation phase of the cipher. The best result achieved for the attacks is a distinguisher for an 18-bit cube, where the cipher variant consists of the full initialisation phase together with 438 rounds of the encryption phase. The key recovery attacks (KRA1 and KRA2) are also launched against the initialisation phase of the cipher. The best key recovery attack can be applied for a cipher variant that consists of the full initialisation phase together with 428 rounds of the encryption phase. The attacks DA3–DA5 present a collection of distinguishers up to 437 encryption rounds, whose 32-bit cubes are chosen from the plaintext, nonce, or associated data bits. The results are confirmed experimentally. A conclusion from the work is that TinyJAMBU has a better security margin against cube attacks than claimed by the designers.
引用
收藏
相关论文
共 50 条
  • [41] Truncated Differential-Neural Key Recovery Attacks on Round-Reduced HIGHT
    Seok, Byoungjin
    ELECTRONICS, 2024, 13 (20)
  • [42] Truncated differential based known-key attacks on round-reduced SIMON
    Hao, Yonglin
    Meier, Willi
    DESIGNS CODES AND CRYPTOGRAPHY, 2017, 83 (02) : 467 - 492
  • [43] Integral Attacks on Pyjamask-96 and Round-Reduced Pyjamask-128
    Cui, Jiamin
    Hu, Kai
    Wang, Qingju
    Wang, Meiqin
    TOPICS IN CRYPTOLOGY, CT-RSA 2022, 2022, 13161 : 223 - 246
  • [44] Truncated differential based known-key attacks on round-reduced SIMON
    Yonglin Hao
    Willi Meier
    Designs, Codes and Cryptography, 2017, 83 : 467 - 492
  • [45] Integral Attacks on Pyjamask-96 and Round-Reduced Pyjamask-128
    Cui, Jiamin
    Hu, Kai
    Wang, Qingju
    Wang, Meiqin
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2022, 13161 LNCS : 223 - 246
  • [46] New Insights into Divide-and-Conquer Attacks on the Round-Reduced Keccak-MAC
    YE Chendong
    TIAN Tian
    ChineseJournalofElectronics, 2019, 28 (04) : 698 - 705
  • [47] Non-full Sbox Linearization: Applications to Collision Attacks on Round-Reduced KECCAK
    Song, Ling
    Liao, Guohong
    Guo, Jian
    ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PART II, 2017, 10402 : 428 - 451
  • [48] Preimage and pseudo collision attacks on round-reduced DHA-256 hash function
    Zou, Jian
    Wu, Wen-Ling
    Wu, Shuang
    Dong, Le
    Tongxin Xuebao/Journal on Communications, 2013, 34 (06): : 8 - 15
  • [49] Collision Attacks on Round-Reduced SHA-3 Using Conditional Internal Differentials
    Zhang, Zhongyi
    Hou, Chengan
    Liu, Meicheng
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2023, PT IV, 2023, 14007 : 220 - 251
  • [50] Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning
    Gohr, Aron
    ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT II, 2019, 11693 : 150 - 179