Impossible Differential Cryptanalysis of Reduced-Round LBlock-s

JIA Ping; XU Hong; LAI Xue-jia

doi:10.3969/j.issn.0372-2112.2017.04.028

您当前的位置：

首页 >

文章列表页 >

Impossible Differential Cryptanalysis of Reduced-Round LBlock-s

更新时间：2025-07-16

- Impossible Differential Cryptanalysis of Reduced-Round LBlock-s
- Acta Electronica Sinica Vol. 45, Issue 4, Pages: 966-973(2017)
- 作者机构：
  
  1. 信息工程大学,河南,郑州,450001
  2. 数学工程与先进计算国家重点实验室,河南,郑州,450001
  5. 上海交通大学计算机科学与工程系,上海,200240
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2017.04.028
  CLC： TP309.7TN918.1
- Published Online：25 April 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
JIA Ping, XU Hong, LAI Xue-jia. Impossible Differential Cryptanalysis of Reduced-Round LBlock-s[J]. Acta Electronica Sinica, 2017, 45(4): 966-973.
DOI：

JIA Ping, XU Hong, LAI Xue-jia. Impossible Differential Cryptanalysis of Reduced-Round LBlock-s[J]. Acta Electronica Sinica, 2017, 45(4): 966-973. DOI： 10.3969/j.issn.0372-2112.2017.04.028.

摘要

LBlock-s算法是CAESAR竞赛候选认证加密算法LAC中的主体算法，算法结构与LBlock算法基本一致，只是密钥扩展算法采用了扩散效果更好的增强版设计.利用新密钥扩展算法中仍然存在的子密钥间的迭代关系，通过选择合适的14轮不可能差分特征，我们给出了对21轮LBlock-s算法的不可能差分分析.攻击需要猜测的子密钥比特数为72比特，需要的数据量为2

个选择明文，时间复杂度约为2

67.61

次21轮加密.利用部分匹配技术，我们也给出了直到23轮LBlock-s算法低于密钥穷举量的不可能差分分析结果.这些研究可以为LAC算法的整体分析提供参考依据.

Abstract

LBlock-s is the kernel block cipher of the authentication encryption algorithm LAC submitted to CAESAR competition.The general structure of LBlock-s is almost the same as that of LBlock

but LBlock-s adopts an improved key schedule algorithm with better diffusion property.Using the shifting relation of subkeys derived by the key schedule algorithm

an impossible differential cryptanalysis on 21-round LBlock-s was presented based on a 14-round impossible differential.The time and data complexities are 2

67.61

21-round encryptions and 2

chosen plaintexts respectively

and the number of subkey bits needed to be guessed is 72.Using partial-matching method

an impossible differential cryptanalysis on

LBlock-s up to 23-round was also presented with time complexity less than exhaustion of all key bits.This work is useful for the security analysis of LAC algorithm.

关键词

Keywords

references

Views

488

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Related-Key Impossible Differential Attacks on LBlock

Zero Correlation Linear Approximations and Impossible Differentials of New-Structure Series with SP Networks

Related Author

HUANG Yong-hong

GUO Jian-sheng

LUO Wei

FU Li-shi

CUI Ting

JIN Chen-hui

Related Institution

Chongqing University of Posts and Telecommunications

The PLA Information Engineering University

The PLA Unit 78179

Science and Technology on Information Assurance Laboratory

Chongqing University of Posts and Telecommunications Chongqing China

⁰