| 注册
首页|期刊导航|密码学报(中英文)|基于MILP的ECLBC算法积分区分器搜索

基于MILP的ECLBC算法积分区分器搜索

李艳俊 张黎仙 林怡平 陈颖 谢惠琴

密码学报(中英文)2026,Vol.13Issue(2):310-324,15.
密码学报(中英文)2026,Vol.13Issue(2):310-324,15.DOI:10.13868/j.cnki.jcr.000852

基于MILP的ECLBC算法积分区分器搜索

MILP-Based Search for Integral Distinguishers of ECLBC Algorithm

李艳俊 1张黎仙 2林怡平 3陈颖 2谢惠琴2

作者信息

  • 1. 中国电子科技集团公司第十五研究所 信息产业信息安全测评中心,北京 100083||北京电子科技学院 密码科学与技术系,北京 100070
  • 2. 北京电子科技学院 密码科学与技术系,北京 100070
  • 3. 北京电子科技学院 网络空间安全系,北京 100070
  • 折叠

摘要

Abstract

ECLBC algorithm is a lightweight block cipher with SPN structure proposed by Guo et al.in 2024,which has error detection and error correction mechanism,and can realize the secure transmission of data,and has a broad application prospect in the field of Internet of Things(IoT).Integral analysis is a commonly used way of cryptanalysis,using the three-subset bit division property,combined with the MILP automated search tool,can be more accurate and effective to find the integral distinguisher.This study uses the MILP model to find the integral distinguisher based on the three-subset bit division for the block cipher ECLBC algorithm.It is worth noting that,in modelling the division of the nonlinear layer of the ECLBC algorithm,the"S-box"technique is used,where the nonlinear layer is regarded as the"S-box"layer,and in describing the propagation of the division of the S-box of the nonlinear operations,the"expand-and-reduce"technique is used,where the nonlinear layer is regarded as the"S-box"layer.In describing the propagation of the division property of the nonlinear S-box,the"expand-and-reduce"reduction algorithm is used to generate the corresponding inequality sets.Firstly,a larger set of inequalities is generated based on the original set of inequalities generated by the convex method.Secondly,a small and sufficient subset of inequalities is selected from the large set in the previous step.By proposed method,the number of linear inequalities propagated by the"S-box"division property of the ECLBC algorithm is greatly reduced.In addition,through cross propagation,the integral distinguisher for searching for the division property of three-subset of an algorithm with r rounds is transformed into solving r MILP models,and for the first time,a 9-round integral distinguisher is found for the ECLBC algorithm,which is one round more than the previous best result.

关键词

ECLBC算法/三子集/MILP/约简算法/交叉传播

Key words

ECLBC/three-subset/MILP/reduction algorithm/cross propagation

分类

信息技术与安全科学

引用本文复制引用

李艳俊,张黎仙,林怡平,陈颖,谢惠琴..基于MILP的ECLBC算法积分区分器搜索[J].密码学报(中英文),2026,13(2):310-324,15.

基金项目

北京市自然科学基金(4234084)Natural Science Foundation of Beijing Municipality(4234084) (4234084)

密码学报(中英文)

2095-7025

访问量0
|
下载量0
段落导航相关论文