Key-Recovery Attacks on LED-Like Block Ciphers

被引:0
|
作者
Linhong Xu [1 ]
Jiansheng Guo [1 ]
Jingyi Cui [1 ]
Mingming Li [1 ]
机构
[1] the Information Science and Technology Institute
关键词
key-recovery attack; cryptanalysis; post-quantum cryptography; lightweight block cipher; LED;
D O I
暂无
中图分类号
TN918 [通信保密与通信安全]; O413 [量子论];
学科分类号
070201 ; 0839 ; 1402 ;
摘要
Asymmetric cryptographic schemes, represented by RSA, have been shown to be insecure under quantum computing conditions. Correspondingly, there is a need to study whether the symmetric cryptosystem can still guarantee high security with the advent of quantum computers. In this paper, based on the basic principles of classical slide attacks and Simon’s algorithm, we take LED-like lightweight block ciphers as research objects to present a security analysis under both classical and quantum attacks, fully considering the influence on the security of the ciphers of adding the round constants. By analyzing the information leakage of round constants, we can introduce the differential of the round constants to propose a classical slide attack on full-round LED-64 with a probability of 1. The analysis result shows that LED-64 is unable to resist this kind of classical slide attack, but that attack method is not applicable to LED-128. As for quantum attacks, by improving on existing quantum attack methods we demonstrate a quantum single-key slide attack on LED-64 and a quantum related-key attack on LED-128, and indicators of the two attack algorithms are analyzed in detail. The attack results show that adding round constants does not completely improve the security of the ciphers, and quantum attacks can provide an exponential speed-up over the same attacks in the classical model. It further illustrates that the block cipher that is proved to be safe under classical settings is not necessarily secure under quantum conditions.
引用
收藏
页码:585 / 595
页数:11
相关论文
共 50 条
  • [41] Randomness Analysis on LED Block Ciphers
    Isa, Herman
    Z'aba, Muhammad Reza
    PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON SECURITY OF INFORMATION AND NETWORKS, 2012, : 60 - 66
  • [42] Related-Key Zero-Correlation Linear Attacks on Block Ciphers with Linear Key Schedules
    Yi, Zhang
    Kai, Zhang
    Ting, Cui
    CHINESE JOURNAL OF ELECTRONICS, 2024, 33 (03) : 672 - 682
  • [43] Polynomial-Time Key-Recovery Attacks Against NTRURe Encrypt from ASIACCS'15
    LIU Zhen
    PAN Yanbin
    ZHENG Jinwei
    Journal of Systems Science & Complexity, 2024, (03) : 1308 - 1325
  • [44] All-subkeys-recovery attacks on a variation of Feistel-2 block ciphers
    Yang, Dong
    Qi, Wen-Feng
    Tian, Tian
    IET INFORMATION SECURITY, 2017, 11 (05) : 230 - 234
  • [45] Attacks on block ciphers of low algebraic degree
    Jakobsen, T
    Knudsen, LR
    JOURNAL OF CRYPTOLOGY, 2001, 14 (03) : 197 - 210
  • [46] Improved algebraic attacks on lightweight block ciphers
    Yeo, Sze Ling
    Le, Duc-Phong
    Khoo, Khoongming
    JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2021, 11 (01) : 1 - 19
  • [47] Encasing Block Ciphers to Foil Key Recovery Attempts via Side Channel
    Agosta, Giovanni
    Barenghi, Alessandro
    Pelosi, Gerardo
    Scandale, Michele
    2016 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2016,
  • [48] Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT
    Zhao, Boxin
    Dong, Xiaoyang
    Meier, Willi
    Jia, Keting
    Wang, Gaoli
    DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (06) : 1103 - 1126
  • [49] Integral Attacks on Some Lightweight Block Ciphers
    Zhu, Shiqiang
    Wang, Gaoli
    He, Yu
    Qian, Haifeng
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2020, 14 (11) : 4502 - 4521
  • [50] Experimental statistical attacks on block and stream ciphers
    Doroshenko, S.
    Fionov, A.
    Lubkin, A.
    Monarev, V.
    Ryabko, B.
    Shokin, Yu. I.
    COMPUTATIONAL SCIENCE AND HIGH PERFORMANCE COMPUTING III, 2008, 101 : 155 - +