Impossible differential attacks on the SKINNY family of block ciphers

被引:21
|
作者
Yang, Dong [1 ]
Qi, Wen-Feng [1 ]
Chen, Hua-Jin [1 ]
机构
[1] Natl Digital Switching Syst Engn & Technol Res Ct, POB 407,62 Kexue Rd, Zhengzhou 450001, Henan, Peoples R China
关键词
cryptography; greedy algorithms; impossible differential attacks; lightweight block ciphers; CRYPTO; 2016; TWEAKEY framework; tweakey input; differential cryptanalysis; linear cryptanalysis; early-abort technique; greedy strategy; SKINNY-n-k; SKINNY cipher; n-bit block size; k-bit tweakey size; 17-round SKINNY-64-64; SKINNY-128-128; 17-round encryptions; 19-round SKINNY-64-128; SKINNY-128-256; 19-round encryptions; 21-round SKINNY-64-192; SKINNY-128-384; 21-round encryptions; CRYPTANALYSIS; ROUNDS;
D O I
10.1049/iet-ifs.2016.0488
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
SKINNY is a family of lightweight block ciphers proposed at CRYPTO 2016, which follows the TWEAKEY framework and takes a tweakey input. It is shown that SKINNY family not only has good hardware/software performances, but also provides strong security guarantees against differential/linear cryptanalysis. In this study, the authors study the security of SKINNY against the impossible differential attack. First, they get some properties of the subkeys of SKINNY by analysing its key schedule. Then, combining with the early-abort technique and the greedy strategy, they present impossible differential attacks on SKINNY based on an 11-round impossible differential. Let SKINNY-n-k be the SKINNY cipher with n-bit block size and k-bit tweakey size. On the basis of their method, 17-round SKINNY-64-64 (resp. SKINNY-128-128) can be broken in 261.8 (resp. 2120.8) 17-round encryptions, 19-round SKINNY-64-128 (resp. SKINNY-128-256) can be broken in 2119.8 (resp. 2241.8) 19-round encryptions and 21-round SKINNY-64-192 (resp. SKINNY-128-384) can be broken in 2180.5 (resp. 2353.6) 21-round encryptions. To the best of their knowledge, these results are currently the best results with respect to the attacked rounds.
引用
收藏
页码:377 / 385
页数:9
相关论文
共 50 条
  • [21] A new type of attacks on block ciphers
    Ryabko B.Ya.
    Monarev V.A.
    Shokin Yu.I.
    Problems of Information Transmission, 2005, 41 (4) : 385 - 394
  • [22] New combined attacks on block ciphers
    Biham, E
    Dunkelman, O
    Keller, N
    FAST SOFTWARE ENCRYPTION, 2005, 3557 : 126 - 144
  • [23] A new impossible differential attack on SAFER ciphers
    Zheng, Shihui
    Wang, Licheng
    Yang, Yixian
    COMPUTERS & ELECTRICAL ENGINEERING, 2010, 36 (01) : 180 - 189
  • [24] A Note on the Impossible Differential Attacks on Block Cipher SM4
    Chen, Jiazhe
    PROCEEDINGS OF 2016 12TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2016, : 551 - 554
  • [25] Impossible Differential Cryptanalysis on Gimli/Xoodoo Ciphers
    Fan T.
    Wei Y.
    Li L.
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2023, 45 (10): : 3729 - 3736
  • [26] Bounding the length of impossible differentials for SPN block ciphers
    Wang, Qian
    Jin, Chenhui
    DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (11) : 2477 - 2493
  • [27] Bounding the length of impossible differentials for SPN block ciphers
    Qian Wang
    Chenhui Jin
    Designs, Codes and Cryptography, 2021, 89 : 2477 - 2493
  • [28] Algebraic-Differential Attacks on a Family of Arithmetization-Oriented Symmetric Ciphers
    LI Zhengnan
    WU Baofeng
    LIN Dongdai
    Journal of Systems Science & Complexity, 2023, 36 (06) : 2681 - 2702
  • [29] Impossible differential attacks on FOX
    Wei, Yue-Chuan
    Sun, Bing
    Li, Chao
    Tongxin Xuebao/Journal on Communications, 2010, 31 (09): : 24 - 29
  • [30] Note on Impossible Differential Attacks
    Derbez, Patrick
    FAST SOFTWARE ENCRYPTION (FSE 2016), 2016, 9783 : 416 - 427