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 条
  • [41] Counting equations in algebraic attacks on block ciphers
    Knudsen, Lars R.
    Miolane, Charlotte V.
    INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2010, 9 (02) : 127 - 135
  • [42] Block ciphers sensitive to Grobner basis attacks
    Buchmann, J
    Pyshkin, A
    Weinmann, RP
    TOPICS IN CRYPTOLOGY - CT-RSA 2006, PROCEEDINGS, 2006, 3860 : 313 - 331
  • [43] Counting equations in algebraic attacks on block ciphers
    Lars R. Knudsen
    Charlotte V. Miolane
    International Journal of Information Security, 2010, 9 : 127 - 135
  • [44] Attacks on Block Ciphers of Low Algebraic Degree
    Thomas Jakobsen
    Lars R. Knudsen
    Journal of Cryptology, 2001, 14 : 197 - 210
  • [45] Quantum attacks on some feistel block ciphers
    Dong, Xiaoyang
    Dong, Bingyou
    Wang, Xiaoyun
    DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (06) : 1179 - 1203
  • [46] Protecting Block Ciphers against Differential Fault Attacks without Re-keying
    Baksi, Anuhhah
    Bhasin, Shivam
    Breier, Jakub
    Khairallah, Mustafa
    Peyrin, Thomas
    PROCEEDINGS OF THE 2018 IEEE INTERNATIONAL SYMPOSIUM ON HARDWARE ORIENTED SECURITY AND TRUST (HOST), 2018, : 191 - 194
  • [47] Quantum attacks on some feistel block ciphers
    Xiaoyang Dong
    Bingyou Dong
    Xiaoyun Wang
    Designs, Codes and Cryptography, 2020, 88 : 1179 - 1203
  • [48] On the Design Rationale of SIMON Block Cipher: Integral Attacks and Impossible Differential Attacks against SIMON Variants
    Kondo, Kota
    Sasaki, Yu
    Todo, Yosuke
    Iwata, Tetsu
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2018, E101A (01) : 88 - 98
  • [49] On the Design Rationale of SIMON Block Cipher: Integral Attacks and Impossible Differential Attacks against SIMON Variants
    Kondo, Kota
    Sasaki, Yu
    Iwata, Tetsu
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2016, 2016, 9696 : 518 - 536
  • [50] An Upper Bound of the Longest Impossible Differentials of Several Block Ciphers
    Han, Guoyong
    Zhang, Wenying
    Zhao, Hongluan
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2019, 13 (01) : 435 - 451