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 条
  • [1] Cube attacks on round-reduced TinyJAMBU
    Teng, Wil Liam
    Salam, Iftekhar
    Yau, Wei-Chuen
    Pieprzyk, Josef
    Phan, Raphael C-W
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [2] Cube attacks on round-reduced MORUS and Gimli
    Siwei Chen
    Zejun Xiang
    Xiangyong Zeng
    Shasha Zhang
    Science China Information Sciences, 2022, 65
  • [3] Cube attacks on round-reduced MORUS and GimLi
    Siwei CHEN
    Zejun XIANG
    Xiangyong ZENG
    Shasha ZHANG
    Science China(Information Sciences), 2022, 65 (01) : 265 - 267
  • [4] Cube attacks on round-reduced MORUS and GIMLI
    Chen, Siwei
    Xiang, Zejun
    Zeng, Xiangyong
    Zhang, Shasha
    SCIENCE CHINA-INFORMATION SCIENCES, 2022, 65 (01)
  • [5] Cube Cryptanalysis of Round-Reduced ACORN
    Yang, Jingchun
    Liu, Meicheng
    Lin, Dongdai
    INFORMATION SECURITY, ISC 2019, 2019, 11723 : 44 - 64
  • [6] Cube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
    Dinur, Itai
    Morawiecki, Pawel
    Pieprzyk, Josef
    Srebrny, Marian
    Straus, Michal
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT I, 2015, 9056 : 733 - 761
  • [7] Practical attacks on the round-reduced PRINCE
    Morawiecki, Pawel
    IET INFORMATION SECURITY, 2017, 11 (03) : 146 - 151
  • [8] Algebraic Attacks on Round-Reduced Keccak
    Liu, Fukang
    Isobe, Takanori
    Meier, Willi
    Yang, Zhonghao
    INFORMATION SECURITY AND PRIVACY, ACISP 2021, 2021, 13083 : 91 - 110
  • [9] Conditional cube attack on round-reduced River Keyak
    Bi, Wenquan
    Li, Zheng
    Dong, Xiaoyang
    Li, Lu
    Wang, Xiaoyun
    DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (06) : 1295 - 1310
  • [10] Improved Practical Attacks on Round-Reduced Keccak
    Dinur, Itai
    Dunkelman, Orr
    Shamir, Adi
    JOURNAL OF CRYPTOLOGY, 2014, 27 (02) : 183 - 209