Related-Key Impossible Differential Attacks on LBlock

HUANG Yong-hong; GUO Jian-sheng; LUO Wei

doi:10.3969/j.issn.0372-2112.2015.10.011

您当前的位置：

首页 >

文章列表页 >

Related-Key Impossible Differential Attacks on LBlock

更新时间：2025-07-16

- Related-Key Impossible Differential Attacks on LBlock
- Acta Electronica Sinica Vol. 43, Issue 10, Pages: 1948-1953(2015)
- 作者机构：
  
  1. 重庆邮电大学,重庆,400065
  2. 解放军信息工程大学,河南,郑州,450004
  3. 78179部队,四川,成都,611830
  4. 信息保障技术重点实验室,北京,100000
  5. 重庆邮电大学,重庆,400065
  6. 解放军信息工程大学,河南,郑州,450004
  7. 78179部队,四川,成都,611830
  8. 信息保障技术重点实验室,北京,100000
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61272488);China Postdoctoral Science Foundation (No.2014M562582)
- DOI：10.3969/j.issn.0372-2112.2015.10.011
  CLC： TN918.1
- Published：2015
- 稿件说明：
移动端阅览
HUANG Yong-hong, GUO Jian-sheng, LUO Wei. Related-Key Impossible Differential Attacks on LBlock[J]. Acta Electronica Sinica, 2015, 43(10): 1948-1953.
DOI：

HUANG Yong-hong, GUO Jian-sheng, LUO Wei. Related-Key Impossible Differential Attacks on LBlock[J]. Acta Electronica Sinica, 2015, 43(10): 1948-1953. DOI： 10.3969/j.issn.0372-2112.2015.10.011.

摘要

该文研究了LBlock分组密码算法在相关密钥-不可能差分条件下的安全性.利用子密钥生成算法的差分信息泄漏规律

构造了多条低重量子密钥差分链

给出了15轮相关密钥-不可能差分区分器.通过扩展区分器

给出了23轮和24轮LBlock算法的相关密钥-不可能差分攻击方法.攻击所需的数据复杂度分别为2

65.2

和2

65.6

个选择明文

计算复杂度分别为2

66.2

次23轮LBlock算法加密和2

66.6

次24轮LBlock算法加密

存储复杂度分别为2

61.2

和2

77.2

字节存储空间.与已有结果相比

首次将针对LBlock算法的攻击扩展到了23轮和24轮.

Abstract

In this paper

the strength of LBlock against related-key impossible differential attack is examined.Based on the differential information leakages in sub-key schedule

several sub-key differentials in low weight are constructed

and a 15-round related-key impossible differential distinguisher of LBlock is presented.By extending the distinguisher

related-key impossible differential attacks on 23-round LBlock and 24-round LBlock are presented.The data complexities of the attacks are 2

65.2

and 2

65.6

chosen-plain-text

respectively;the computing complexities of the attacks are 2

66.2

23-round LBlock encryptions and 2

66.6

24-round LBlock encryptions

respectively;the storage complexities of the attacks are 2

61.2

and 2

77.2

bytes of memory space

respectively.The cryptanalysis of reduced-round LBlock are first extended to 23-round and 24-round in this paper.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Related-Key Differential Attack on Block Cipher CIKS-128

Security Evaluation Against Impossible Differential Cryptanalysis and Zero Correlation Linear Cryptanalysis for Two Dynamic Cryptographic Structures

Construction of Fault Injection Attacks Resistant S-Boxes

Reverse-Engineering Secret S-box of Block Ciphers by Persistent Fault

New Integral Attack on Rijndael-256

Related Author

郭建胜

崔竞一

罗伟

刘翼鹏

SHEN Xuan

LIU Guo-qiang

SUN Bing

HE Jun

Related Institution

The Unit of 78179

College of Information and Communication， National University of Defense Technology

College of Sciences， National University of Defense Technology

State Key Laboratory of Information Security， Institute of Information Engineering， Chinese Academy of Sciences

⁰