Article(id=1329435607421530434, tenantId=1146029695717560320, journalId=1324759914146529478, issueId=1329435571803501430, articleNumber=null, orderNo=null, doi=10.7544/issn1000-1239.202550746, pmid=null, cstr=null, oa=null, hot=null, price=null, onlineType=0, articleFormat=0, articleType=null, articleTypeStr=null, receivedDate=1760371200000, receivedDateStr=2025-10-14, revisedDate=1781193600000, revisedDateStr=2026-06-12, acceptedDate=1782057600000, acceptedDateStr=2026-06-22, onlineDate=1794891748528, onlineDateStr=2026-11-17, pubDate=1793462400000, pubDateStr=2026-11-01, doiRegisterDate=null, doiRegisterDateStr=null, onlineIssueDate=1794891748528, onlineIssueDateStr=2026-11-17, onlineJustAcceptDate=null, onlineJustAcceptDateStr=null, onlineFirstDate=null, onlineFirstDateStr=null, sourceXml=null, magXml=null, createTime=1794891748528, creator=13701087609, updateTime=1794891748528, updator=13701087609, issue=Issue{id=1329435571803501430, tenantId=1146029695717560320, journalId=1324759914146529478, year='2026', volume='63', issue='11', pageStart='2767', pageEnd='3031', issueExtLink='null', onlineDate='null', pubDate='1793462400000', pubDateStr='2026-11-01', beforeIssueId=null, nextIssueId=null, price=null, status=1, issueComplete=1, articleOrder=1, issueType=1, specialIssue=null, createTime=1794891740036, creator='13701087609', updateTime=1794891740036, updator='13701087609', preIssue=null, nextIssue=null, articleTotal=null, ext=null, issueFiles=null, downloadFileDto=null}, startPage=2856, endPage=2870, ext={EN=ArticleExt(id=1329435607593496899, articleId=1329435607421530434, tenantId=1146029695717560320, journalId=1324759914146529478, language=EN, title=Integral Attack for LLLWBC Based on Algebraic Structure, columnId=1325493671541474142, journalTitle=Journal of Computer Research and Development, columnName=Network and Information Security, runingTitle=null, highlight=null, articleAbstract=

Automated analysis techniques for lightweight block cipher algorithms have been a hot topic in recent research. The LLLWBC algorithm, proposed at the Inscrypt 2022 conference, is a novel low-latency lightweight block cipher that demonstrates excellent encryption and decryption performance in both software and hardware implementations. However, its security against emerging cryptanalytic techniques requires further investigation. In this paper, a new technique for constructing word-based propagation trails in block cipher algorithms is introduced, an automated detection method for seven distinct algebraic structures is proposed, then an automated search approach for integral distinguishers is also proposed based on these algebraic structures. Furthermore, the construction method for key guessing trails during the key recovery process of integral attacks is investigated, and the optimal key guessing set can be obtained by using this method. Based on the proposed method, we construct a 9-round integral distinguisher for LLLWBC with a data complexity of $ {2}^{52} $ plaintext blocks, which are one round longer than the distinguishers given by the designers. Subsequently, based on the obtained 9-round integral distinguisher, a 12-round key-recovery attack of LLLWBC is proposed, which requires the data complexity of about $ {2}^{56.17} $ chosen data, the memory complexity of about $ {2}^{72} $ 128b guess key and $ {2}^{52} $ 64b ciphertexts, the time complexity of about $ {2}^{122.09} $ times encryptions of 12-round LLLWBC. Experimental results demonstrate that the 12-round LLLWBC algorithm is vulnerable to integral attacks, while the full 21-round LLLWBC maintains a sufficient security margin. The construction method of integral distinguisher and key recovery technique proposed in this paper can also be applied to other word-oriented block ciphers.

, authors=Tao Ye1, 2, 3, Liuyang Jiao1, 3, Yongzhuang Wei1, 2, 3, *, Lingchen Li1, 3, Erzhe Zhou1, 3, authorsList=Tao Ye, Liuyang Jiao, Yongzhuang Wei, Lingchen Li, Erzhe Zhou, authorCompany=null, correspAuthors=Yongzhuang Wei, authorNote=

born in 1991. PhD, lecturer, master supervisor. His main research interest includes design and analysis of symmetric cryptographic algorithms

born in 1999. Master. Her main research interest includes design and analysis of symmetric cryptographic algorithms

born in 1976. PhD, professor, PhD supervisor. His main research interests include the design of symmetric cryptographic algorithms, intelligent analysis of cryptographic algorithms, and side-channel cryptanalysis

born in 1988. PhD, lecturer, master supervisor. Her main research interest includes design and analysis of symmetric cryptographic algorithms

born in 1999. Master. His main research interest includes design and analysis of symmetric cryptographic algorithms

, correspAuthorsNote=null, copyrightStatement=Copyright © 2026 Journal of Computer Research and Development. All rights reserved., copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=null, magXml=null, pdfUrl=null, pdf=null, pdfFileSize=null, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=null, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=null, mapNumber=null, fund=null), CN=ArticleExt(id=1329435609086669138, articleId=1329435607421530434, tenantId=1146029695717560320, journalId=1324759914146529478, language=CN, title=基于代数结构的LLLWBC积分攻击, columnId=1325493672690713440, journalTitle=计算机研究与发展, columnName=网络与信息安全, runingTitle=null, highlight=null, articleAbstract=

轻量级分组密码算法的自动化分析技术是近些年研究的热点内容。LLLWBC算法是在Inscrypt 2022会议上提出的新型低延迟轻量级分组密码算法,其在软件和硬件实现上具有非常优秀的加解密性能。然而,针对一些新的安全性分析技术,LLLWBC算法是否安全还需要进一步研究。提出分组密码算法新的字传播轨迹构造技术,给出了7种不同布尔代数结构的自动化检测方法,并基于代数结构给出了积分区分器的自动化搜索方法。同时,研究了积分攻击密钥恢复过程中密钥猜测轨迹的构造方法,该方法能够自动地搜索到最优的密钥猜测集合。利用上述方法,构造了LLLWBC算法9轮的积分区分器,需要的数据复杂度为$ {2}^{52} $个LLLWBC明文分组,相比之前的积分区分器轮数增加1。随后,利用得到的9轮积分区分器,能够对12轮的LLLWBC算法进行密钥恢复攻击,该攻击需要的数据复杂度为$ {2}^{56.17} $个64b明文数据,存储复杂度为$ {2}^{72} $个128b的猜测密钥和$ {2}^{52} $个64b的密文数据,时间复杂度为$ {2}^{122.09} $次12轮加密操作。实验结果表明:12轮的LLLWBC算法无法抵抗积分攻击,全轮为21轮的LLLWBC算法仍然具有足够的安全冗余。提出的积分区分器构造方法和密钥恢复方法同样适用于其他基于字运算的密码算法。

, authors=叶涛1, 2, 3, 焦留洋1, 3, 韦永壮1, 2, 3, *, 李灵琛1, 3, 周尔哲1, 3, authorsList=叶涛, 焦留洋, 韦永壮, 李灵琛, 周尔哲, authorCompany=null, correspAuthors=韦永壮, authorNote=

作者贡献声明

叶涛、韦永壮负责方案整体设计并撰写论文;焦留洋和周尔哲负责算法思路和实验方法;李灵琛提出指导意见并修改论文。

1991年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

1976年生。博士,教授,博士生导师。主要研究方向为对称密码算法的设计、密码算法智能化分析、侧信道密码分析

1988年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

, correspAuthorsNote=
韦永壮()
, copyrightStatement=版权所有 © 2026 计算机研究与发展编辑部, copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=wQhAVwWPReXUe4ZRxqo9lg==, magXml=qXfp+rjieN1YinqHjg/ynQ==, pdfUrl=null, pdf=9Gbr9sHDqD61GMY7Z8r7uw==, pdfFileSize=2368879, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=yVBEugoJNHLJAtbKrRorfQ==, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=NoGrTdylcBOqltIyTeqAYA==, mapNumber=null, fund=null)}, authors=[Author(id=1329435609589985629, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=0, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=fendouyetao@163.com, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329435609720009057, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435609589985629, language=EN, stringName=Tao Ye, firstName=Tao, middleName=null, lastName=Ye, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, 3, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
2State Key Laboratory of Cryptology Science and Technology, Beijing 100878
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1991. PhD, lecturer, master supervisor. His main research interest includes design and analysis of symmetric cryptographic algorithms

"}, bioImg=null, bioContent=

born in 1991. PhD, lecturer, master supervisor. His main research interest includes design and analysis of symmetric cryptographic algorithms

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435609791312226, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435609589985629, language=CN, stringName=叶涛, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, 3, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
2密码科学技术国家重点实验室 北京 100878
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"6e/jFjikQ5cR4ox+vIC6hA==","content":"

1991年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

"}, bioImg=6e/jFjikQ5cR4ox+vIC6hA==, bioContent=

1991年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609397047638, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=2, ext=[AuthorCompanyExt(id=1329435609405436247, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2State Key Laboratory of Cryptology Science and Technology, Beijing 100878), AuthorCompanyExt(id=1329435609418019160, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2密码科学技术国家重点实验室 北京 100878)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])]), Author(id=1329435609875198308, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=1, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329435609967472999, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435609875198308, language=EN, stringName=Liuyang Jiao, firstName=Liuyang, middleName=null, lastName=Jiao, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1999. Master. Her main research interest includes design and analysis of symmetric cryptographic algorithms

"}, bioImg=null, bioContent=

born in 1999. Master. Her main research interest includes design and analysis of symmetric cryptographic algorithms

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435610038776168, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435609875198308, language=CN, stringName=焦留洋, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"jd9XPLC96fxKt32Yd5yZUQ==","content":"

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

"}, bioImg=jd9XPLC96fxKt32Yd5yZUQ==, bioContent=

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])]), Author(id=1329435610118467946, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=2, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=walker_wyz@guet.edu.cn, emailSecond=null, emailThird=null, correspondingAuthor=1, authorType=1, ext={EN=AuthorExt(id=1329435610210742638, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610118467946, language=EN, stringName=Yongzhuang Wei, firstName=Yongzhuang, middleName=null, lastName=Wei, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, 3, *, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
2State Key Laboratory of Cryptology Science and Technology, Beijing 100878
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1976. PhD, professor, PhD supervisor. His main research interests include the design of symmetric cryptographic algorithms, intelligent analysis of cryptographic algorithms, and side-channel cryptanalysis

"}, bioImg=null, bioContent=

born in 1976. PhD, professor, PhD supervisor. His main research interests include the design of symmetric cryptographic algorithms, intelligent analysis of cryptographic algorithms, and side-channel cryptanalysis

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435610282045807, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610118467946, language=CN, stringName=韦永壮, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, 3, *, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
2密码科学技术国家重点实验室 北京 100878
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"6rlYaXcIwRoZ658IrXIzOw==","content":"

1976年生。博士,教授,博士生导师。主要研究方向为对称密码算法的设计、密码算法智能化分析、侧信道密码分析

"}, bioImg=6rlYaXcIwRoZ658IrXIzOw==, bioContent=

1976年生。博士,教授,博士生导师。主要研究方向为对称密码算法的设计、密码算法智能化分析、侧信道密码分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609397047638, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=2, ext=[AuthorCompanyExt(id=1329435609405436247, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2State Key Laboratory of Cryptology Science and Technology, Beijing 100878), AuthorCompanyExt(id=1329435609418019160, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2密码科学技术国家重点实验室 北京 100878)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])]), Author(id=1329435610349154673, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=3, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329435610428846452, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610349154673, language=EN, stringName=Lingchen Li, firstName=Lingchen, middleName=null, lastName=Li, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1988. PhD, lecturer, master supervisor. Her main research interest includes design and analysis of symmetric cryptographic algorithms

"}, bioImg=null, bioContent=

born in 1988. PhD, lecturer, master supervisor. Her main research interest includes design and analysis of symmetric cryptographic algorithms

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435610491761013, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610349154673, language=CN, stringName=李灵琛, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"g33unAEk6Gn36vkNG4F3Jg==","content":"

1988年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

"}, bioImg=g33unAEk6Gn36vkNG4F3Jg==, bioContent=

1988年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])]), Author(id=1329435610550481271, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=4, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329435610621784442, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610550481271, language=EN, stringName=Erzhe Zhou, firstName=Erzhe, middleName=null, lastName=Zhou, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1999. Master. His main research interest includes design and analysis of symmetric cryptographic algorithms

"}, bioImg=null, bioContent=

born in 1999. Master. His main research interest includes design and analysis of symmetric cryptographic algorithms

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435610688893307, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610550481271, language=CN, stringName=周尔哲, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"MxagYlesfvEokvmLCPXuGQ==","content":"

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

"}, bioImg=MxagYlesfvEokvmLCPXuGQ==, bioContent=

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])])], keywords=[Keyword(id=1329435610781167996, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, orderNo=1, keyword=algebraic structure), Keyword(id=1329435610839888253, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, orderNo=2, keyword=automated analysis method), Keyword(id=1329435610911191422, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, orderNo=3, keyword=integral distinguisher), Keyword(id=1329435610982494591, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, orderNo=4, keyword=LLLWBC), Keyword(id=1329435611045409152, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, orderNo=5, keyword=key recovery), Keyword(id=1329435611112518017, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, orderNo=1, keyword=代数结构), Keyword(id=1329435611183821186, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, orderNo=2, keyword=自动化分析方法), Keyword(id=1329435611242541443, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, orderNo=3, keyword=积分区分器), Keyword(id=1329435611309650308, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, orderNo=4, keyword=LLLWBC), Keyword(id=1329435611368370565, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, orderNo=5, keyword=密钥恢复)], refs=[Reference(id=1329435612656021908, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=1, rfOrder=0, authorNames=null, journalName=null, refType=null, unstructuredReference=Zhang Lei, Wu Ruichen, Zhang Yuhan, et al. LLLWBC: A new low-latency light-weight block cipher[C]//Proc of the 19th Int Conf on Information Security and Cryptology. Berlin: Springer, 2023: 23−42, articleTitle=null, refAbstract=null), Reference(id=1329435612723130773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=2, rfOrder=1, authorNames=null, journalName=null, refType=null, unstructuredReference=Biham E, Shamir A. Differential cryptanalysis of DES-like cryptosystems[J]. Journal of Cryptology, 1991, 4(1): 3−72, articleTitle=null, refAbstract=null), Reference(id=1329435612790239638, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=3, rfOrder=2, authorNames=null, journalName=null, refType=null, unstructuredReference=Matsui M. Linear cryptanalysis method for DES cipher[C]//Proc of the 12th Workshop on the Theory and Application of Cryptographic Techniques. Berlin: Springer, 1993: 386−397, articleTitle=null, refAbstract=null), Reference(id=1329435612848959895, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=4, rfOrder=3, authorNames=null, journalName=null, refType=null, unstructuredReference=Demirci H, Selcuk A. A meet-in-the-middle attack on 8-round AES[C]//Proc of the 15th Int Workshop on Fast Software Encryption. Berlin: Springer, 2008: 116−126, articleTitle=null, refAbstract=null), Reference(id=1329435612907680152, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=5, rfOrder=4, authorNames=null, journalName=null, refType=null, unstructuredReference=Armknecht F, Krause M. Algebraic attacks on combiners with memory[C]//Proc of the 23rd Annual Int Cryptology Conf. Berlin: Springer, 2003: 162−175, articleTitle=null, refAbstract=null), Reference(id=1329435612987371929, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=6, rfOrder=5, authorNames=null, journalName=null, refType=null, unstructuredReference=Knudsen L, Wagner D. Integral cryptanalysis[C]//Proc of the 9th Int Workshop on Fast Software Encryption. Berlin: Springer, 2002: 112−127, articleTitle=null, refAbstract=null), Reference(id=1329435613058675098, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=7, rfOrder=6, authorNames=null, journalName=null, refType=null, unstructuredReference=Todo Y. Structural evaluation by generalized integral property[C]//Proc of the 34th Annual Int Conf on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2015: 287−314, articleTitle=null, refAbstract=null), Reference(id=1329435613129978267, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=8, rfOrder=7, authorNames=null, journalName=null, refType=null, unstructuredReference=Todo Y, Morii M. Bit-based division property and application to SIMON family[C]//Proc of the 23rd Int Conf on Fast Software Encryption. Berlin: Springer, 2016: 357−377, articleTitle=null, refAbstract=null), Reference(id=1329435613197087132, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=9, rfOrder=8, authorNames=null, journalName=null, refType=null, unstructuredReference=Xiang Zejun, Zhang Wentao, Bao Zhenzhen, et al. Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers[C]//Proc of the 23rd Int Conf on Fast Software Encryption. Berlin: Springer, 2016: 357−377, articleTitle=null, refAbstract=null), Reference(id=1329435613264195997, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=10, rfOrder=9, authorNames=null, journalName=null, refType=null, unstructuredReference=Hu Kai, Wang Meiqin. Automatic search for a variant of division property using three subsets[C]//Proc of the 19th Cryptographers’ Track at the RSA Conf. Berlin: Springer, 2019: 412−432, articleTitle=null, refAbstract=null), Reference(id=1329435613335499166, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=11, rfOrder=10, authorNames=null, journalName=null, refType=null, unstructuredReference=Hao Yonglin, Leader G, Meier W, et al. Modeling for three-subset division property without unknown subsets[C]//Proc of the 39th Annual Int Conf on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2020: 466−495, articleTitle=null, refAbstract=null), Reference(id=1329435613427773855, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=12, rfOrder=11, authorNames=null, journalName=null, refType=null, unstructuredReference=Hu Kai, Sun Siwei, Wang Meiqin, et al. An algebraic formulation of the division property: Revisiting degree evaluations, cube attacks, and key-independent sums[C]//Proc of the 26th Advances in Cryptology (ASIACRYPT 2020). Berlin: Springer, 2020: 446−476, articleTitle=null, refAbstract=null), Reference(id=1329435613503271328, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=13, rfOrder=12, authorNames=null, journalName=null, refType=null, unstructuredReference=Cui Jiamin, Hu Kai, Wang Qingju, et al. Integral attacks on Pyjamask-96 and round-reduced Pyjamask-128[C]//Proc of the 22nd Cryptographers’ Track at the RSA Conf. Berlin: Springer, 2022: 223−246, articleTitle=null, refAbstract=null), Reference(id=1329435613582963105, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=14, rfOrder=13, authorNames=null, journalName=null, refType=null, unstructuredReference=Chakraborty D. Finding three-subset division property for ciphers with complex linear layers[C]//Proc of the 23rd Progress in Cryptology (INDOCRYPT 2022). Berlin: Springer, 2023: 398−421, articleTitle=null, refAbstract=null), Reference(id=1329435613654266274, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=15, rfOrder=14, authorNames=null, journalName=null, refType=null, unstructuredReference=Zhang Wenying, Cao Meichun, Guo Jian, et al. Improved security evaluation of SPN block ciphers and its applications in the single-key attack on SKINNY[J]. IACR Transactions on Symmetric Cryptology, 2019, 2019(4): 171−191, articleTitle=null, refAbstract=null), Reference(id=1329435613742346659, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=16, rfOrder=15, authorNames=null, journalName=null, refType=null, unstructuredReference=叶涛, 韦永壮, 李灵琛. ACE密码算法的积分分析[J]. 电子与信息学报, 2021, 43(4): 908−914, articleTitle=null, refAbstract=null), Reference(id=1329435613826232740, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=16, rfOrder=16, authorNames=null, journalName=null, refType=null, unstructuredReference=Ye Tao, Wei Yongzhuang, Li Lingchen. Integral cryptanalysis of ACE encryption algorithm[J]. Journal of Electronics & Information Technology, 2021, 43(4): 908−914 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329435613884952997, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=17, rfOrder=17, authorNames=null, journalName=null, refType=null, unstructuredReference=邢朝辉, 张文英, 曹梅春. 基于代数结构视角对轻量分组密码WARP的积分分析[J]. 计算机研究与发展, 2023, 60(4): 860−872, articleTitle=null, refAbstract=null), Reference(id=1329435613985616294, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=17, rfOrder=18, authorNames=null, journalName=null, refType=null, unstructuredReference=Xing Zhaohui, Zhang Wenying, Cao Meichun. Integral cryptanalysis on lightweight block cipher WARP based on the algebraic structure perspective[J]. Journal of Computer Research and Development, 2023, 60(4): 860−872 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329435614065308071, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=18, rfOrder=19, authorNames=null, journalName=null, refType=null, unstructuredReference=Borghoff J, Canteaut A, Güneysu T, et al. PRINCE―A low-latency block cipher for pervasive computing applications[C]//Proc of the 32nd Workshop on the Theory and Application of Cryptographic Techniques. Berlin: Springer, 2012: 208−225, articleTitle=null, refAbstract=null)], funds=null, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609397047638, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=2, ext=[AuthorCompanyExt(id=1329435609405436247, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2State Key Laboratory of Cryptology Science and Technology, Beijing 100878), AuthorCompanyExt(id=1329435609418019160, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2密码科学技术国家重点实验室 北京 100878)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])], figs=[ArticleFig(id=1329435611485811078, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, label=Figure 1, caption=The r-th round function of LLLWBC$ (0\leq {r}\leq 21) $, figureFileSmall=tCtQlGifQwPdZXRt7ZZFsw==, figureFileBig=yVBEugoJNHLJAtbKrRorfQ==, tableContent=null), ArticleFig(id=1329435611557114247, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, label=图1, caption=LLLWBC的第r轮函数($ 0\leq {r}\leq 21 $), figureFileSmall=tCtQlGifQwPdZXRt7ZZFsw==, figureFileBig=yVBEugoJNHLJAtbKrRorfQ==, tableContent=null), ArticleFig(id=1329435611758440840, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, label=Figure 2, caption=T-function of LLLWBC algorithm, figureFileSmall=af6t9kO1sMTZlv4kvUJ6Iw==, figureFileBig=Dg7j9hIGxU2GMNajTmbf8g==, tableContent=null), ArticleFig(id=1329435611821355401, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, label=图2, caption=LLLWBC算法的T函数, figureFileSmall=af6t9kO1sMTZlv4kvUJ6Iw==, figureFileBig=Dg7j9hIGxU2GMNajTmbf8g==, tableContent=null), ArticleFig(id=1329435611892658570, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, label=Table 1, caption=

LLLWBC Integral Attack Compared with the Existing Results

, figureFileSmall=null, figureFileBig=null, tableContent=
攻击轮数活跃半字
节数量
平衡半字
节数量
时间
复杂度
数据
复杂度
存储
复杂度
结果来源
12136$ {2}^{122.09} $$ {2}^{56.17} $$ {2}^{72} $本文
8136$ {2}^{52} $文献[1]
), ArticleFig(id=1329435611972350347, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, label=表1, caption=

LLLWBC积分攻击与已有结果对比

, figureFileSmall=null, figureFileBig=null, tableContent=
攻击轮数活跃半字
节数量
平衡半字
节数量
时间
复杂度
数据
复杂度
存储
复杂度
结果来源
12136$ {2}^{122.09} $$ {2}^{56.17} $$ {2}^{72} $本文
8136$ {2}^{52} $文献[1]
), ArticleFig(id=1329435612035264908, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, label=Table 2, caption=

Symbolic Representation and Meaning

, figureFileSmall=null, figureFileBig=null, tableContent=
符号说明
$ k^{\mathrm{wb}} $预白化密钥
$ k^{\mathrm{we}} $后白化密钥
M明文
C密文
$ {{\boldsymbol{X}}}^{r-1} $第r轮的输入状态
$ {{\boldsymbol{Y}}}^{r-1} $定义解密方向第r轮的输入
$ x_{w}^{{r}} $第r轮输出状态的第w个字
$ (x_{w}^{0})_{k}^{r,{j}} $第k个出现在$ x_{j}^{r} $表达式中的变量$ x_{w}^{0} $
$ A_{j}^{r,w} $$ x_{w}^{0} $在$ x_{j}^{r} $的代数表达式中出现的次数
$ B_{j,k}^{r,w} $$ (x_{w}^{0})_{k}^{r,j} $经过运算得到$ x_{j}^{r} $需要经过的S盒的个数
$ {\boldsymbol{C}}^{r,w} $密文的第w个字$ y_{w}^{0} $经过r轮解密后,
内部状态$ {{\boldsymbol{Y}}}^{r} $表达式中出现的次数
$ {T}^{0,w}\rightarrow {T}^{1,w}\rightarrow … \rightarrow T^{r,w} $r轮的字传播轨迹
$ r_{w}^{\mathrm{e}} $加密方向第w个字活跃,
最长积分区分器的轮数
$ {\phi }^{w} $第w个字活跃,最长积分区分器
平衡字的下标集合
$ r_{w}^{\mathrm{d}} $解密方向第w个字未达到全扩散的最大轮数
$ {\varphi }^{w} $第w个字活跃,解密$ r_{w}^{\mathrm{d}} $轮
未扩散到的状态字的下标集合
$ {\boldsymbol{a}}^{r-1} $模型变量表示第r轮函数的输入
状态的值$ {\boldsymbol{X}}^{r-1} $是否能够被猜测确定
$ {{\boldsymbol{K}}}^{r-1} $模型变量表示第r轮轮函数中
使用的密钥$ {{\boldsymbol{k}}}^{r-1} $是否被猜测
$|| $2个向量的拼接
), ArticleFig(id=1329435612106568077, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, label=表2, caption=

符号表示与含义

, figureFileSmall=null, figureFileBig=null, tableContent=
符号说明
$ k^{\mathrm{wb}} $预白化密钥
$ k^{\mathrm{we}} $后白化密钥
M明文
C密文
$ {{\boldsymbol{X}}}^{r-1} $第r轮的输入状态
$ {{\boldsymbol{Y}}}^{r-1} $定义解密方向第r轮的输入
$ x_{w}^{{r}} $第r轮输出状态的第w个字
$ (x_{w}^{0})_{k}^{r,{j}} $第k个出现在$ x_{j}^{r} $表达式中的变量$ x_{w}^{0} $
$ A_{j}^{r,w} $$ x_{w}^{0} $在$ x_{j}^{r} $的代数表达式中出现的次数
$ B_{j,k}^{r,w} $$ (x_{w}^{0})_{k}^{r,j} $经过运算得到$ x_{j}^{r} $需要经过的S盒的个数
$ {\boldsymbol{C}}^{r,w} $密文的第w个字$ y_{w}^{0} $经过r轮解密后,
内部状态$ {{\boldsymbol{Y}}}^{r} $表达式中出现的次数
$ {T}^{0,w}\rightarrow {T}^{1,w}\rightarrow … \rightarrow T^{r,w} $r轮的字传播轨迹
$ r_{w}^{\mathrm{e}} $加密方向第w个字活跃,
最长积分区分器的轮数
$ {\phi }^{w} $第w个字活跃,最长积分区分器
平衡字的下标集合
$ r_{w}^{\mathrm{d}} $解密方向第w个字未达到全扩散的最大轮数
$ {\varphi }^{w} $第w个字活跃,解密$ r_{w}^{\mathrm{d}} $轮
未扩散到的状态字的下标集合
$ {\boldsymbol{a}}^{r-1} $模型变量表示第r轮函数的输入
状态的值$ {\boldsymbol{X}}^{r-1} $是否能够被猜测确定
$ {{\boldsymbol{K}}}^{r-1} $模型变量表示第r轮轮函数中
使用的密钥$ {{\boldsymbol{k}}}^{r-1} $是否被猜测
$|| $2个向量的拼接
), ArticleFig(id=1329435612198842766, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, label=Table 3, caption=

Substitution P and Reverse Substitution $ {{\boldsymbol{P}}}^{-1} $ of LLLWBC

, figureFileSmall=null, figureFileBig=null, tableContent=
$ i $$ P(i) $$ {P}^{-1}(i) $$ i $$ P(i) $$ {P}^{-1}(i) $
0268153
171191115
21201044
38121119
410101232
514713614
601314135
7511598
), ArticleFig(id=1329435612270145935, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, label=表3, caption=

LLLWBC的置换P及逆置换$ {{\boldsymbol{P}}}^{-1} $

, figureFileSmall=null, figureFileBig=null, tableContent=
$ i $$ P(i) $$ {P}^{-1}(i) $$ i $$ P(i) $$ {P}^{-1}(i) $
0268153
171191115
21201044
38121119
410101232
514713614
601314135
7511598
), ArticleFig(id=1329435612341449104, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, label=Table 4, caption=

Values of $ w $, $ r_{{w}}^{\mathrm{d}} $, $ \varphi ^{w} $, $ r_{{w}}^{\mathrm{e}} $ and $ {\phi }^{{w}} $

, figureFileSmall=null, figureFileBig=null, tableContent=
$ {w}^{} $$ r_{{w}}^{\mathrm{d}} $$ \varphi ^{w} $$ r_{{w}}^{\mathrm{e}} $$ {\phi }^{w} $
24{2,3,14}5{2,3,6,11,14,15}
34{6,7,10}5{2,3,6,11,14,15}
64{2,14,15}5{2,3,7,10,14,15}
74{7,10,11}5{2,3,7,10,14,15}
104{6,7,10}5{3,6,7,10,11,15}
114{2,3,15}5{3,6,7,10,11,15}
144{3,14,15}5{2,6,7,10,11,14}
154{6,10,11}5{2,6,7,10,11,14}
), ArticleFig(id=1329435612412752273, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, label=表4, caption=

$ w $,$ r_{{w}}^{\mathrm{d}} $,$ \varphi ^{w} $,$ r_{{w}}^{\mathrm{e}} $,$ {\phi }^{{w}} $的值

, figureFileSmall=null, figureFileBig=null, tableContent=
$ {w}^{} $$ r_{{w}}^{\mathrm{d}} $$ \varphi ^{w} $$ r_{{w}}^{\mathrm{e}} $$ {\phi }^{w} $
24{2,3,14}5{2,3,6,11,14,15}
34{6,7,10}5{2,3,6,11,14,15}
64{2,14,15}5{2,3,7,10,14,15}
74{7,10,11}5{2,3,7,10,14,15}
104{6,7,10}5{3,6,7,10,11,15}
114{2,3,15}5{3,6,7,10,11,15}
144{3,14,15}5{2,6,7,10,11,14}
154{6,10,11}5{2,6,7,10,11,14}
), ArticleFig(id=1329435612479861138, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=EN, label=Table 5, caption=

The 9-Round Integral Distinguisher of LLLWBC Algorithm

, figureFileSmall=null, figureFileBig=null, tableContent=
w输入形式输出形式
2$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4} $
3$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4} $
6$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4} $
7$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4} $
10$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4} $
11$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4} $
14$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4} $
15$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4} $
), ArticleFig(id=1329435612546970003, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, language=CN, label=表5, caption=

LLLWBC算法的9轮积分区分器

, figureFileSmall=null, figureFileBig=null, tableContent=
w输入形式输出形式
2$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4} $
3$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4} $
6$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4} $
7$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4} $
10$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4} $
11$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4} $
14$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4} $
15$ {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4} $$ {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4} $
)], attaches=null, journal=Journal(id=1324759606947315908, delFlag=0, nameCn=计算机研究与发展, nameEn=Journal of Computer Research and Development, nameHistory1=null, nameHistory2=null, issn=1000-1239, eissn=null, cn=11-1777/TP, coden=null, periodic=0, language=CN, oaType=null, ccby=null, superviseOffice=null, ownerOffice=null, pubOffice=null, editorOffice=null, officeType=null, aims=null, clcCode=null, officeProv=null, officeCity=null, officeAddr=null, officeZip=null, officeEmail=null, officePhone=null, editDirector=null, officeDirector=null, officeDirectorPhone=null, officeStaffNum=null, officeEmpNum=null, coverPicUrl=k2l8zgqwstuxxevFX2qxVA==, journalPrice=null, startedYear=null, abbrevIsoEn=Journal of Computer Research and Development, journalRemark=null, publicationField=null, createdTime=1793776903141, updatedTime=1793850698612, createdBy=18614031015, updatedBy=13701087609, firstLetterCn=J, firstLetterEn=J, subjectCode=Electronic Information, subjectName=null, subjectCodeEn=Electronic Information, subjectNameEn=null, picCn=k2l8zgqwstuxxevFX2qxVA==, picEn=r6k0Ry+RD+c/VXj5QarmDw==, jcr=null, cjcr=null, exts=[JournalExt(id=1325069127710286688, language=CN, name=计算机研究与发展, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=, createdTime=1793850698640, updatedTime=1793850698640, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=https://crad.ict.ac.cn/journalx/authorLogOn.action, submissionEditorUrl=https://crad.ict.ac.cn/journalx/editorLogOn.action, submissionReviewUrl=https://crad.ict.ac.cn/journalx/expertLogOn.action, submissionCeEditorUrl=https://crad.ict.ac.cn/journalx/editorInChiefLogOn.action, submissionAeEditorUrl=, option={"copyright":""}), JournalExt(id=1325069127777395553, language=EN, name=Journal of Computer Research and Development, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=, createdTime=1793850698656, updatedTime=1793850698656, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=https://crad.ict.ac.cn/journalx/authorLogOn.action, submissionEditorUrl=https://crad.ict.ac.cn/journalx/editorLogOn.action, submissionReviewUrl=https://crad.ict.ac.cn/journalx/expertLogOn.action, submissionCeEditorUrl=https://crad.ict.ac.cn/journalx/editorInChiefLogOn.action, submissionAeEditorUrl=, option={"copyright":""})], databaseList=null, tenantJournalId=1324759914146529478, websiteList=[Website(id=1325070300139892771, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1324759914146529478, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN, language=CN, createTime=1793850978169, createBy=18614031015, updateTime=1793851040259, updateBy=18614031015, name=计算机研究与发展-中文, tplId=1146099689490845704, title=计算机研究与发展, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1325070893751349360, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=articleTextType, value=kx, createTime=1793851119697, updateTime=1793851119697, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893730377837, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=banner, value=null, createTime=1793851119692, updateTime=1793851119692, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893772320883, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=grayFlag, value=0, createTime=1793851119702, updateTime=1793851119702, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893721989228, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=logo, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/file/pic?fileId=U27tDsy717YF7XSPA+Vwdw==, createTime=1793851119690, updateTime=1793851119690, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893784903797, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=minRunFlag, value=0, createTime=1793851119705, updateTime=1793851119705, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893742960751, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/file/pic, createTime=1793851119695, updateTime=1793851119695, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893780709492, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=silenceFlag, value=0, createTime=1793851119704, updateTime=1793851119704, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893738766446, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_cn_619/, createTime=1793851119694, updateTime=1793851119694, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893755543665, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=themeColor, value=null, createTime=1793851119698, updateTime=1793851119698, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893763932274, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=themeStyle, value=null, createTime=1793851119700, updateTime=1793851119700, creator=18614031015, updator=18614031015)]), Website(id=1325070300580294698, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1324759914146529478, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN, language=EN, createTime=1793850978274, createBy=18614031015, updateTime=1793851036638, updateBy=18614031015, name=计算机研究与发展-英文, tplId=1146101810881728533, title=Journal of Computer Research and Development, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1325070925288321148, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=articleTextType, value=kx, createTime=1793851127216, updateTime=1793851127216, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925263155321, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=banner, value=null, createTime=1793851127210, updateTime=1793851127210, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925309292671, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=grayFlag, value=0, createTime=1793851127221, updateTime=1793851127221, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925254766712, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=logo, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/file/pic?fileId=U27tDsy717YF7XSPA+Vwdw==, createTime=1793851127208, updateTime=1793851127208, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925326069889, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=minRunFlag, value=0, createTime=1793851127225, updateTime=1793851127225, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925279932539, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/file/pic, createTime=1793851127214, updateTime=1793851127214, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925317681280, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=silenceFlag, value=0, createTime=1793851127223, updateTime=1793851127223, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925271543930, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_en_623/, createTime=1793851127212, updateTime=1793851127212, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925292515453, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=themeColor, value=null, createTime=1793851127217, updateTime=1793851127217, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925300904062, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=themeStyle, value=null, createTime=1793851127219, updateTime=1793851127219, creator=18614031015, updator=18614031015)])], journalTitle=计算机研究与发展, weixinUrl=null, journalUrl=https://crad.ict.ac.cn/, iacademicId=null, status=1, seqNo=null, journalTitleEn=Journal of Computer Research and Development, journalPhotoCn=k2l8zgqwstuxxevFX2qxVA==, journalPhotoEn=r6k0Ry+RD+c/VXj5QarmDw==, journalFirstLetter=J, journalRecommend=null, journalNew=null, journalCollection=null, jcrJf=null, cjcrJf=null, jcrJfStr=null, cjcrJfStr=null, submissionFirstDecision=null, sciSubjectClassification=null, casSubjectClassification=null, citeScore=null, totalCitationFrequency=null, icpCode=null, psCode=null, advertisingLicenseCode=null, copyrightInformation=null, country=null, option=, provinceCode=null, provinceName=null, collectFlag=false, interPubPlatform=, interPubPlatformUrl=null), detailUrlCn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/10.7544/issn1000-1239.202550746, detailUrlEn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/10.7544/issn1000-1239.202550746, pdfUrlCn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/PDF/10.7544/issn1000-1239.202550746, pdfUrlEn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/PDF/10.7544/issn1000-1239.202550746, aliStartDate=0, aliEndDate=0, collectionFlag=false, citedCount=null, citedUrl=null, previewStatus=0, delFlag=0, hasFullText=1, orderTime=1793462400000, fullTextJson=null, articleText=null, reference=null)
收藏切换
基于代数结构的LLLWBC积分攻击
叶涛 1, 2, 3 , 焦留洋 1, 3 , 韦永壮 1, 2, 3, * , 李灵琛 1, 3 , 周尔哲 1, 3
计算机研究与发展 | 网络与信息安全 2026,63(11): 2856-2870
收起
收藏切换
计算机研究与发展 |网络与信息安全 2026 , 63 (11) : 2856 -2870
基于代数结构的LLLWBC积分攻击
全屏
[Author(id=1329435609589985629, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=0, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=fendouyetao@163.com, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329435609720009057, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435609589985629, language=EN, stringName=Tao Ye, firstName=Tao, middleName=null, lastName=Ye, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, 3, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
2State Key Laboratory of Cryptology Science and Technology, Beijing 100878
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1991. PhD, lecturer, master supervisor. His main research interest includes design and analysis of symmetric cryptographic algorithms

"}, bioImg=null, bioContent=

born in 1991. PhD, lecturer, master supervisor. His main research interest includes design and analysis of symmetric cryptographic algorithms

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435609791312226, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435609589985629, language=CN, stringName=叶涛, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, 3, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
2密码科学技术国家重点实验室 北京 100878
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"6e/jFjikQ5cR4ox+vIC6hA==","content":"

1991年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

"}, bioImg=6e/jFjikQ5cR4ox+vIC6hA==, bioContent=

1991年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609397047638, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=2, ext=[AuthorCompanyExt(id=1329435609405436247, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2State Key Laboratory of Cryptology Science and Technology, Beijing 100878), AuthorCompanyExt(id=1329435609418019160, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2密码科学技术国家重点实验室 北京 100878)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])]), Author(id=1329435609875198308, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=1, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329435609967472999, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435609875198308, language=EN, stringName=Liuyang Jiao, firstName=Liuyang, middleName=null, lastName=Jiao, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1999. Master. Her main research interest includes design and analysis of symmetric cryptographic algorithms

"}, bioImg=null, bioContent=

born in 1999. Master. Her main research interest includes design and analysis of symmetric cryptographic algorithms

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435610038776168, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435609875198308, language=CN, stringName=焦留洋, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"jd9XPLC96fxKt32Yd5yZUQ==","content":"

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

"}, bioImg=jd9XPLC96fxKt32Yd5yZUQ==, bioContent=

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])]), Author(id=1329435610118467946, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=2, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=walker_wyz@guet.edu.cn, emailSecond=null, emailThird=null, correspondingAuthor=1, authorType=1, ext={EN=AuthorExt(id=1329435610210742638, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610118467946, language=EN, stringName=Yongzhuang Wei, firstName=Yongzhuang, middleName=null, lastName=Wei, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, 3, *, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
2State Key Laboratory of Cryptology Science and Technology, Beijing 100878
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1976. PhD, professor, PhD supervisor. His main research interests include the design of symmetric cryptographic algorithms, intelligent analysis of cryptographic algorithms, and side-channel cryptanalysis

"}, bioImg=null, bioContent=

born in 1976. PhD, professor, PhD supervisor. His main research interests include the design of symmetric cryptographic algorithms, intelligent analysis of cryptographic algorithms, and side-channel cryptanalysis

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435610282045807, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610118467946, language=CN, stringName=韦永壮, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, 3, *, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
2密码科学技术国家重点实验室 北京 100878
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"6rlYaXcIwRoZ658IrXIzOw==","content":"

1976年生。博士,教授,博士生导师。主要研究方向为对称密码算法的设计、密码算法智能化分析、侧信道密码分析

"}, bioImg=6rlYaXcIwRoZ658IrXIzOw==, bioContent=

1976年生。博士,教授,博士生导师。主要研究方向为对称密码算法的设计、密码算法智能化分析、侧信道密码分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609397047638, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=2, ext=[AuthorCompanyExt(id=1329435609405436247, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2State Key Laboratory of Cryptology Science and Technology, Beijing 100878), AuthorCompanyExt(id=1329435609418019160, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609397047638, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2密码科学技术国家重点实验室 北京 100878)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])]), Author(id=1329435610349154673, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=3, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329435610428846452, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610349154673, language=EN, stringName=Lingchen Li, firstName=Lingchen, middleName=null, lastName=Li, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1988. PhD, lecturer, master supervisor. Her main research interest includes design and analysis of symmetric cryptographic algorithms

"}, bioImg=null, bioContent=

born in 1988. PhD, lecturer, master supervisor. Her main research interest includes design and analysis of symmetric cryptographic algorithms

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435610491761013, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610349154673, language=CN, stringName=李灵琛, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"g33unAEk6Gn36vkNG4F3Jg==","content":"

1988年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

"}, bioImg=g33unAEk6Gn36vkNG4F3Jg==, bioContent=

1988年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])]), Author(id=1329435610550481271, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, orderNo=4, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329435610621784442, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610550481271, language=EN, stringName=Erzhe Zhou, firstName=Erzhe, middleName=null, lastName=Zhou, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004, bio={"content":"

born in 1999. Master. His main research interest includes design and analysis of symmetric cryptographic algorithms

"}, bioImg=null, bioContent=

born in 1999. Master. His main research interest includes design and analysis of symmetric cryptographic algorithms

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329435610688893307, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, authorId=1329435610550481271, language=CN, stringName=周尔哲, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 3, address=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004, bio={"img":"MxagYlesfvEokvmLCPXuGQ==","content":"

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

"}, bioImg=MxagYlesfvEokvmLCPXuGQ==, bioContent=

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329435609308967251, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=1, ext=[AuthorCompanyExt(id=1329435609317355860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609329938773, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609308967251, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1桂林电子科技大学计算机与信息安全学院 广西桂林 541004)]), AuthorCompany(id=1329435609497710937, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, xref=3, ext=[AuthorCompanyExt(id=1329435609506099546, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004), AuthorCompanyExt(id=1329435609514488155, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329435607421530434, companyId=1329435609497710937, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004)])])]
叶涛1, 2, 3 , 焦留洋1, 3, 韦永壮1, 2, 3, * , 李灵琛1, 3, 周尔哲1, 3
作者信息
  • 1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
  • 2密码科学技术国家重点实验室 北京 100878
  • 3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004
通讯作者:
韦永壮()
作者简介:

作者贡献声明

叶涛、韦永壮负责方案整体设计并撰写论文;焦留洋和周尔哲负责算法思路和实验方法;李灵琛提出指导意见并修改论文。

1991年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

1976年生。博士,教授,博士生导师。主要研究方向为对称密码算法的设计、密码算法智能化分析、侧信道密码分析

1988年生。博士,讲师,硕士生导师。主要研究方向为对称密码算法的设计与分析

1999年生。硕士。主要研究方向为对称密码算法的设计与分析

Integral Attack for LLLWBC Based on Algebraic Structure
Tao Ye1, 2, 3 , Liuyang Jiao1, 3, Yongzhuang Wei1, 2, 3, * , Lingchen Li1, 3, Erzhe Zhou1, 3
Affiliations
  • 1School of Computer and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004
  • 2State Key Laboratory of Cryptology Science and Technology, Beijing 100878
  • 3Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004
  • born in 1991. PhD, lecturer, master supervisor. His main research interest includes design and analysis of symmetric cryptographic algorithms

    born in 1999. Master. Her main research interest includes design and analysis of symmetric cryptographic algorithms

    born in 1976. PhD, professor, PhD supervisor. His main research interests include the design of symmetric cryptographic algorithms, intelligent analysis of cryptographic algorithms, and side-channel cryptanalysis

    born in 1988. PhD, lecturer, master supervisor. Her main research interest includes design and analysis of symmetric cryptographic algorithms

    born in 1999. Master. His main research interest includes design and analysis of symmetric cryptographic algorithms

出版时间: 2026-11-01 doi: 10.7544/issn1000-1239.202550746
文章导航
收藏切换

轻量级分组密码算法的自动化分析技术是近些年研究的热点内容。LLLWBC算法是在Inscrypt 2022会议上提出的新型低延迟轻量级分组密码算法,其在软件和硬件实现上具有非常优秀的加解密性能。然而,针对一些新的安全性分析技术,LLLWBC算法是否安全还需要进一步研究。提出分组密码算法新的字传播轨迹构造技术,给出了7种不同布尔代数结构的自动化检测方法,并基于代数结构给出了积分区分器的自动化搜索方法。同时,研究了积分攻击密钥恢复过程中密钥猜测轨迹的构造方法,该方法能够自动地搜索到最优的密钥猜测集合。利用上述方法,构造了LLLWBC算法9轮的积分区分器,需要的数据复杂度为$ {2}^{52} $个LLLWBC明文分组,相比之前的积分区分器轮数增加1。随后,利用得到的9轮积分区分器,能够对12轮的LLLWBC算法进行密钥恢复攻击,该攻击需要的数据复杂度为$ {2}^{56.17} $个64b明文数据,存储复杂度为$ {2}^{72} $个128b的猜测密钥和$ {2}^{52} $个64b的密文数据,时间复杂度为$ {2}^{122.09} $次12轮加密操作。实验结果表明:12轮的LLLWBC算法无法抵抗积分攻击,全轮为21轮的LLLWBC算法仍然具有足够的安全冗余。提出的积分区分器构造方法和密钥恢复方法同样适用于其他基于字运算的密码算法。

代数结构  /  自动化分析方法  /  积分区分器  /  LLLWBC  /  密钥恢复

Automated analysis techniques for lightweight block cipher algorithms have been a hot topic in recent research. The LLLWBC algorithm, proposed at the Inscrypt 2022 conference, is a novel low-latency lightweight block cipher that demonstrates excellent encryption and decryption performance in both software and hardware implementations. However, its security against emerging cryptanalytic techniques requires further investigation. In this paper, a new technique for constructing word-based propagation trails in block cipher algorithms is introduced, an automated detection method for seven distinct algebraic structures is proposed, then an automated search approach for integral distinguishers is also proposed based on these algebraic structures. Furthermore, the construction method for key guessing trails during the key recovery process of integral attacks is investigated, and the optimal key guessing set can be obtained by using this method. Based on the proposed method, we construct a 9-round integral distinguisher for LLLWBC with a data complexity of $ {2}^{52} $ plaintext blocks, which are one round longer than the distinguishers given by the designers. Subsequently, based on the obtained 9-round integral distinguisher, a 12-round key-recovery attack of LLLWBC is proposed, which requires the data complexity of about $ {2}^{56.17} $ chosen data, the memory complexity of about $ {2}^{72} $ 128b guess key and $ {2}^{52} $ 64b ciphertexts, the time complexity of about $ {2}^{122.09} $ times encryptions of 12-round LLLWBC. Experimental results demonstrate that the 12-round LLLWBC algorithm is vulnerable to integral attacks, while the full 21-round LLLWBC maintains a sufficient security margin. The construction method of integral distinguisher and key recovery technique proposed in this paper can also be applied to other word-oriented block ciphers.

algebraic structure  /  automated analysis method  /  integral distinguisher  /  LLLWBC  /  key recovery
叶涛, 焦留洋, 韦永壮, 李灵琛, 周尔哲. 基于代数结构的LLLWBC积分攻击. 计算机研究与发展, 2026 , 63 (11) : 2856 -2870 . DOI: 10.7544/issn1000-1239.202550746
Tao Ye, Liuyang Jiao, Yongzhuang Wei, Lingchen Li, Erzhe Zhou. Integral Attack for LLLWBC Based on Algebraic Structure[J]. Journal of Computer Research and Development, 2026 , 63 (11) : 2856 -2870 . DOI: 10.7544/issn1000-1239.202550746
分组密码算法具有加解密速度快、安全性高以及易于标准化的特点,对于保证信息的机密性和完整性等方面发挥着非常重要的作用。然而,随着物联网、RFID以及无线通信技术的快速进步,一方面,其面临的信息安全问题越发突出;另一方面,这些应用环境除了具有硬件资源有限的特点,有时还需要具有低延迟的优势。针对这样的需求,具有低延迟优势的分组密码算法的设计成为了近些年研究的热点内容,最近提出了多种不同类型的低延迟分组密码算法,如PRINCE,MANTIS,QARMA等。在此基础上,Zhang等人[1]提出了新型的低延迟轻量级分组密码算法——LLLWBC。
对于设计完成的轻量级密码算法,需要评估其安全性,包括差分密码分析[2]、线性密码分析[3]、中间相遇攻击[4]、代数攻击[5]以及积分攻击[6]等。其中,由于可分性的提出,利用可分性结合自动化分析工具,搜索密码算法的积分区分器成为了近些年研究的热点内容。然而,随着攻击轮数的增加,基于可分性的分析模型规模逐渐增大,求解需要消耗的时间也呈现指数增加。如何更快速高效地搜索积分区分器,并给出密钥恢复过程最优的密钥猜测集合,这些是迫切需要解决的问题。
积分分析最初是由Knudsen等人[6]为了评估Square算法的安全性提出的分析方法,通过选取合适的明文活跃比特和常数比特构建相应的数据集,然后对这个数据集进行加密,如果得到的密文集合中一些位置的异或和恒定为0,且这个性质与密钥的选取无关,则攻击者得到了一个积分区分器。
积分区分器的构建方法主要包括2种:第1种主要是利用代数性质构建积分区分器,即评估密码算法输出对应的代数表达式的代数次数,通过代数次数确定积分区分器的形式,这种方法随着可分性的提出被深入研究。可分性最初是由Todo[7]在2015年的欧密会上提出的一种广义的积分性质,在此基础上,Todo等人[8]提出了比特可分性。为了进一步加速构建积分区分器的效率,Xiang等人[9]给出了可分性传播的MILP模型以及积分区分器的自动化搜索方法。随后,为了进一步提高攻击的轮数,三子集可分性[10]、无未知结合的三子集可分性[11]和单项式预测技术[12]先后被提出,并被应用于积分区分器的搜索[10-14]。然而,这些方法非常精细地构建了密码算法轮函数的分析模型,尤其是对于大状态的密码算法,随着攻击轮数的增加,比特级可分性的描述需要大量不等式,模型求解的效率将大幅度降低。第2种构建积分区分器的方法是利用积分性质的传播规则,主要是利用活跃字节、常数字节和平衡字节之间的转化关系,这种方法通常只考虑字节或者半字节的传播轨迹。在此基础上,基于置换函数的性质,Zhang等人[15]通过统计明文字或者密文字在内部状态的表达式中出现的次数,评估密码算法抵抗积分攻击的能力。在此基础上,叶涛等人[16]引入了字传播轨迹的概念,并给出了字传播轨迹的自动化分析模型。随后,邢朝辉等人[17]给出了利用代数结构构造积分区分器的框架,并基于差分分布表的性质,给出了一种存在积分性质的新代数结构,并将其应用于对WARP算法的安全性分析。
本文提出了一种密码算法代数结构的新型自动化分析技术。首先,在搜索密码算法代数结构的过程中,一方面考虑了明文字在中间状态中出现的次数,另一方面也研究了每个明文字的分量运算至对应的密文字需要经过的S盒的个数,我们针对这2方面提出了新的字传播轨迹概念,给出了自动化检测代数结构的方法。同时,基于得到的代数结构给出了积分区分器的具体形式。然后,在构造的积分区分器的基础上,基于轮函数结构与密钥编排原理,进一步设计了密钥恢复的自动化建模流程,将最优密钥猜测路径转化为MILP问题,通过求解模型得到最优的密钥猜测集合,实现了积分区分器到密钥恢复的自动衔接。
利用这个方法,本文对LLLWBC抵抗积分攻击的能力进行评估,构造了LLLWBC的9轮积分区分器,并给出了12轮的密钥恢复攻击,数据复杂度为$ {2}^{56.17} $个64b明文数据,时间复杂度为$ {2}^{122.09} $次12轮加密,存储复杂度为$ {2}^{72} $个128b的密钥和$ {2}^{52} $个64b的密文数据,与其他文献的对比见表1。
为清晰表述算法结构与攻击过程,同时确保符号使用的规范性与一致性,本文预先对核心符号、变量及数学约定在表2中进行了集中说明,相关定义将贯穿全文。
LLLWBC算法[1]采用64b分组长度和128b密钥长度,记作LLLWBC-64/128,其轮函数结构为扩展广义Feistel结构(GFS),共迭代21轮。LLLWBC包括密钥调度算法、加密算法和解密算法3部分,且加密和解密算法结构相同,算法轮函数的具体结构如图1所示。因此,下面仅介绍LLLWBC算法的密钥生成算法和加密算法。
1)密钥生成算法。LLLWBC的主密钥是128b,用于生成2个64b的白化密钥和21个32b的轮密钥。
首先,128b的主密钥k被分为2个64b的部分,$ k={k}^{\mathrm{W}}\|{k}^{\mathrm{e}}=\{{k}_{0},{k}_{1},… ,{k}_{15}\|{k}_{16},{k}_{17},… ,{k}_{31}\} $,$ {k}_{i}\in {F}_{2}^{4} $,$ 0\leq {i}\leq 31 $,定义左面为高位。预白化密钥和后白化密钥使用符号$ k^{\mathrm{wb}} $和$ k^{\mathrm{we}} $,其生成方式为:
$ k^{\mathrm{wb}}={k}^{\mathrm{W}}, $
$ k^{\mathrm{we}}=({k}^{\mathrm{W}} \ggg 1)\oplus ({k}^{\mathrm{W}} \gg 63)\;。 $
对于奇数轮$ {r=}1,3,… ,21 $,$ {k}^{\mathrm{e}} $的高32位与对应的轮常数异或后生成第r轮的子密钥$ {k}^{r-1} $;对于偶数轮$ r=2,4,\,… ,20 $,$ {k}^{\mathrm{e}} $的低32位与相应的轮常数$ c{k}^{r} $异或运算后生成第r轮子密钥$ {k}^{r-1} $。轮常数的具体细节请参考文献[1]。
2)加密算法。令M和C分别表示为64b明文和密文, $ {{\boldsymbol{X}}}^{r}= (x_{0}^{r-1}, x_{1}^{r-1},… ,x_{15}^{r-1}) $表示第r轮函数的输入状态,其中$ x_{i}^{r-1}\in {F}_{2}^{4} $,$ 0\leq {i}\leq 15 $。第r轮的子密钥为$ {{\boldsymbol{k}}}^{r-1}= (k_{0}^{r-1},\;k_{1}^{r-1},\;k_{2}^{r-1},\; k_{3}^{r-1}) $ = $(k_{0,0}^{r-1}\|k_{0,1}^{r-1},\;k_{1,0}^{r-1}\|k_{1,1}^{r-1},\;k_{2,0}^{r-1} $$ \|k_{2,1}^{r-1},\;k_{3,0}^{r-1}\| k_{3,1}^{r-1}) $,$ k_{{i}}^{r-1}\in {F}_{2}^{8} $,$ {k}_{i,j} \in {F}_{2}^{4} $,$ 1\leq {r}\leq 21 $,$ 0\leq {i}\leq 3 $,$ 0\leq j\leq 1 $,则LLLWBC的加密过程可以用算法1表示。
算法1. LLLWBC的加密过程。
输入:分组密码算法的明文$ M $,预白化密钥$ k^{\mathrm{wb}} $,轮密钥$ ({k}_{0}^{r-1}\| {k}_{1}^{r-1}\| {k}_{2}^{r-1}\| {k}_{3}^{r-1} ) $,$ 1\leq {r}\leq 21 $;
输出:密文$ ({x}_{0}^{21},{x}_{1}^{21},… ,{x}_{15}^{21} ) $。
① $ M\oplus k^{\mathrm{wb}}=x_{0}^{0}\|x_{1}^{0}\|… \|x_{15}^{0} $;
② for $ 1\leq {r}\leq 10 $ do
③  $ x_{0}^{r},… ,x_{15}^{r}=P(x_{0}^{r-1},x_{1}^{r-1},F((x_{0}^{r-1}\|x_{1}^{r-1})\oplus K_{0}^{r-1}) \oplus$$ (x_{2}^{r-1}\|x_{3}^{r-1}),… ,x_{12}^{r-1},x_{13}^{r-1},F((x_{12}^{r-1}\|x_{13}^{r-1})\oplus K_{3}^{r-1}) \oplus $$(x_{14}^{r-1}\|x_{15}^{r-1})); $
④ end for
⑤ for $ 11\leq {r}\leq 20 $ do
⑥  $ x_{0}^{r},… ,x_{15}^{r}={P}^{-1}(x_{0}^{r-1},x_{1}^{r-1},F((x_{0}^{r-1}\|x_{1}^{r-1})\oplus K_{0}^{r-1})\oplus$$ (x_{2}^{r-1}\|x_{3}^{r-1}),… ,x_{12}^{r-1},x_{13}^{r-1},F((x_{12}^{r-1}\|x_{13}^{r-1}) \oplus $$K_{3}^{r-1})\oplus (x_{14}^{r-1}\|x_{15}^{r-1})) $;
⑦ end for
⑧ $ x_{0}^{r},x_{1}^{r},… ,x_{15}^{r}=x_{0}^{r-1},x_{1}^{r-1},F((x_{0}^{r-1}\|x_{1}^{r-1})\oplus K_{0}^{r-1}) \oplus$$ (x_{2}^{r-1}\|x_{3}^{r-1}),… ,x_{12}^{r-1},x_{13}^{r-1},F((x_{12}^{r-1}\|x_{13}^{r-1})\oplus K_{3}^{r-1} ) \oplus $$ (x_{14}^{r-1}\|x_{15}^{r-1}) $;
⑨ $ C=(x_{0}^{21}\|x_{1}^{21}\|… \|x_{15}^{21})\oplus k^{\mathrm{we}} $;
⑩ return C。
算法1中,置换操作P及逆置换$ {P}^{-1} $如表3所示。
算法1中,F函数的计算方式为:
$ \begin{aligned}& {F}\colon {\left\{0,1\right\}}^{8}\rightarrow {\left\{0,1\right\}}^{8}\;,\\& \left({u}_{0},{u}_{1}\right)\rightarrow S\left(\boldsymbol{A}\left(S\left({u}_{0},{u}_{1}\right)\right)\right)\;,\end{aligned} $
其中S为PRINCE算法[18]的4b密码S盒,线性层A由$ GF ({2}^{4} ) $上的2×2 MDS矩阵组成,使用的不可约多项式是$ {x}^{4}+x+1 $。具体的运算为:
$ {\boldsymbol{A}}: {\{0,1\}}^{8}\rightarrow {\{0,1\}}^{8}\;,$
$ \left({u}_{0},{u}_{1}\right)\rightarrow \left(\begin{array}{l}0\text{x2}\;\;\;0\text{x3}\\0\text{x1}\;\;\;0\text{x1}\end{array}\right)\left(\begin{array}{l}{u}_{0}\\{u}_{1}\end{array}\right)\;。 $
在文献[15]中,提出了一种利用代数结构构造SPN结构的分组密码积分区分器的方法,其核心思想是通过将中间状态字表示为明文字或者密文字的代数表达式,并通过统计这些中间状态字在多项式中出现的次数,搜索密码算法中存在的置换函数,利用置换函数的性质,攻击者可以评估算法抵抗积分攻击的能力。置换函数的性质如下:
性质1. 若$ {F}\colon {\{0,1\}}^{b}\rightarrow {\{0,1\}}^{b} $是置换函数(即每个输入唯一对应1个输出,且所有输出均被覆盖),且$ {f}\colon {\{0,1\}}^{b}\rightarrow {\{0,1\}}^{b} $是任意布尔函数,则以下结论一定成立:
$ \mathop{\oplus }\limits_{\begin{subarray}{l} y\in {F}_{2}^{b},\\x遍历{F}_{2}^{b}\end{subarray}}{F}(x\oplus f(y))=0 \;。 $
性质2. 设$ {S}_{i}(x) $是$ {F}_{2}^{^{b}} $上的置换,$ i=0,1,… , $$ n-1 $,$ {{c}}_{{i}} $为常数,则$ {S}_{n-1}(… {S}_{1}({S}_{0}(x\oplus {c}_{0})\oplus {c}_{1})\oplus … \oplus $$ {c}_{n-1}) $也是关于x在$ {F}_{2}^{b} $上的一个置换,根据置换函数的性质可得:
$ \underset{x\in {F}_{2}^{b}}{\oplus }{S}_{n-1}(… {S}_{1}({S}_{0}(x\oplus {c}_{0})\oplus {c}_{1}\oplus … \oplus {c}_{n-1}))=0 \;。 $
基于上述性质,文献[15]中给出了积分区分器的构造方法,在加密方向上计算明文中的第i个字达到全扩散的轮数,且此时至少存在1个输出字对应的表达式中第i个字仅出现1次,此时对应的轮数定义为$ r_{\mathrm{enc}}^{i} $;同时,在解密方向上计算第i个字第1次达到全扩散的轮数,并定义为$ r_{\mathrm{dec}}^{i}+1 $,且解密$ r_{\mathrm{dec}}^{i} $轮时,至少存在1个输出状态字的表达式中不出现第i个密文字。最后,遍历$ 0\leq i\leq m-1 $,按照上述方式分别计算$ r_{\mathrm{enc}}^{i} $和$ r_{\mathrm{dec}}^{i} $,并计算集合$ \{r_{\mathrm{enc}}^{0}+r_{\mathrm{dec}}^{0},r_{\mathrm{enc}}^{1}+r_{\mathrm{dec}}^{1},… ,r_{\mathrm{enc}}^{m-1}+ $$ r_{\mathrm{dec}}^{m-1}\} $的最大值得到$ r_{\mathrm{enc}}^{}+r_{\mathrm{dec}}^{} $,此时可说明该密码算法存在$ r_{\mathrm{enc}}^{}+r_{\mathrm{dec}}^{} $轮的积分区分器。
文献[15]在加密方向上仅考虑待测字出现1次的情况,在此基础上,文献[17]给出了另外一种存在积分性质的代数结构,具体如下。
性质3. 假设$ S({x}) $是$ {F}_{2}^{b} $上的置换,并且u和v是常数,则
$ \underset{x遍历F_{2}^{b}}{\oplus }S(S(x)\oplus S(x\oplus u)\oplus v)=0 \;。 $
性质3表明,虽然中间状态字在密文字中出现2次,但是如果以式(2)(3)的形式出现,基于差分分布表的性质,当输入字x遍历,密文字是平衡的。
对于基于字运算的SPN或Feistel结构的密码算法,性质2和性质3给出了2种存在积分性质的代数结构,攻击者可以根据密码算法结构推导出中间状态的代数表达式,并判断是否满足上述代数结构,从而确定积分区分器的形式。然而,对于一些结构复杂的密码算法,手动推导其基于字的代数结构需要消耗较多的时间,并且随着攻击轮数的增加,代数表达式也越来越复杂,确定内部状态的表达式是否满足上述形式也越发困难。因此,研究能够自动化确定代数结构的分析工具,对于积分区分器的搜索具有非常重要的意义。
对于一个内部状态为m个字,每个字为n比特的密码算法,且算法的基本操作单元为n比特,定义其第r轮的输入状态为$ {{\boldsymbol{X}}}^{r-1} $,输出为$ {{\boldsymbol{X}}}^{r} $,其中$ r\geq 1 $,$ {{\boldsymbol{X}}}^{{r-}1}=(x_{0}^{r-1},x_{1}^{r-1},… ,x_{m-1}^{r-1}) $,$ x_{j}^{r-1}\in {F}_{2}^{{b}} $,则明文状态为$ {{\boldsymbol{X}}}^{0} $。在解密方向,本文定义解密方向第r轮的输入为$ {{\boldsymbol{Y}}}^{r-1}=(y_{0}^{r-1},y_{1}^{r-1},… ,y_{m-1}^{r-1}) $,输出为$ {\boldsymbol{Y}}^{r} $,则密文状态为$ {\boldsymbol{Y}}^{0} $。
定义1. 对于明文的第w个字$ x_{w}^{0} $,加密r轮后,其在内部状态$ {{\boldsymbol{X}}}^{r} $中每个字的表达式中出现次数使用符号$ {\boldsymbol{A}}^{r,w}=(A_{0}^{r,w},A_{1}^{r,w},… ,A_{m-1}^{r,w})$进行表示,其中,$ A_{j}^{r,w} $表示$ x_{w}^{0} $在$ x_{j}^{r} $的代数表达式中出现的次数,其中$ 0\leq w\leq m-1 $,$ 0\leq j\leq m-1 $。同样,对于密文的第w个字$ y_{w}^{0} $,解密r轮后,其在内部状态$ {{\boldsymbol{Y}}}^{r} $表达式中出现的次数使用符号$ {\boldsymbol{C}}^{r,w}=(C_{0}^{r,w},C_{1}^{r,w},C_{2}^{r,w},… , C_{m-1}^{r,w}) $进行表示。
定义2. 定义$ (x_{w}^{0})_{k}^{r,{j}} $表示第k个出现在$ {x}_{{j}}^{{r}} $表达式中的变量$ x_{w}^{0} $,也称为$ x_{w}^{0} $在$ x_{j}^{r} $中的第k个分量。
为了更好地理解定义2,本文给出了如下的例子。
例1. 假设经过r轮的加密后,得到$ x_{1}^{r} $的代数表达式为:
$ x_{1}^{r}=S\left(x_{0}^{0}\oplus {c}_{1}{}_{}\oplus S (x_{0}^{0}\oplus c_2 )\right)\oplus x_{0}^{0} \;,$
其中S表示S盒运算,$ {{c}}_{1} $和$ {{c}}_{2} $为与$ {x}_{0}^{0} $无关的常数。$ x_{0}^{0} $在$ x_{1}^{r} $的代数表达式中出现3次,根据定义2,可以得到如下的关系:
$ x_{1}^{r}=S\Big((x_{0}^{0})_{0}^{r,1}\oplus {c}_{1}\oplus S\Big((x_{0}^{0})_{1}^{r,1}\oplus {c}_{2}\Big)\Big)\oplus (x_{0}^{0})_{2}^{r,1}\;。 $
定义3. 定义2维列表$ {B}^{r,w} $, $ {B}^{r,w}=\{{\boldsymbol{B}}_{0}^{r,w},{\boldsymbol{B}}_{1}^{r,w}, {\boldsymbol{B}}_{2}^{r,w},… , {\boldsymbol{B}}_{m-1}^{r,w}\} $,1维列表$ {\boldsymbol{B}}_{j}^{r,w} $, $ {\boldsymbol{B}}_{j}^{r,w}=({{B}}_{j,0}^{r,w},{{B}}_{j,1}^{r,w},… ,{{B}}_{j,|B_{j}^{r,w}|-1}^{r,w}) $,其中$ B_{j,k}^{r,w} $表示$ (x_{w}^{0})_{k}^{r,j} $经过运算得到$ x_{j}^{r} $需要经过的S盒的个数,$ 0\leq k \lt | {\boldsymbol{B}}_{j}^{r,w} | $。整数向量$ {\boldsymbol{B}}_{j}^{r,w} $中元素的个数也反映了$ x_{w}^{0} $在$ x_{j}^{r} $的代数表达式中出现的次数。
为了更好地理解定义3,本文给出了如下的例子。
例2. 假设经过r轮的加密后,得到$ x_{1}^{r} $的代数表达式为:
$ x_{1}^{r}=S\Big((x_{0}^{0})_{0}^{r,1}\oplus {c}_{1}\oplus S\Big((x_{0}^{0})_{1}^{r,1}\oplus {c}_{2}\Big)\Big)\oplus (x_{0}^{0})_{2}^{r,1}\;。 $
根据上述表达式,$ (x_{0}^{0})_{0}^{r,1}\rightarrow x_{1}^{{r}} $的运算经过1次S盒的运算,$ (x_{0}^{0})_{1}^{r,1}\rightarrow x_{1}^{{r}} $的运算需要经过2次S盒的运算,$ (x_{0}^{0})_{2}^{r,1}\rightarrow x_{1}^{{r}} $的运算经过0次S盒的运算,根据定义2可得$ {\boldsymbol{B}}_{1}^{r,0}=\left(1,2,0\right) $。
当使用性质2搜索积分区分器时,需要确定明文字在密文字中是否出现1次;当使性质3搜索积分区分器时,需要确定明文字在一些密文字的表达式中出现2次,且由这个明文字节的每个分量计算至相应的密文字节都需要经过2次S盒的运算。因此,本文从2方面进行分析:一方面需要确定每个明文字在密文字的表达式中出现的次数,另一方面需要确定每个明文字的分量运算至对应的密文字需要经过的S盒的个数。最后,根据这2方面的数据,确定相应轮数的积分区分器是否存在,并给出积分区分器的具体形式。
根据对称密码算法的特点可以发现,对于每一个明文字,其在每一轮的输出状态表达式中出现的次数是固定的,且这个明文字传播到密文字经过的S盒的个数也是确定的。根据这个特点,本文给出了字传播轨迹的定义,相比于文献[16]中的字传播轨迹的定义,本文的定义增加了$ {B}^{0,{w}} $的传播性质,其中,$ 0\leq w\leq m-1 $。
定义4. 字传播轨迹。定义迭代型分组密码算法的轮函数为f,$ {T}^{{r},{w}}=\{{{\boldsymbol{A}}}^{{r},{w}},{B}^{{r},{w}}\} $,对于R轮的密码算法存在如下的传播轨迹:
$ T^{0,w}\xrightarrow{f}T^{1,w}\xrightarrow{f}T^{2,w}\xrightarrow{f}… \xrightarrow{f}T^{R,w} \;,$
并且满足$ {\boldsymbol{A}}^{0,w}\xrightarrow{f}{\boldsymbol{A}}^{1,w}\xrightarrow{f}{\boldsymbol{A}}^{2,w}\xrightarrow{f}… \xrightarrow{f}{\boldsymbol{A}}^{R,w} $,$ B^{0,w}\xrightarrow{f} B^{1,w}\xrightarrow{f} B^{2,w}\xrightarrow{f}… \xrightarrow{f}B^{R,w} $,则定义该轨迹$ T^{0,w}\xrightarrow{f} T^{1,w}\xrightarrow{f} T^{2,w}\xrightarrow{f}… \xrightarrow{f}T^{R,w} $为密码算法的R轮的字传播轨迹。
为了评估分组密码算法抵抗积分攻击的能力,需要构建出关于每个字的传播轨迹。然而,手动推导字传播轨迹需要耗费较长的时间,并且容易出现错误。因此,需要研究字传播轨迹的传播性质。对于基于字运算的分组密码算法来说,其基本运算包括S盒运算、置换运算和异或运算,下面将分别讨论这些基本运算的字传播轨迹。
性质4. 置换运算的字传播轨迹。由于置换运算只改变了字的位置,不会影响代数表达式和代数结构。如果轮函数内存在置换运算$ x_{{k}}^{{r}}\rightarrow x_{{k}_{1}}^{{r+1}} $,则根据字传播轨迹的定义,能够得到如下的关系:
$ A_{{k}_{1}}^{r+1,w}=A_{k}^{r,w} \;,$
$ {\boldsymbol{B}}_{{k}_{1}}^{r+1,w}={\boldsymbol{B}}_{k}^{r,w} \;,$
其中$ 0\leq w\leq m-1 $。
性质5. S盒运算的字传播轨迹。S盒运算不影响明文字出现的次数,只对明文字到密文字的运算需要经过的S盒个数有影响。如果轮函数内存在S盒运算$ x_{k}^{r+1}=S(x_{k}^{r}) $,根据字传播轨迹的定义,能够得到如下的关系:
$ A_{{k}}^{r+1,w}=A^{r,w}_k \;,$
$ B_{{k,i}}^{r+1,w}=B_{k,i}^{r,w}+1 ,\;\; 0\leq i<|{\boldsymbol{B}}_{k}^{r,w}| \;。 $
性质6. 异或运算的字传播轨迹。在大部分的分组密码算法中,异或运算是轮函数中的主要线性操作。如果在轮函数中存在异或运算,即
$ x_{{k}_{1}}^{r}\oplus x_{{k}_{2}}^{r}\oplus x_{{k}_{3}}^{r}\oplus … \oplus x_{{k}_{l}}^{r}=x_{k}^{r+1} \;。$
根据本文字传播轨迹的定义,能够得到如下关系:
$ \begin{aligned}A_{{k}_{1}}^{r,w}+A_{{k}_{2}}^{r,w}+A_{{k}_{3}}^{r,w}+…+A_{{k}_{l}}^{r,w}&=A_{{k}_{}}^{r+1,w}\;,\\{\boldsymbol{B}}_{{k}_{1}}^{r,w}|| {\boldsymbol{B}}_{{k}_{2}}^{r,w}|| {\boldsymbol{B}}_{{k}_{3}}^{r,w}|| …|| {\boldsymbol{B}}_{{k}_{l}}^{r,w}&={\boldsymbol{B}}_{k}^{r+1,w}。\end{aligned} $
通过将密码算法的轮函数拆分成S盒运算、置换运算和异或运算,利用性质4,5,6构建出每个运算的传播轨迹,将这些轨迹按照算法结构组合能够得到轮函数的字传播轨迹。最后,将轮函数进行多次迭代就能够得到密码算法的R轮的字传播轨迹,根据明文到密文的字传播轨迹特点,密码分析者可以判断算法抵抗积分攻击的能力,并能够确定积分区分器的具体形式。
首先,我们给出字传播轨迹的初始输入如何定义。为了得到明文中第w个字$ x_{w}^{0} $的字传播轨迹,由于$ x_{w}^{0} $在明文的第w个字中仅出现1次,并且$ x_{w}^{0} $在此之前没有经过S盒运算,则初始的字传播轨迹$ {T}^{0,w} $如下:
$ \left\{\begin{aligned}& A_{w}^{0,w}=1\;,\\&A_{i}^{0,w}=0,\;\;{i}\neq w,\;\;0\leq {i}\leq {m}-1\;。\end{aligned}\right. $
$ \left\{\begin{aligned}&{\boldsymbol{B}}_{w}^{0,w}=(0)\;,\\&{\boldsymbol{B}}_{i}^{0,w}=(),\;\;{i}\neq {w},\;\;0\leq {i}\leq m-1\;。\end{aligned}\right. $
随后,根据被分析算法的结构,结合性质4,5,6,计算密码算法第w个字的R轮字传播轨迹,即$ T^{0,w}\xrightarrow{f}T^{1,w}\xrightarrow{f}T^{2,w}\xrightarrow{f}… \xrightarrow{f}T^{R,w} $。
最后,根据得到的$ {T}^{R,w} $,确定积分区分器的具体形式,主要讨论下面3种情况:
1)如果$ \min ({{\boldsymbol{A}}}^{{R,}w})\leq 1 $,根据置换函数的性质,说明存在关于明文的第$ {w} $个字的积分区分器。
2)如果$ \min ({{\boldsymbol{A}}}^{{R,}w})=2 $,说明明文的第w个字经过R轮的加密后,在密文字的代数表达式中至少出现2次。此时,需要借助$ {B}^{{R,}w} $的值判断是否存在积分区分器。
假设$ {{{A}}}^{{R,}w}_i=2 $,$ 0\leq i\leq m-1 $,也就是明文的第w个字经过R轮的加密后,在密文的第i个字的代数表达式中出现2次。下面根据列表$ {\boldsymbol{B}}_{i}^{R,w} $的值,讨论此时是否存在R轮的积分区分器,共存在下面5种情况:
① $ {\boldsymbol{B}}_{i}^{R,w}=(0,0)$。这种情况表明$ x_{i}^{R} $的代数表达式中不存在关于$ x_{w}^{0} $的S盒运算,即$ x_{i}^{R}=x_{w}^{0}\oplus x_{w}^{0}\oplus C=C $,$ C $是与变量$ x_{w}^{0} $无关的常数。此时,当$ x_{w}^{0} $遍历$ {F}_{2}^{{n}} $,$ x_{i}^{R} $是平衡的,存在R轮的积分区分器。
② $ {\boldsymbol{B}}_{i}^{R,w}=(0,1) $或$ {\boldsymbol{B}}_{i}^{R,w}=(1,0) $。这种情况表明$ x_{i}^{R} $的代数表达式中仅出现1次关于$ x_{w}^{0} $的S盒运算,即$ x_{i}^{R}=x_{w}^{0}\oplus S(x_{w}^{0}\oplus {C}_{1})\oplus {C}_{2} $。此时,由于存在如下性质:
$ \underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }x_{w}^{0}=0 \;,$
$ \underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }S(x_{w}^{0}\oplus {{C}}_{1})=0 \;。 $
由此可得$ \underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }x_{i}^{R}=0 $,此时$ x_{{i}}^{R} $是平衡的,存在R轮的积分区分器。
③ $ {\boldsymbol{B}}_{i}^{R,w}=(1,1) $。这种情况表明$ x_{i}^{R} $的代数表达式中出现了2次关于$ x_{w}^{0} $的S盒运算,并且每个出现在$ x_{i}^{R} $的$ x_{w}^{0} $的每个分量仅经过1次S盒运算,即$ x_{i}^{R}=S(x_{w}^{0} \oplus {C}_{1})\oplus S(x_{w}^{0}\oplus {C}_{2})\oplus {C}_{3} $,可得
$ \begin{split}\underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }x_{i}^{R}=&\underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }(S(x_{w}^{0}\oplus {{C}}_{1})\oplus S(x_{w}^{0}\oplus {C}_{2})\oplus {C}_{3})=\\&0\oplus 0\oplus 0 =0\;。\end{split} $
因此,此时$ x_{i}^{R} $是平衡的,存在R轮积分区分器。
④ $ {\boldsymbol{B}}_{i}^{R,w}=(2,1) $或$ {\boldsymbol{B}}_{i}^{R,w}=(1,2) $。根据$ {\boldsymbol{B}}_{i}^{R,w} $的定义,这种情况表明$ x_{i}^{R} $的代数表达式可能为:
当 $ x_{i}^{R}=S(x_{w}^{0}\oplus S(x_{w}^{0}\oplus {C}_{1})\oplus {C}_{2})\oplus {C}_{3} $ 或 $ x_{i}^{R}=S(x_{w}^{0} \oplus S (x_{w}^{0}) \oplus {C}_{2})\oplus {C}_{3}$时,此时无法利用置换函数的性质2和性质3判断$ x_{i}^{R} $是否平衡;
当$ x_{i}^{R}={S}(x_{w}^{0}\oplus {C}_{1})\oplus S(S(x_{w}^{0})\oplus {C}_{2})\oplus {C}_{3} $时,
$ \begin{aligned}\underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }x_{i}^{R}=&\underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }({S}(x_{w}^{0}\oplus {C}_{1})\oplus S(S(x_{w}^{0})\oplus {C}_{2})\oplus {C}_{3})=\\&0\oplus 0 =0\;,\end{aligned} $
此时$ x_{i}^{R} $是平衡的,存在R轮的积分区分器。
因此,对于对于④,无法直接通过字传播轨迹确定是否存在R轮的积分区分器。
⑤$ {\boldsymbol{B}}_{i}^{R,w}=(2,2) $。这种情况表明$ x_{w}^{0} $在$ x_{i}^{R} $的代数表达式中出现了2次,且$ x_{w}^{0} $的每个分量在$ x_{i}^{R} $的代数表达式中都经过2次S盒运算。此时,仅存在2种满足的情况:$ x_{i}^{R}=S(S(x_{w}^{0}\oplus {C}_{1})\oplus {C}_{2})\oplus S(S(x_{w}^{0}\oplus {C}_{3})\oplus $$ {C}_{4})\oplus {{C}}_{5} $或$ x_{i}^{R}=S(S(x_{w}^{0}\oplus {C}_{1})\oplus S(x_{w}^{0}\oplus {C}_{2})\oplus {C}_{3})\oplus $$ {{C}}_{4} $。
当$ x_{i}^{R}=S(S(x_{w}^{0}\oplus {C}_{1})\oplus {C}_{2})\oplus S(S(x_{w}^{0}\oplus {C}_{3})\oplus {C}_{4}) $$ \oplus {{C}}_{5} $时,由性质2可得
$ \begin{split}\underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }x_{i}^{R}=&\underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }(S(S(x_{w}^{0}\oplus {C}_{1})\oplus {C}_{2}\oplus S(S(x_{w}^{0}\oplus {C}_{3})\oplus\\& {C}_{4})\oplus {C}_{5}))=0\oplus 0\oplus 0 =0。\end{split} $
当$ x_{i}^{R}=S(S(x_{w}^{0}\oplus {C}_{1})\oplus S(x_{w}^{0}\oplus {C}_{2})\oplus {C}_{3})\oplus {{C}}_{4} $时,此时由性质3可以证明$ x_{i}^{R} $关于$ x_{w}^{0} $是仍然是平衡的。因此,对于第5种情况,此时$ x_{i}^{R} $是平衡的,存在R轮积分区分器。
3)如果$ \min ({{\boldsymbol{A}}}^{{R,}w})=h $,且$ h \gt 2 $。假设$ A_{i}^{R,w}=h $,$ 0\leq i \lt m $,如果$ \max ({\boldsymbol{B}}_{i}^{R,w})\leq 1 $,说明$ x_{w}^{0} $的每一个分量在$ x_{i}^{R} $的代数表达式中只涉及1个S盒运算,此时$ x_{i}^{R} $的代数表达式只能为如下的情况:
$ x_{i}^{R}=S(x_{w}^{0}\oplus {{C}}_{1})\oplus S(x_{w}^{0}\oplus {C}_{2})\oplus … \oplus S(x_{w}^{0}\oplus {C}_{h})\oplus {C}_{h+1} $,根据性质2可得
$ \begin{split}\underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }x_{i}^{R}=&\underset{x_{w}^{0}遍历{F}_{2}^{n}}{\oplus }(S(x_{w}^{0}\oplus {{C}}_{1})\oplus S(x_{w}^{0}\oplus {C}_{2})\oplus … \oplus\\&S(x_{w}^{0}\oplus {C}_{h})\oplus {C}_{h+1})= 0\oplus 0\oplus 0\oplus … \oplus 0 =0\;,\end{split} $
由此,$ x_{i}^{R} $仍然是平衡字,此时存在R轮的积分区分器。
对上述讨论进行总结,当$ \min ({\boldsymbol{A}}^{R,w})\leq 1 $,此时一定存在关于明文第w个字$ x_{w}^{0} $的R轮积分区分器;当$ \min ({{\boldsymbol{A}}}^{{R,}w})=2 $时,存在$ A_{i}^{R,w} = 2 $且$ \max ({\boldsymbol{B}}_{i}^{R,w})\leq 1 $或者$ {\boldsymbol{B}}_{i}^{R,w} = (2,2) $,此时存在关于明文第$ {w} $个字$ {x}_{w}^{0} $的R轮积分区分器;当$ \min ({{\boldsymbol{A}}}^{{R,}w})\geq 2 $且存在$ \max ({\boldsymbol{B}}_{i}^{R,w})\leq 1 $,此时存在关于明文第$ {w} $个字$ x_{w}^{0} $的R轮积分区分器。
为了搜索最长轮数的积分区分器,本文给出算法2和算法3。
算法2. 搜索加密方向最长轮数的积分区分器。
输入:分组密码算法的轮函数f,轮函数的输入为m个n比特的字,加密总轮数R,活跃字的下标$ {w} $;
输出:第$ {w} $个字活跃,加密方向最长的积分区分器轮数$ r_{{w}}^{\mathrm{e}} $,平衡字的下标集合$ {\phi }^{w} $。
① 初始化$ r_{{w}}^{\mathrm{e}}=0 $,$ {\phi }^{w}=\varnothing $,定义1维$ {{\boldsymbol{A}}}^{0,w} $和2维列 表$ {B}^{0,w} $,$ {A}^{0,w}_w=1 $,$ {\boldsymbol{B}}_{w}^{0,w}=(0) $,$ A_i^{0,w}=0 $,$ {\boldsymbol{B}}_{{i}}^{0,w}=() $, $ {i}\neq {w} $,$ 0\leq i\leq m-1 $;
② for $ 0\leq i\leq R $ do
③ 根据算法结构计算r轮的字传播轨迹: $ {T}^{0,{w}}\xrightarrow{f}{T}^{1,{w}}\xrightarrow{f}{T}^{2,{w}}\xrightarrow{f}… \xrightarrow{f}{T}^{{r},{w}} $;
④ if $ \min ({{\boldsymbol{A}}}^{{r,}w})\leq 1 $then
⑤   $ {r}_{w}^{{\mathrm{e}}}=r $;
⑥ else if $ \min ({{\boldsymbol{A}}}^{{r,}w})==2 $ and (当$ A_{{i}}^{{{r,}w}}=2 $ 时, $ \max ({\boldsymbol{B}}_{i}^{r,w})\leq 1 $ or $ B_{{i}}^{{{r,}w}}==[2,2] $)
⑦   $ r_{{w}}^{\mathrm{e}}=r $;
⑧ else if $ \min ({{\boldsymbol{A}}}^{{r,}w})\geq 2 $ and $ \max ({\boldsymbol{B}}_{i}^{r,w})\leq 1 $
⑨   $ r_{{w}}^{\mathrm{e}}=r $;
⑩ else
⑪  break;
⑫ end if
⑬ end for
⑭ if $ \min ({{\boldsymbol{A}}}^{{{r}_{w}^{\mathrm{e}}},w})\leq 1 $ then
⑮ for $ 0\leq i\leq m-1 $ do
⑯  if $ A_{i}^{{r}_{w}^{\mathrm{e}},w}\leq 1 $ then
⑰    $ {\phi }^{w}={\phi }^{w}\cup \{{i}\} $;
⑱  end if
⑲ end for
⑳ else if $ \min ({{\boldsymbol{A}}}^{{{r}_{w}^{\mathrm{e}}},w})==2 $ then
㉑ for $ 0\leq i\leq m-1 $ do
㉒  if $ A_{i}^{{r}_{w}^{\mathrm{e}},w}==2 $ and ($ \max ({{\boldsymbol{B}}}_{i}^{{{r}_{w}^{\mathrm{e}}},w})\leq 1 $ or $ {{\boldsymbol{B}}}_{i}^{{{r}_{w}^{\mathrm{e}}},w}=$ (2, 2) ) then
㉓    $ {\phi }^{w}={\phi }^{w}\cup \{{i}\} $;
㉔  end if
㉕ end for
㉖ else $ \min ({{\boldsymbol{A}}}^{{{r}_{w}^{\mathrm{e}}},w}) \gt 2 $
㉗ for $ 0\leq i\leq m-1 $ do
㉘  if $ \max ({{\boldsymbol{B}}}_{i}^{{{r}_{w}^{\mathrm{e}}},w})\leq 1 $ then
㉙    $ {\phi }^{w}={\phi }^{w}\cup \{{i}\} $;
㉚  end if
㉛ end for
㉜ end if
㉝ return $ r_{w}^{\mathrm{e}} $,$ {\phi }^{w} $。
在算法2中,行①为初始化过程,主要是根据字传播轨迹的定义对$ {{\boldsymbol{A}}}^{0,w} $和$ {B}^{0,w} $进行初始化;行②~⑬表示利用字传播轨迹,确定加密方向上关于第w个明文字的最长积分区分器轮数$ r_{w}^{\mathrm{e}} $;行⑭~㉝的作用是得到加密$ r_{w}^{\mathrm{e}} $轮后关于第w个明文字的平衡密文字的位置。
为了进一步扩展积分区分器的轮数,需要利用文献[15, 17]中的方法推导密文字在解密方向上的字传播轨迹。根据算法解密方向的轮函数结构,判断每一个密文字在解密方向是否达到全扩散。如果解密r+1轮后,密文的第w个字第1次达到全扩散,并且解密r轮后,第w个字没有达到全扩散,即存在部分状态字的表达式中不出现$ y_{w}^{0} $,则将此时解密的轮数定义为$ r_{w}^{\mathrm{d}} $。根据文献[15, 17]给出的证明,此时密码算法一定存在$ r_{w}^{\mathrm{e}}+r_{w}^{\mathrm{d}} $轮的积分区器。
算法3. 向解密方向扩展积分区分器。
输入:分组密码算法的解密轮函数$ {f}^{-1} $,轮函的输入为m个n比特的字,解密总轮数R,活跃密文字的下标w;
输出:第w个密文字活跃时,解密方向第w个字未达到全扩散的最大轮数$ r_{w}^{\mathrm{d}} $,未扩散到的状态字的下标集合$ {\varphi }^{{w}} $。
① 初始化$ r_{w}^{\mathrm{d}}=0 $,$ \varphi ^{{w}}=\varnothing $;
② for $ 1\leq r \lt R $ do
③  $ {{\boldsymbol{C}}}^{0,w}\xrightarrow{{f}^{-1}}{{\boldsymbol{C}}}^{1,w}\xrightarrow{{f}^{-1}}{{\boldsymbol{C}}}^{2,w}\xrightarrow{{f}^{-1}}… \xrightarrow{{f}^{-1}}{{\boldsymbol{C}}}^{r,w} $;
④ if $ \min ({{\boldsymbol{C}}}^{r,w})==0 $ then
⑤   $ r_{w}^{\mathrm{d}}=r $;
⑥ else
⑦  break;
⑧ end if
⑨ end for
⑩ for $ 0\leq i \lt m-1 $ do
⑪ if $ C_{i}^{r_{w}^{\mathrm{d}},w}==0 $ then
⑫   $ {\varphi }^{w}={\varphi }^{w}\cup \{i\} $;
⑬ end if
⑭ end for
⑮ return $ r_{w}^{\mathrm{d}} $,$ {\varphi }^{w} $。
对于迭代型的分组密码算法,我们给出如下搜索积分区分器的步骤:
第1步. 遍历所有的$ 0\leq w\leq m-1 $,利用算法2计算对应的$ r_{w}^{{\mathrm{e}}} $和$ {\phi }^{w} $;
第2步. 遍历所有的$ 0\leq w\leq m-1 $,利用算法3计算对应的$ r_{w}^{\mathrm{d}} $和$ {\varphi }^{w} $;
第3步. 计算$ {{r}}^{\mathrm{ed}}=\max (r_{0}^{\mathrm{e}}+r_{0}^{\mathrm{d}},r_{1}^{\mathrm{e}}+r_{1}^{\mathrm{d}},… ,r_{m-1}^{\mathrm{e}}+r_{m-1}^{\mathrm{d}}) $以及最大值$ {{r}}^{\mathrm{ed}} $在列表$ (r_{0}^{\mathrm{e}}+r_{0}^{\mathrm{d}},r_{1}^{\mathrm{e}}+r_{1}^{\mathrm{d}}, r_{2}^{\mathrm{e}}+r_{2}^{\mathrm{d}},… , r_{m-1}^{\mathrm{e}}+ r_{m-1}^{\mathrm{d}}) $中对应的下标集合$ \beta $;
第4步. 根据$ {\phi }^{{i}} $和$ {\varphi }^{{i}} $确定积分区分器的具体形式,$ {i}\in \beta $。
为了分析LLLWBC算法抵抗积分攻击的能力,需要构建出其对应的字传播轨迹。由于LLLWBC的基本操作单元为4b,本节主要讨论4b的明文字在LLLWBC中字传播轨迹的构建方法。
首先,在加密方向上,64b的明文输入为$ {{\boldsymbol{X}}}^{0}= (x_{0}^{0},x_{1}^{0},…,x_{15}^{0}) $,当第w个字为活跃,即$ x_{w}^{0} $活跃,其余字固定为常数,根据新型字传播轨迹的定义,可以得到如下的初始化向量:
$ \begin{split}{\boldsymbol{A}}^{0,w}=&(A_{0}^{0,w},A_{1}^{0,w},A_{2}^{0,w},… ,A_{w}^{0,w},… ,A_{15}^{0,w})=\\& (0,0,0,… ,0,1,0,… ,0)\;,\end{split} $
$ \begin{split}B^{0,w}=&\{{\boldsymbol{B}}_{0}^{0,w},{{\boldsymbol{B}}}_{1}^{0,w},{\boldsymbol{B}}_{2}^{0,w},… ,{\boldsymbol{B}}_{w}^{0,w},… ,{\boldsymbol{B}}_{15}^{0,w}\}=\\& \{(),(),(),… ,(),(0),(),… ,()\}\;,\end{split} $
其中,()表示该位置对应的内部状态不存在关于$ x_{w}^{0} $可行的传播路径,因此相应的内部状态的表达式中$ x_{w}^{0} $经过S盒次数构成的向量为空。
随后,根据LLLWBC算法的轮函数结构,为了更好地构建其字传播轨迹,我们首先给出LLLWBC算法中第i个T函数的定义,其具体结构如图2所示。其表达式如下:
$ y_{4\times i}^{r-1}=x_{4\times i}^{r-1} \;,$
$ y_{4\times i+1}^{r-1}=x_{4\times i+1}^{r-1} \;,$
$ y_{4\times i+2}^{r-1}=x_{4\times i+2}^{r-1}\oplus S(0{{\mathrm{x}}2}\cdot S({x}_{4\times i}^{r-1})\oplus {0{\mathrm{x}}3}\cdot S({x}_{4\times i+1}^{r-1})) \;,$
$ y_{4\times i+3}^{r-1}=x_{4\times i+3}^{r-1}\oplus S(0{{\mathrm{x}}1}\cdot S({x}_{4\times i}^{r-1})\oplus {0{\mathrm{x}}1}\cdot S({x}_{4\times i+1}^{r-1})) \;。 $
根据式(4)~(9),本文给出了算法4,用于描述LLLWBC算法中第r轮加密第i个T函数的字传播轨迹。
算法4. LLLWBC算法中第r轮加密第i个T函数字传播轨迹T_Word_Trail(加密轮数r,$ A_{4\times i}^{r-1,w}, $$ A_{4\times i+1}^{r-1,w}, A_{4\times i+2}^{r-1,w},A_{4\times i+3}^{r-1,w},{\boldsymbol{B}}_{4\times i}^{r-1,w},{\boldsymbol{B}}_{4\times i+1}^{r-1,w},{\boldsymbol{B}}_{4\times i+2}^{r-1,w},{\boldsymbol{B}}_{4\times i+3}^{r-1,w} $)。
输入:轮数r,$ A_{4\times i}^{r-1,w},A_{4\times i+1}^{r-1,w},A_{4\times i+2}^{r-1,w},A_{4\times i+3}^{r-1,w},{\boldsymbol{B}}_{4\times i}^{r-1,w}, $$ {\boldsymbol{B}}_{4\times i+1}^{r-1,w}, {\boldsymbol{B}}_{4\times i+2}^{r-1,w},{\boldsymbol{B}}_{4\times i+3}^{r-1,w} $;
输出:$ A_{4\times i}^{r,w},A_{4\times i+1}^{r,w},A_{4\times i+2}^{r,w},A_{4\times i+3}^{r,w},{\boldsymbol{B}}_{4\times i}^{r,w},{\boldsymbol{B}}_{4\times i+1}^{r,w},{\boldsymbol{B}}_{4\times i+2}^{r,w}, $$ {\boldsymbol{B}}_{4\times i+3}^{r,w} $。
① $ A_{4\times i}^{r,w}=A_{4\times i}^{r-1,w} $;
② $ A_{4\times i+1}^{r,w}=A_{4\times i+1}^{r-1,w} $;
③ $ A_{4\times i+2}^{r,w}=A_{4\times i}^{r-1,w}+A_{4\times i+1}^{r-1,w}+A_{4\times i+2}^{r-1,w} $;
④ $ A_{4\times i+{3}}^{r,w}=A_{4\times i}^{r-1,w}+A_{4\times i+1}^{r-1,w}+A_{4\times i+{3}}^{r-1,w} $;
⑤ $ {\boldsymbol{B}}_{4\times i}^{r,w}={\boldsymbol{B}}_{4\times i}^{r-1,w} $;
⑥ $ {\boldsymbol{B}}_{4\times i+1}^{r,w}={\boldsymbol{B}}_{4\times i+1}^{r-1,w} $;
⑦ for $ 0\leq j \lt |{\boldsymbol{B}}_{4\times i}^{r-1,w}| $ do
⑧  $ {\boldsymbol{B}}_{4\times i,j}^{r-1,w}={\boldsymbol{B}}_{4\times i,j}^{r-1,w}+1 $;
⑨ end for
⑩ for $ 0\leq j \lt |{\boldsymbol{B}}_{4\times i+1}^{r-1,w}| $ do
⑪  $ {\boldsymbol{B}}_{4\times i+1,j}^{r-1,w}={\boldsymbol{B}}_{4\times i+1,j}^{r-1,w}+1 $;
⑫ end for
⑬ $ {{\boldsymbol{B}}}^{\ast }={\boldsymbol{B}}_{4\times i}^{r-1,w}||{\boldsymbol{B}}_{4\times i+1}^{r-1,w} $;
⑭ for $ 0\leq j \lt |{B}^{*}| $ do
⑮  $ {\boldsymbol{B}}_{j}^{*}={\boldsymbol{B}}_{j}^{*}+1 $;
⑯ end for
⑰ $ {\boldsymbol{B}}_{4\times i+2}^{r,w}={{\boldsymbol{B}}}^{\ast }||{\boldsymbol{B}}_{4\times i+2}^{r-1,w} $;
⑱ $ {\boldsymbol{B}}_{4\times i+3}^{r,w}={{\boldsymbol{B}}}^{\ast }|| {\boldsymbol{B}}_{4\times i+3}^{r-1,w} $;
⑲ return $ A_{4\times i}^{r,w},A_{4\times i+1}^{r,w},A_{4\times i+2}^{r,w},A_{4\times i+3}^{r,w},{\boldsymbol{B}}_{4\times i}^{r,w},{\boldsymbol{B}}_{4\times i+1}^{r,w},{\boldsymbol{B}}_{4\times i+2}^{r,w}, $$ {\boldsymbol{B}}_{4\times i+2}^{r-1,w},{\boldsymbol{B}}_{4\times i+3}^{r-1,w} $。
在算法4中,行①~④用于描述明文的第w个字在第r轮的第i个T函数字传播轨迹的变化情况,即明文中第w个字在T函数的代数表达式中出现的次数的变化。行⑤⑥主要用于描述式(6)(7)的字传播轨迹。行⑦~⑨主要用于表示$ 0\text{x}2\cdot S(x_{4\times i}^{r-1}) $的字传播轨迹,根据字传播轨迹的定义,由于$ x_{4\times i}^{r-1} $经过1次S盒运算,此时明文的第$ w $个字$ {x}_{{w}}^{0} $在$ {S}(x_{4\times i}^{r-1}) $的表达式中的分量经过S盒的个数比$ x_{4\times i}^{r-1} $增加1个,然后,执行$ 0\text{x}2\cdot S(x_{4\times i}^{r-1}) $,这个乘法操作对字传播轨迹无影响。算法的行⑩~⑫的原理与行⑦~⑨类似。算法的行⑬~⑯用于描述$ S(0\text{x}2\cdot $$ S(x_{4\times i}^{r-1})\oplus \text{0x3}\cdot S(x_{4\times i+1}^{r-1})) $的字传播轨迹,$ {x}_{{w}}^{0} $在表达式$ 0\text{x}2\cdot S(x_{4\times i}^{r-1})\oplus 0\text{x}3\cdot S(x_{4\times i+1}^{r-1}) $中分量的个数为$ 0\text{x}2\cdot S(x_{4\times i}^{r-1}) $中$ x_{w}^{0} $分量的个数与$ \text{0x3}\cdot S(x_{4\times i+1}^{r-1}) $中$ x_{w}^{0} $分量个数之和,每个分量经过S盒的个数没有变化,所以使用$ {{\boldsymbol{B}}}^{*}={\boldsymbol{B}}_{4\times i}^{r-1,w}|| {\boldsymbol{B}}_{4\times i+1}^{r-1,w} $表示此时$ x_{w}^{0} $的字传播轨迹。然后,$ 0\text{x}2\cdot S(x_{4\times i}^{r-1})\oplus 0\text{x}3\cdot S(x_{4\times i+1}^{r-1}) $的输出经过S盒操作,$ x_{w}^{0} $每个分量经过S盒的个数比经过$ 0\text{x}2\cdot S(x_{4\times i}^{r-1})\oplus 0\text{x}3\cdot S(x_{4\times i+1}^{r-1}) $的个数增加1。算法的行⑰用于描述$ y_{4\times i+2}^{r-1}= x_{4\times i+2}^{r-1}\oplus $$ S(0\text{x2}\cdot S(x_{4\times i}^{r-1})\oplus \text{0x3}\cdot S(x_{4\times i+1}^{r-1})) $的字传播轨迹,此时$ {y}_{4\times i+2}^{r-1} $中$ x_{w}^{0} $分量的个数为$ x_{4\times i+2}^{r-1} $中分量的个数与$ S(0\text{x2}\cdot S(x_{4\times i}^{r-1})\oplus \text{0x3}\cdot S(x_{4\times i+1}^{r-1})) $分量个数的和,且每个分量经过S盒的个数不变,所以使用$ {\boldsymbol{B}}_{4\times i+2}^{r,w}={\boldsymbol{B}}_{4\times i+2}^{r-1,w}|| {{\boldsymbol{B}}}^{*} $描述其字传播轨迹,与算法的行⑱原理类似。最后,算法返回$ A_{4\times i}^{r,w},A_{4\times i+1}^{r,w},A_{4\times i+2}^{r,w},A_{4\times i+3}^{r,w} $和$ {\boldsymbol{B}}_{4\times i}^{r,w},{\boldsymbol{B}}_{4\times i+1}^{r,w},{\boldsymbol{B}}_{4\times i+2}^{r,w}, {\boldsymbol{B}}_{4\times i+3}^{r,w} $。
基于算法4,结合LLLWBC算法的基本结构,本文设计了算法5用于描述LLLWBC算法加密方向轮函数的字传播轨迹。
算法5. LLLWBC算法加密方向轮函数的字传播轨迹。
输入:w,加密轮数r(r > 0),$ {{\boldsymbol{A}}}^{{r}-1,w} $,$ {B}^{{r}-1,w} $;
输出:第r轮的$ {\boldsymbol{A}}^{r,w} $,$ B^{r,w} $。
① 定义$ {{\boldsymbol{A}}}^{*}=(A_{0}^{*},A_{1}^{*},A_{2}^{*},…,A_{15}^{*}) $;
② 定义$ {B}^{*}=\{{{\boldsymbol{B}}}_{0}^{*},{\boldsymbol{B}}_{1}^{*},{\boldsymbol{B}}_{2}^{*},…,{\boldsymbol{B}}_{15}^{*}\} $;
③ for $ 0\leq i \lt 4 $ do
④  $ A_{4\times i}^{*},A_{4\times i+1}^{*},A_{4\times i+2}^{*},A_{4\times i+3}^{*},{\boldsymbol{B}}_{4\times i}^{*},{\boldsymbol{B}}_{4\times i+1}^{*},{\boldsymbol{B}}_{4\times i+2}^{*}, $ $ {\boldsymbol{B}}_{4\times i+3}^{*}=T\_ Word\_ Trail(A_{4\times i}^{r-1,w},A_{4\times i+1}^{r-1,w},A_{4\times i+2}^{r-1,w}, $ $ A_{4\times i+3}^{r-1,w},{\boldsymbol{B}}_{4\times i}^{r-1,w},{\boldsymbol{B}}_{4\times i+1}^{r-1,w},{\boldsymbol{B}}_{4\times i+2}^{r-1,w},{\boldsymbol{B}}_{4\times i+3}^{r-1,w}) $
⑤ end for
⑥ for $ 0\leq i \lt 16 $ do
⑦  $ A_{P[{i}]}^{r,w}=A_{i}^{*} $,$ {\boldsymbol{B}}_{P[{i}]}^{r,w}={\boldsymbol{B}}_{i}^{*} $;
⑧ end for
⑨ return $ T^{{r},w}=\{{\boldsymbol{A}}^{{r},w},B^{{r},w}\} $。
在解密方向,由于LLLWBC算法的结构是广义Feistel结构,设计了算法6用于描述LLLWBC算法在解密方向轮函数的字传播轨迹。
算法6. LLLWBC算法解密方向轮函数的字传播轨迹。
输入:w,加密轮数r(r>0),$ {{\boldsymbol{C}}}^{r-1,w} $;/*$ {{\boldsymbol{C}}}^{r-1,w} $表示解密$ r-1 $轮后,密文的第w个字在内部状态$ {Y}^{r-1} $的代数表达式中出现的次数*/
输出:$ {{\boldsymbol{C}}}^{r,w} $。
① 定义$ {{\boldsymbol{C}}}^{*}=(C_{0}^{*},C_{1}^{*},C_{2}^{*},…,C_{15}^{*}) $;
② for $ 0\leq i \lt 16 $ do
③  $ C_{{P}^{-1}[{i}]}^{*}=C_{i}^{r-1} $;
④ end for
⑤ for $ 0\leq i \lt 4 $ do
⑥  $ C_{4\times i}^{r,w}=C_{4\times i}^{*} $;
⑦  $ C_{4\times i+1}^{r,w}=C_{4\times i+1}^{*} $;
⑧  $ C_{4\times i+2}^{r,w}=C_{4\times i}^{*}+C_{4\times i+1}^{*}+C_{4\times i+2}^{*} $;
⑨  $ C_{4\times i+3}^{r,w}=C_{4\times i}^{*}+C_{4\times i+1}^{*}+C_{4\times i+3}^{*} $;
⑩ end for
⑪ return $ {{\boldsymbol{C}}}^{r,w} $。
将算法5和算法6迭代R次,即可得到加密和解密方向R轮的LLLWBC算法的字传播轨迹,并分别将得到的轨迹$ {T}^{0,w}\xrightarrow{f}{T}^{1,w}\xrightarrow{f}{T}^{2,w}\xrightarrow{f}…\xrightarrow{f}{T}^{R,w} $和$ {{\boldsymbol{C}}}^{0,w}\xrightarrow{{f}^{-1}} {{\boldsymbol{C}}}^{1,w}\xrightarrow{{f}^{-1}}{{\boldsymbol{C}}}^{2,w}\xrightarrow{{f}^{-1}}… \xrightarrow{{f}^{-1}}{{\boldsymbol{C}}}^{R,w} $代入到算法2和算法3,得到$ r_{w}^{\mathrm{e}} $,$ {\phi }^{w} $,$ r_{w}^{\mathrm{d}} $,$ {\varphi }^{w} $并遍历$ 0\leq w\leq 15 $,计算$ {{r}}^{\mathrm{ed}}=\max (r_{0}^{\mathrm{e}}+ r_{0}^{\mathrm{d}},r_{1}^{\mathrm{e}}+r_{1}^{\mathrm{d}},… ,r_{m-1}^{\mathrm{e}}+r_{m-1}^{\mathrm{d}}) $确定积分区分器的最长轮数以及积分区分器的具体形式。
对于LLLWBC算法,以$ w=2 $为例,具体的积分区分器搜索步骤如下:
1)在LLLWBC算法的加密方向,利用算法5计算LLLWBC算法每一轮的字传播轨迹为
$ \begin{aligned}{\boldsymbol{A}}^{0,2}=&(0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0)\;,\\B^{0,2}=&\{(),(),(0),(),(),(),(),(),(),(),(),(),(),(),(),()\}\;,\\{\boldsymbol{A}}^{1,2}=&(0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0)\;,\\B^{1,2}=&\{(),(),(),(),(),(),(),(),(),(),(),(),(0),(),(),()\}\;,\\{\boldsymbol{A}}^{2,2}=&(0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0)\;,\\B^{2,2}=&\{(),(),(),(0),(),(),(),(),(),(2),(),(),(),(2),(),()\},\\{\boldsymbol{A}}^{3,2}=&(0,1,0,0,1,0,1,0,1,1,0,1,0,1,0,0)\;,\\B^{3,2}=&\{(),(4),(),(),(4),(),(2),(),(0),(4),(),(2),(),(4), (),()\},\\{\boldsymbol{A}}^{4,2}=&(2,3,0,0,2,1,1,1,1,1,1,1,1,1,0,1)\;,\\B^{4,2}=&\{(6,2),(2,6,2),(),(),(2,6),(6),(4),(4),(6),\\&(6),(4),(4),(6),(6),(),(0)\},\\{\boldsymbol{A}}^{5,2}=&(4,3,2,1,3,4,1,3,5,3,2,1,5,2,1,1)\;,\\B^{5,2}=&\{(4,8,8,4),(8,8,4),(6,2),(6),(8,8,4),(4,8,8,4),(6),\\& (2,6,2),(8,4,4,8,4),(8,8,0),(2,6),(6),(8,4,4,8,4),\\&(8,8),(6),(6)\}。\end{aligned} $
2)在LLLWBC算法的解密方向,利用算法6计算LLLWBC算法解密方向每一轮的字传播轨迹为
$ \begin{aligned}&{\boldsymbol{C}}^{0,2}=(0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0)\;,\\&{\boldsymbol{C}}^{1,2} =(0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0)\;,\\&{\boldsymbol{C}}^{2,2} =(0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0)\;,\\&{\boldsymbol{C}}^{3,2} =(0,1,0,0,1,0,1,0,1,1,0,1,0,1,0,0)\;,\\&{\boldsymbol{C}}^{4,2} =(2,3,0,0,2,1,1,1,1,1,1,1,1,1,0,1)\;。\end{aligned} $
3)将由1)得到的字传播轨迹代入算法2,可得$ r_{2}^{\mathrm{e}}=5 $,$ {\phi }^{w}=\{3,6,11,14,15\} $;
4)将由2)得到的字传播轨迹代入算法3,可得$ r_{2}^{\mathrm{d}}=4 $,$ \varphi ^{2}=\{2,3,14\} $;
5)根据LLLWBC算法结构,可得
$ x_{2}^{5}=x_{0}^{4}=F(x_{4}^{3},x_{5}^{3})\oplus x_{6}^{3}=0{{\mathrm{x}}}2\cdot {x}_{4}^{3}\oplus {0{\mathrm{x}}}3\cdot x_{5}^{3}\oplus {x}_{6}^{3} \;。 $
由于在加密方向,$ {{\boldsymbol{A}}}^{3,2}=(0,1,0,0,1,0,1,0,1, 1,0,1,$$ 0,1,0,0) $,可得$ x_{2}^{0} $在$ x_{4}^{3} $,$ x_{5}^{3} $,$ x_{6}^{3} $中分别出现1次、0次和1次,根据置换函数的性质可得$ x_{6}^{3} $和$ x_{4}^{3} $是关于$ x_{2}^{0} $的置换函数,且$ x_{5}^{3} $的值与$ x_{2}^{0} $的值无关,可得如下关系:
$ \mathop{\oplus }\limits_{\begin{subarray}{c}x_{2}^{0}遍历{F}_{2}^{4}\\x_{0}^{0}\|x_{1}^{0}\|x_{3}^{0}\|,… ,\|x_{15}^{0}\in {F}_{2}^{60}\end{subarray}}{x}_{4}^{3}={0}^{4} \;,$
$ \mathop{\oplus }\limits_{\begin{subarray}{c}x_{2}^{0}遍历{F}_{2}^{4}\\x_{0}^{0}\|x_{1}^{0}\|x_{3}^{0}\|,… ,\|x_{15}^{0}\in {F}_{2}^{60}\end{subarray}}{x}_{5}^{3}={0}^{4} \;,$
$ \mathop{\oplus }\limits_{\begin{subarray}{c}x_{2}^{0}遍历{F}_{2}^{4}\\x_{0}^{0}\|x_{1}^{0}\|x_{3}^{0}\|,… ,\|x_{15}^{0}\in {F}_{2}^{60}\end{subarray}}{x}_{6}^{3}={0}^{4} \;。 $
由此可得$ x_{2}^{5} $关于$ x_{2}^{0} $也是平衡的,$ {\phi }^{w}=\{3,6,11,14, 15\}\cup \{2\}=\{2,3,6,11,14,15\} $。
6)最后得到关于$ x_{2}^{0} $的具体积分区分器形式为
$ \begin{split}& {\boldsymbol a}^{4}{\boldsymbol a}^{4}{{\boldsymbol{c}}}^{4}{{\boldsymbol{c}}}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{{\boldsymbol{c}}}^{4}{\boldsymbol a}^{4}\xrightarrow{9轮}\\&\quad {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}\;。\end{split} $
根据上述步骤,我们分别遍历$ 0\leq w\leq 15 $,得到最长的9轮积分区分器轮数,得到的$ r_{w}^{\mathrm{d}} $,$ r_{w}^{\mathrm{e}} $,$ {\phi }^{w} $,$ {\varphi }^{w} $的数值以及对应的积分区分器的形式如表4和表5所示。
在对密码算法进行密钥恢复时,首先需要构建出r轮的积分区分器,假设区分器输出中平衡字下标构成的集合为B。随后,构建与区分器相关的明文数据集M,加密$ r+R $轮后得到内部状态$ {\boldsymbol{X}}^{r+R} $构成的集合$ {\boldsymbol{C}}^{r+R} $。然后,根据算法结构猜测与扩展的R轮相关的密钥,对$ {\boldsymbol{X}}^{r+R} $中的部分字在$ {\boldsymbol{C}}^{r+R} $上进行解密R轮,能够计算得到$ {\boldsymbol{X}}^{r} $中部分位置的值,构成的数据集为$ {\boldsymbol{C}}^{r} $。如果数据集$ {\boldsymbol{C}}^{r} $中每个字都是平衡的,则猜测的密钥可能是正确的,否则,猜测的密钥一定是错误的。假设$ {\boldsymbol{C}}^{r} $中每个元素由m个n比特的字构成,则上述过程执行1次可以恢复出$ m\times n $比特的密钥信息。上述过程是积分攻击中最基本的密钥恢复方法,然而,需要猜测哪些位置的密钥、扩展的R轮中需要确定哪些内部状态的值以及利用积分区分器哪些平衡的位置,这些因素对积分攻击的密钥恢复的复杂度以及最终攻击的轮数具有较大的影响。因此,如何选取出最优的猜测路径是需要解决的问题。针对这个问题,本节主要研究如何根据算法的结构搜索最优的密钥猜测路径。
以LLLWBC为例,当轮数$ 1\leq {r}\leq 10 $时,第r轮解密方向的代数表达式为
$ \left\{\begin{aligned}&x_{0}^{r-1}=x_{2}^{r},\;\; x_{1}^{r-1}=x_{7}^{r}\;,\\&x_{2}^{r-1}=S(2\cdot S(x_{2}^{r})\oplus 3\cdot S(x_{7}^{r}))\oplus {k}_{0,0}^{r-1}\oplus x_{12}^{r}\;,\\&x_{3}^{r-1}=S(2\cdot S(x_{2}^{r})\oplus 3\cdot S(x_{7}^{r}))\oplus k_{0,1}^{r-1}\oplus x_{8}^{r}\;,\\&x_{4}^{r-1}=x_{10}^{r},\;\; x_{5}^{r-1}=x_{14}^{r}\;,\\&x_{6}^{r-1}=S(2\cdot S(x_{10}^{r})\oplus 3\cdot S(x_{14}^{r}))\oplus k_{1,0}^{r-1}\oplus x_{0}^{r}\;,\\&x_{7}^{r-1}=S(2\cdot S(x_{10}^{r})\oplus 3\cdot S(x_{14}^{r}))\oplus k_{1,1}^{r-1}\oplus x_{5}^{r}\;,\\&x_{8}^{r-1}=x_{15}^{r},\;\; x_{9}^{r-1}=x_{11}^{r}\;,\\&x_{10}^{r-1}=S(2\cdot S(x_{15}^{r})\oplus 3\cdot S(x_{11}^{r}))\oplus k_{2,0}^{r-1}\oplus x_{4}^{r}\;,\\&x_{11}^{r-1}=S(2\cdot S(x_{15}^{r})\oplus 3\cdot S(x_{11}^{r}))\oplus k_{2,1}^{r-1}\oplus x_{1}^{r}\;,\\&x_{12}^{r-1}=x_{3}^{r},\;\;x_{13}^{r-1}=x_{6}^{r}\;,\\&x_{14}^{r-1}=S(2\cdot S(x_{3}^{r})\oplus 3\cdot S(x_{6}^{r}))\oplus k_{3,0}^{r-1}\oplus x_{13}^{r}\;,\\&x_{15}^{r-1}=S(2\cdot S(x_{3}^{r})\oplus 3\cdot S(x_{6}^{r}))\oplus k_{3,1}^{r-1}\oplus x_{9}^{r}\;。\end{aligned}\right. $
当$ 11\leq r\leq 20 $时,第r轮解密方向的代数表达式为
$ \left\{\begin{aligned}& x_{0}^{r-1}=x_{6}^{r},\;\; x_{1}^{r-1}=x_{11}^{r}\;,\\&x_{2}^{r-1}=S(2\cdot S(x_{6}^{r})\oplus 3\cdot S(x_{11}^{r}))\oplus k_{0,0}^{r-1}\oplus x_{0}^{r}\;,\\&x_{3}^{r-1}=S(2\cdot S(x_{6}^{r})\oplus 3\cdot S(x_{11}^{r}))\oplus k_{0,1}^{r-1}\oplus x_{12}^{r}\;,\\&x_{4}^{r-1}=x_{10}^{r},\;\; x_{5}^{r-1}=x_{7}^{r}\;,\\&x_{6}^{r-1}=S(2\cdot S(x_{10}^{r})\oplus 3\cdot S(x_{7}^{r}))\oplus k_{1,0}^{r-1}\oplus x_{13}^{r}\;,\\&x_{7}^{r-1}=S(2\cdot S(x_{10}^{r})\oplus 3\cdot S(x_{7}^{r}))\oplus k_{1,1}^{r-1}\oplus x_{1}^{r}\;,\\&x_{8}^{r-1}=x_{3}^{r},\;\; x_{9}^{r-1}=x_{15}^{r}\;,\\&x_{10}^{r-1}=S(2\cdot S(x_{3}^{r})\oplus 3\cdot S(x_{15}^{r}))\oplus k_{2,0}^{r-1}\oplus x_{4}^{r}\;,\\&x_{11}^{r-1}=S(2\cdot S(x_{3}^{r})\oplus 3\cdot S(x_{15}^{r}))\oplus k_{2,1}^{r-1}\oplus x_{9}^{r}\;,\\&x_{12}^{r-1}=x_{2}^{r},\;\; x_{13}^{r-1}=x_{14}^{r}\;,\\&x_{14}^{r-1}=S(2\cdot S(x_{2}^{r})\oplus 3\cdot S(x_{14}^{r}))\oplus k_{3,0}^{r-1}\oplus x_{5}^{r}\;,\\&x_{15}^{r-1}=S(2\cdot S(x_{2}^{r})\oplus 3\cdot S(x_{14}^{r}))\oplus k_{3,1}^{r-1}\oplus x_{8}^{r}\;。\end{aligned}\right. $
在第10轮解密方向上,存在如下的表达式:
$ x_{2}^{9}=x_{12}^{10}\oplus S(2\cdot S(x_{2}^{10})\oplus 3\cdot S(x_{7}^{10}))\oplus k_{0,0}^{9} \;。 $
假设攻击者通过猜测密钥能够得到中间状态$ x_{12}^{10} $,$ x_{2}^{10} $,$ x_{7}^{10} $的值,此时再次猜测密钥$ k_{0,0}^{9} $的值,根据式(17),能够猜测确定$ x_{2}^{9} $的值。然而,当积分区分器扩展的轮数较多,直接通过手动推导上述的解密过程较为繁琐,且容易出现错误。为此,本节重点研究了基于MILP的密钥猜测路径搜索的问题。
主要以LLLWBC算法为例。首先,定义模型变量$ {\boldsymbol{a}}^{r-1}=({a}_{0}^{r-1},{a}_{1}^{r-1},{a}_{2}^{r-1},… ,{a}_{14}^{r-1},{a}_{15}^{r-1}) $表示第r轮函数的输入状态的值$ {{X}}^{r-1} $是否能够被猜测确定,其中模型变量$ a_{i}^{r-1} $与$ x_{i}^{r-1} $相对应$ (0\leq i\leq 15) $。$ a_{i}^{r-1} $为二元模型变量,当$ a_{i}^{r-1} $的值为1时,说明$ x_{i}^{r-1} $的数值能够被猜测确定;否则,$ x_{i}^{r-1} $的值不能被猜测确定。定义模型变量$ {{\boldsymbol{K}}}^{r-1}=(K_{0,0}^{r-1},K_{0,1}^{r-1},K_{1,0}^{r-1},K_{1,1}^{r-1},K_{2,0}^{r-1},K_{2,1}^{r-1},K_{3,0}^{r-1}, K_{3,1}^{r-1})$表示第r轮函数中使用的密钥$ {\boldsymbol{k}}^{r-1}=(k_{0,0}^{r-1},k_{0,1}^{r-1}, k_{1,0}^{r-1}, k_{1,1}^{r-1}, k_{2,0}^{r-1}, k_{2,1}^{r-1}, k_{3,0}^{r-1}, k_{3,1}^{r-1}) $是否被猜测,$ {k}_{i,0}^{r-1}\in F_{2}^{4} $表示$ {k}_{i}^{r-1} $的高4位,$ {k}_{i,1}^{r-1}\in F_{2}^{4} $表示$ {k}_{i}^{r-1} $的低4位。$ {K}_{i,{j}}^{r-1} $为二元模型变量,当$ K_{i,j}^{r-1} $的值为1时,表示密钥比特$ k_{i,j}^{r-1} $的数值需要被猜测$ (0\leq i\leq 3 $,$ 0\leq j\leq 1 )$;当$ K_{i,j}^{r-1} $的值为0时,表示密钥比特$ {k}_{i,{j}}^{r-1} $的数值不需要被猜测。在对LLLWBC算法进行密钥恢复攻击时,考虑简化轮的LLLWBC算法的最后1轮需要经过白化密钥,定义白化密钥对应的模型变量为$ {{\boldsymbol{K}}}^{\mathrm{b}}=(K_{0}^{\mathrm{b}},K_{1}^{\mathrm{b}},… ,K_{15}^{\mathrm{b}}) $。
当$ K_{i}^{\mathrm{b}} $的值为1时,表示后白化密钥中的第i个字$ k_{\mathrm{e},i}^{w} $的数值需要被猜测$ (0\leq i\leq 15) $;否则,不需要被猜测。
根据上述定义的模型变量及其含义,结合式(15)(16),可以使用如下的限制条件构建LLLWBC算法的密钥猜测轨迹:
当$ 1\leq r\leq 10 $时,基于式(15)构建MILP模型。对于第r轮内部状态存在的如下等式:
$ \left\{\begin{aligned}&x_{0}^{r-1}=x_{2}^{r}\;,\\&x_{1}^{r-1}=x_{7}^{r}\;,\\&x_{4}^{r-1}=x_{10}^{r}\;,\\&x_{5}^{r-1}=x_{14}^{r}\;,\\&x_{8}^{r-1}=x_{15}^{r}\;,\\&x_{9}^{r-1}=x_{11}^{r}\;,\\&x_{12}^{r-1}=x_{3}^{r}\;,\\&x_{13}^{r-1}=x_{6}^{r}\;。\end{aligned}\right. $
可得到如式(19)的模型变量之间的关系。
$ \left\{\begin{aligned}& a_{0}^{r-1}=a_{2}^{r}\;,\\&a_{1}^{r-1}=a_{7}^{r}\;,\\&a_{4}^{r-1}=a_{10}^{r}\;,\\&a_{5}^{r-1}=a_{14}^{r}\;,\\&a_{8}^{r-1}=a_{15}^{r}\;,\\&a_{9}^{r-1}=a_{11}^{r}\;,\\&a_{12}^{r-1}=a_{3}^{r}\;,\\&a_{13}^{r-1}=a_{6}^{r}\;。\end{aligned}\right. $
对于第r轮内部状态存在的如下等式:
$ \left\{\begin{aligned}&x_{2}^{r-1}=S(2\cdot S(x_{2}^{r})\oplus 3\cdot S(x_{7}^{r}))\oplus k_{0,0}^{r-1}\oplus x_{12}^{r}\;,\\&x_{3}^{r-1}=S(2\cdot S(x_{2}^{r})\oplus 3\cdot S(x_{7}^{r}))\oplus k_{0,1}^{r-1}\oplus x_{8}^{r}\;,\\&x_{6}^{r-1}=S(2\cdot S(x_{10}^{r})\oplus 3\cdot S(x_{14}^{r}))\oplus k_{1,0}^{r-1}\oplus x_{0}^{r}\;,\\&x_{7}^{r-1}=S(2\cdot S(x_{10}^{r})\oplus 3\cdot S(x_{14}^{r}))\oplus k_{1,1}^{r-1}\oplus x_{5}^{r}\;,\\&x_{10}^{r-1}=S(2\cdot S(x_{15}^{r})\oplus 3\cdot S(x_{11}^{r}))\oplus k_{2,0}^{r-1}\oplus x_{4}^{r}\;,\\&x_{11}^{r-1}=S(2\cdot S(x_{15}^{r})\oplus 3\cdot S(x_{11}^{r}))\oplus k_{2,1}^{r-1}\oplus x_{1}^{r}\;,\\&x_{14}^{r-1}=S(2\cdot S(x_{3}^{r})\oplus 3\cdot S(x_{6}^{r}))\oplus k_{3,0}^{r-1}\oplus x_{13}^{r}\;,\\&x_{15}^{r-1}=S(2\cdot S(x_{3}^{r})\oplus 3\cdot S(x_{6}^{r}))\oplus k_{3,1}^{r-1}\oplus x_{9}^{r}\;。\end{aligned}\right. $
在式(20)中,当每一个等式等号右面的变量全部猜测确定后,等号左面变量的值才能确定。以式(20)中的第1个等式为例,当$ x_{2}^{r} $,$ x_{7}^{r} $,$ x_{12}^{r} $的值被猜测确定,并且猜测了子密钥$ {k}_{0,0}^{r-1} $后,$ x_{2}^{r-1} $的值才能够被确定。对应的模型变量则存在如下的关系:
如果$ a_{2}^{r} $,$ a_{7}^{r} $,$ a_{12}^{r} $,$ K_{0,0}^{r-1} $同时为1,则$ a_{2}^{r-1} $一定为1;否则$ a_{2}^{r-1} $为0。
上述关系表示如下:
$ \begin{aligned} guess &(a_{2}^{r},a_{7}^{r},a_{12}^{r},K_{0,0}^{r-1},a_{2}^{r-1})=\\&\left\{\begin{aligned}& a_{2}^{r-1}\geq a_{2}^{r}+a_{7}^{r}+a_{12}^{r}+K_{0,0}^{r-1}-3\;,\\&a_{2}^{r-1}\leq a_{2}^{r}\;,\\&a_{2}^{r-1}\leq a_{7}^{r} \;,\\&a_{2}^{r-1}\leq a_{12}^{r}\;,\\&a_{2}^{r-1}\leq K_{0,0}^{r-1}\;。\end{aligned}\right. \end{aligned}$
在式(21)中,第1行表示如果$ a_{2}^{r},a_{7}^{r},a_{12}^{r},K_{0,0}^{{r-}1} $同时为1,则$ a_{2}^{r-1} $一定为1;第2~4行表示当$ a_{2}^{r},a_{7}^{r},a_{12}^{r},K_{0,0}^{{r-}1} $其中1个为0时,$ a_{2}^{r{-}1} $一定为0。式(21)中的限制关系本文使用函数$ guess(a_{2}^{r},a_{7}^{r},a_{12}^{r},K_{0,0}^{r-1},a_{2}^{r-1}) $表示。根据上述描述,可以设计出LLLWBC算法的第r轮密钥猜测轨迹模型,具体如算法7所示。
算法7. LLLWBC算法的第r轮的密钥猜测轨迹模型:guess_key(M,r)。
输入:MILP模型M,轮数r。
① 定义二元MILP模型变量: $ {M}{.var}\leftarrow {a}^{r-1}=\{a_{0}^{r-1},a_{1}^{r-1},a_{2}^{r-1},… ,a_{14}^{r-1}, $$ a_{15}^{r-1}\} $;
② 定义二元MILP模型变量: $ {M}{.var}\leftarrow {a}^{r}=\{a_{0}^{r},a_{1}^{r},a_{2}^{r},… ,a_{14}^{r},a_{15}^{r}\} $;
③ 定义二元MILP模型变量: $ {M}{.var}\leftarrow {K}^{r-1}=\{K_{0,0}^{r-1},K_{0,1}^{r-1},K_{1,0}^{r-1},K_{1,1}^{r-1},K_{2,0}^{r-1}, $ $K_{2,1}^{r-1}, K_{3,0}^{r-1},K_{3,1}^{r-1}\} $;
④ for $ 1\leq r\leq 10 $ do
⑤  $ M.con\leftarrow a_{0}^{r-1}=a_{2}^{r};a_{1}^{r-1}=a_{7}^{r} $;
⑥  $ M.con\leftarrow guess(a_{2}^{r},a_{7}^{r},a_{12}^{r},K_{0,0}^{r-1},a_{2}^{r-1}) $;
⑦  $ M.con\leftarrow guess(a_{2}^{r},a_{7}^{r},a_{8}^{r},K_{0,1}^{r-1},a_{3}^{r-1}) $;
⑧  $ M.con\leftarrow a_{4}^{r-1}=a_{10}^{r};a_{5}^{r-1}=a_{14}^{r} $;
⑨  $ M.con\leftarrow guess(a_{10}^{r},a_{14}^{r},a_{0}^{r},K_{1,0}^{r-1},a_{6}^{r-1}) $;
⑩  $ M.con\leftarrow guess(a_{10}^{r},a_{14}^{r},a_{5}^{r},K_{1,1}^{r-1},a_{7}^{r-1}) $;
⑪  $ M.con\leftarrow a_{8}^{r-1}=a_{15}^{r};a_{9}^{r-1}=a_{11}^{r} $;
⑫  $ M.con\leftarrow guess(a_{15}^{r},a_{11}^{r},a_{4}^{r},K_{2,0}^{r-1},a_{10}^{r-1}) $;
⑬  $ M.con\leftarrow guess(a_{15}^{r},a_{11}^{r},a_{1}^{r},K_{2,1}^{r-1},a_{11}^{r-1}) $;
⑭  $ M.con\leftarrow a_{12}^{r-1}=a_{3}^{r};a_{13}^{r-1}=a_{6}^{r} $;
⑮  $ M.con\leftarrow guess(a_{3}^{r},a_{6}^{r},a_{13}^{r},K_{3,0}^{r-1},a_{14}^{r-1}) $;
⑯  $ M.con\leftarrow guess(a_{3}^{r},a_{6}^{r},a_{9}^{r},K_{3,1}^{r-1},a_{15}^{r-1}) $;
⑰ end for
⑱ for $ 11\leq r\leq 20 $ do
⑲  $ M.con\leftarrow a_{0}^{r-1}=a_{6}^{r};a_{1}^{r-1}=a_{11}^{r} $;
⑳  $ M.con\leftarrow guess(a_{6}^{r},a_{11}^{r},a_{0}^{r},K_{0,0}^{r-1},a_{2}^{r-1}) $;
㉑  $ M.con\leftarrow guess(a_{6}^{r},a_{11}^{r},a_{12}^{r},K_{0,1}^{r-1},a_{3}^{r-1}) $;
㉒  $ M.con\leftarrow a_{4}^{r-1}=a_{10}^{r};a_{5}^{r-1}=a_{7}^{r} $;
㉓  $ M.con\leftarrow guess(a_{10}^{r},a_{7}^{r},a_{13}^{r},K_{1,0}^{r-1},a_{6}^{r-1}) $;
㉔  $ M.con\leftarrow guess(a_{10}^{r},a_{7}^{r},a_{1}^{r},K_{1,1}^{r-1},a_{7}^{r-1}) $;
㉕  $ M.con\leftarrow a_{8}^{r-1}=a_{3}^{r};a_{9}^{r-1}=a_{15}^{r} $;
㉖  $ M.con\leftarrow guess(a_{3}^{r},a_{15}^{r},a_{4}^{r},K_{2,0}^{r-1},a_{10}^{r-1}) $;
㉗  $ M.con\leftarrow guess(a_{3}^{r},a_{15}^{r},a_{9}^{r},K_{2,1}^{r-1},a_{11}^{r-1}) $;
㉘  $ M.con\leftarrow a_{12}^{r-1}=a_{2}^{r};a_{13}^{r-1}=a_{14}^{r} $;
㉙  $ M.con\leftarrow guess(a_{2}^{r},a_{14}^{r},a_{5}^{r},K_{3,0}^{r-1},a_{14}^{r-1}) $;
㉚  $ M.con\leftarrow guess(a_{2}^{r},a_{14}^{r},a_{8}^{r},K_{3,1}^{r-1},a_{15}^{r-1}) $;
㉛ end for
在算法7中,行①②分别定义了第r轮的LLLWBC算法输入和输出对应的模型变量,行③定义了LLLWBC算法第r轮密钥对应的模型变量。当$ 1\leq r\leq 10 $时,执行算法的行④~⑰来构建LLLWBC算法的第r轮函数的密钥猜测轨迹模型,这部分算法的设计主要是基于式(15)并结合式(19)(21)。对于LLLWBC算法,当$ 11\leq r\leq 20 $时,轮函数的线性部件使用的是$ {P}^{-1} $置换,此时执行算法的行⑱~㉛,构建LLLWBC算法的密钥猜测轨迹。
如果得到的积分区分器为$ {r}_{1} $轮,并向加密方向继续扩展了$ {r}_{2} $轮。此时,攻击者的目标是对$ {r}_{1}+{r}_{2} $轮加密的LLLWBC算法进行密钥恢复攻击。为了进行密钥恢复,攻击者需要猜测白化密钥和扩展的$ {r}_{2} $轮中涉及到的密钥,并从第$ {r}_{1}+{r}_{2} $轮解密到$ {r}_{1} $轮,根据解密后数据集的性质是否与区分器的输出匹配,确定猜测的密钥是否正确。同时,由于第$ {r}_{1}+{r}_{2} $轮的输出与白化密钥异或后得到的是简化轮的密码算法的输出,且简化轮的输出在攻击的过程中是已知的,当攻击者猜测白化密钥第i个字的值时,即模型变量$ K_{i}^{{\mathrm{b}}} $的值为1,此时加密$ {r}_{1}+{r}_{2} $轮后内部状态的第i个字节的值也一定是能够通过猜测确定,即模型变量$ a_{i}^{{r}_{1}+{r}_{2}} $的值为1。因此,存在如下的关系:
$ K_{i}^{{\mathrm{b}}}=a_{i}^{{r}_{1}+{r}_{2}} ,\;\; 0\leq i\leq 15 \;。$
在进行密钥恢复的过程中,攻击者通常希望猜测的密钥比特最少,这样密钥恢复需要的时间复杂度也是最小。为了达到这样的目的,在MILP模型中需要加入目标函数:
$ M.{opti}mize\leftarrow \min \left(\displaystyle\sum \limits_{r={r}_{1}+1}^{ \\r ={r}_{1}+{r}_{2}}\displaystyle\sum \limits_{i=0}^{i=3}\displaystyle\sum \limits_{j=0}^{j=1}K_{i,j}^{r-1}+\displaystyle\sum \limits_{i=0}^{15}K_{i}^{{\mathrm{b}}}\right) \;,$
结合式(22),可得
$ M.{opti}mize\leftarrow \min \left(\displaystyle\sum \limits_{r={r}_{1}+1}^{ r ={r}_{1}+{r}_{2}}\displaystyle\sum \limits_{i=0}^{i=3}\displaystyle\sum \limits_{j=0}^{j=1}K_{i,j}^{r-1}+\displaystyle\sum \limits_{i=0}^{15}a_{i}^{{r}_{1}+{r}_{2}}\right) \;。 $
根据上述讨论,基于算法7,我们设计了算法8用于检测对$ {r}_{1}+{r}_{2} $轮的LLLWBC算法进行密钥恢复攻击需要猜测的最少的密钥比特。
算法8. 检测对$ {r}_{1}+{r}_{2} $轮的LLLWBC算法进行密钥恢复攻击需要猜测的最少的密钥比特。
输入:$ {r}_{1} $轮积分区分器中用于密钥恢复攻击的平衡字的下标集合BT;
输出:目标函数的值d,模型变量$ {{\boldsymbol{K}}}^{{{r}_{1}}},{{\boldsymbol{K}}}^{{{r}_{1}}+1},{{\boldsymbol{K}}}^{{{r}_{1}}+2}, $$ … ,{{\boldsymbol{K}}}^{{{r}_{1}}+{{r}_{2}}-1},{\boldsymbol{a}}^{{r}_{1}+{r}_{2}} $的数值。
① 定义空的MILP模型M;
② for i in BT
③  $ a_{i}^{{r}_{1}}=1 $;
④ end for
⑤ for (r =$ {r}_{1}+1 $; r = r + 1; $ r\leq {r}_{1}+{r}_{2} $)
⑥  guess_key(M,r);/*算法7*/
⑦ end for
⑧ 向模型M中添加目标函数 $ \min \left(\displaystyle\sum \limits_{r={r}_{1}+1}^{ r ={r}_{1}+{r}_{2} }\displaystyle\sum \limits_{i=0}^{i=3}\displaystyle\sum \limits_{j=0}^{j=1}K_{i,j}^{r-1}+\displaystyle\sum \limits_{i=0}^{15}a_{i}^{{r}_{1}+{r}_{2}}\right) $;
⑨ 利用求解工具对MILP模型进行求解;
⑩ return 目标函数的值d和此时模型变量$ {\boldsymbol{K}}^{{r}_{1}}, $ $ {\boldsymbol{K}}^{{r}_{1}+1},{\boldsymbol{K}}^{{r}_{1}+2},… ,{\boldsymbol{K}}^{{r}_{1}+{r}_{2}-1},{\boldsymbol{a}}^{{r}_{1}+{r}_{2}} $的数值。
在算法8中输入的参数BT为$ {r}_{1} $轮积分区分器中用于密钥恢复攻击的平衡字的下标集合,这主要是由于在进行密钥恢复攻击的过程中,攻击者为了达到最大的分析轮数且复杂度不超过穷举攻击,可能会只选取积分区分器中的部分平衡的输出位置进行密钥恢复攻击。例如,攻击者得到$ {r}_{1} $轮的积分区分器中平衡字的下标位置为0, 1, 2, …, 9,攻击者可以从集合{0, 1, 2, …, 9}中任选出w个数作为密钥恢复攻击过程需要利用到的平衡的位置,此时攻击者需要在第$ {r}_{1}+1 $轮至第$ {r}_{1}+{r}_{2} $轮中猜测合适的子密钥,使得加密后的密文能够部分解密$ {r}_{2} $轮,并得到攻击者选取的平衡中间状态。因此,算法8在MILP模型M中加入了行②~④的限制条件,这些限制条件用于确保通过猜测$ {{\boldsymbol{K}}}^{{{r}_{1}}},{{\boldsymbol{K}}}^{{{r}_{1}}+1},{{\boldsymbol{K}}}^{{{r}_{1}}+2},… ,{{\boldsymbol{K}}}^{{{r}_{1}}+{{r}_{2}}-1},{\boldsymbol{a}}^{{r}_{1}+{r}_{2}} $中为1的位置对应的密钥,密码分析者能够确定满足$ a_{i}^{{r}_{1}}=1 $对应的内部状态$ x_{i}^{{r}_{1}} $的值。
利用表5中的第1个9轮积分区分器进行密钥恢复攻击,具体的区分器形式为:
$ \begin{split}& {\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol a}^{4}{\boldsymbol c}^{4}{\boldsymbol a}^{4}\xrightarrow{9轮}\\&\quad {\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol u}^{4}{\boldsymbol u}^{4}{\boldsymbol b}^{4}{\boldsymbol b}^{4}\;。\end{split} $
通过测试发现,当只使用该区分器输出的第2个平衡字节对12轮的LLLWBC算法进行密钥恢复攻击需要的复杂度小于穷举密钥需要的时间时,其他情况将超过穷举密钥的时间复杂度。因此,在后续的密钥恢复攻击中,我们只关注式(23)中积分区分器的第2个平衡字。此时,需要按照算法8中的行②~④在MILP模型中加入如下的限制条件
$ {M}{.con}\leftarrow a_{2}^{9}=1 \;。$
然后,利用算法8,可得目标函数的值为19,最优解对应的模型变量的值为
$ \begin{aligned}&{{\boldsymbol{K}}}^{9}=\left(1,0,0,0,0,0,0,0\right)\;,\\&{{\boldsymbol{K}}}^{10} = \left(1,0,0,1,0,0,0,0\right)\;,\\&{{\boldsymbol{K}}}^{11} =\left(1,0,1,1,1,1,0,0\right)\;,\\&{\boldsymbol{a}}^{12} =\left(1,1,0,1,1,0,1,1,0,1,1,1,0,1,0,1\right)。\end{aligned} $
根据上述论述得到的结果为:
对于第10轮,需要猜测的轮密钥字为$ k_{0,0}^{9} $,$ k_{0,0}^{9} $只与主密钥中的$ k_{24}^{} $相关;
对于第11轮,需要猜测的轮密钥字为$ k_{0,0}^{10} $和$ k_{1,1}^{10} $,$ k_{0,0}^{10} $只与主密钥中的$ k_{16}^{} $相关,$ k_{1,1}^{10} $只与主密钥中的$ k_{19}^{} $相关;
对于第12轮,需要猜测的轮密钥字为$ k_{0,0}^{11} $,$ k_{1,0}^{11} $,$ k_{1,1}^{11} $,$ k_{2,0}^{11} $,$ k_{2,1}^{11} $,这些密钥字只与主密钥中的$ k_{24}^{} $,$ k_{26}^{} $,$ k_{27}^{} $,$ k_{28}^{} $,$ k_{29}^{} $相关。
因此和轮密钥相关的主密钥集合为{$ k_{16}^{} $,$ k_{19}^{} $,$ k_{24}^{} $,$ k_{26}^{} $,$ k_{27}^{} $,$ k_{28}^{} $,$ k_{29}^{} $},需要猜测的主密钥是28b,而对于后白化密钥,根据模型变量$ {\boldsymbol{a}}^{12} $的值,可以确定需要猜测的后白化密钥密钥为$ \{k_{\mathrm{e},0}^{\mathrm{w}},k_{\mathrm{e},1}^{\mathrm{w}},k_{\mathrm{e},3}^{\mathrm{w}},k_{\mathrm{e},4}^{\mathrm{w}},k_{\mathrm{e},6}^{\mathrm{w}}, $$ k_{\mathrm{e},7}^{\mathrm{w}},k_{\mathrm{e},9}^{\mathrm{w}},k_{\mathrm{e},10}^{\mathrm{w}}, k_{\mathrm{e},11}^{\mathrm{w}},k_{\mathrm{e},13}^{\mathrm{w}},k_{\mathrm{e},15}^{\mathrm{w}}\} $,由$ k_{\mathrm{e}}^{\mathrm{w}}=(k^{\mathrm{w}} \ggg 1)\oplus $$ (k^{\mathrm{w}} \gg 63) $可得,需要猜测的主密钥是44b。
综上所述,需要猜测的主密钥是72b,即猜测的密钥空间为$ {2}^{72} $。然后,利用式(23)中的区分器形式构建明文集合,并进行12轮的LLLWBC算法的加密,得到简化轮的密文集合。随后,猜测72b的密钥信息,对简化轮的密文集合进行解密。最后,判断第9轮的第2个字是否平衡。如果是不平衡的,说明猜测的密钥错误;如果是平衡的,说明猜测的密钥可能是正确的。由于错误的密钥使得$ x_{2}^{9} $是平衡的概率为$ {2}^{-4} $,上述过程执行1次能够恢复4b的密钥信息。经过18组的明文筛选后,能够恢复出72b的密钥信息。剩余的56b密钥信息可以通过穷举搜索得到。LLLWBC算法解密3轮的时间复杂度是$ {2}^{52}\times ({2}^{72}+{2}^{68}+{2}^{64}+ {2}^{60}+… +{2}^{8}+{2}^{4})\approx {2}^{124.09} $次3轮LLLWBC加密,等价于进行$ {2}^{124.09}/4={2}^{122.09} $次12轮LLLWBC加密。因此,该密钥恢复需要的总时间复杂度为$ {2}^{56}+{2}^{122.09}\approx {2}^{122.09} $次12轮LLLWBC加密,数据复杂度为$ 18\times {2}^{52}= {2}^{56.17} $个64b明文数据,存储复杂度为$ {2}^{72} $个128b的密钥和为$ {2}^{52} $个64b的密文数据。
本文围绕新型低延迟轻量级分组密码 LLLWBC 的安全性展开系统研究,提出了一种基于代数结构的新型自动化积分分析框架。与传统依赖人工推导或单一可分性建模的方法相比,本文在代数结构搜索过程中同时统计明文字出现的次数和分量传播至密文需经过的S盒个数,据此定义并构造新型字传播轨迹,实现了对候选代数结构的自动化检测与筛选,并能够直接生成可用的积分区分器,有效缓解了在高轮数下代数结构复杂度急剧增长所带来的难题。在实验评估中,本文在13个活跃字条件下成功构造出9轮积分区分器,相较于设计者提出的8轮区分器提升了1轮。
进一步地,本文针对密钥恢复问题提出了一种基于MILP的密钥猜测路径优化建模方法。该方法依据轮函数结构与密钥编排原理构建密钥恢复的MILP模型,用代数约束刻画中间状态与子密钥的依赖关系,最后通过求解模型得到最优的密钥猜测路径。基于该模型,本文实现了对12轮LLLWBC的密钥恢复攻击,其数据复杂度为$ {2}^{56.17} $个64b明文数据,存储复杂度为$ {2}^{72} $个128b的密钥和$ {2}^{52} $个64b的密文数据,时间复杂度为$ {2}^{122.09} $次12轮加密操作。
本文提出了积分区分器自动化搜索方法与基于MILP建模的密钥恢复策略,能够为广义Feistel结构与大状态轻量级分组密码的安全评估提供高效、通用的分析工具。未来工作可进一步探索该方法在其他轻量级密码算法上的应用。

参考文献 引证文献
排序方式:
1
Zhang Lei, Wu Ruichen, Zhang Yuhan, et al. LLLWBC: A new low-latency light-weight block cipher[C]//Proc of the 19th Int Conf on Information Security and Cryptology. Berlin: Springer, 2023: 23−42
2
Biham E, Shamir A. Differential cryptanalysis of DES-like cryptosystems[J]. Journal of Cryptology, 1991, 4(1): 3−72
3
Matsui M. Linear cryptanalysis method for DES cipher[C]//Proc of the 12th Workshop on the Theory and Application of Cryptographic Techniques. Berlin: Springer, 1993: 386−397
4
Demirci H, Selcuk A. A meet-in-the-middle attack on 8-round AES[C]//Proc of the 15th Int Workshop on Fast Software Encryption. Berlin: Springer, 2008: 116−126
5
Armknecht F, Krause M. Algebraic attacks on combiners with memory[C]//Proc of the 23rd Annual Int Cryptology Conf. Berlin: Springer, 2003: 162−175
6
Knudsen L, Wagner D. Integral cryptanalysis[C]//Proc of the 9th Int Workshop on Fast Software Encryption. Berlin: Springer, 2002: 112−127
7
Todo Y. Structural evaluation by generalized integral property[C]//Proc of the 34th Annual Int Conf on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2015: 287−314
8
Todo Y, Morii M. Bit-based division property and application to SIMON family[C]//Proc of the 23rd Int Conf on Fast Software Encryption. Berlin: Springer, 2016: 357−377
9
Xiang Zejun, Zhang Wentao, Bao Zhenzhen, et al. Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers[C]//Proc of the 23rd Int Conf on Fast Software Encryption. Berlin: Springer, 2016: 357−377
10
Hu Kai, Wang Meiqin. Automatic search for a variant of division property using three subsets[C]//Proc of the 19th Cryptographers’ Track at the RSA Conf. Berlin: Springer, 2019: 412−432
11
Hao Yonglin, Leader G, Meier W, et al. Modeling for three-subset division property without unknown subsets[C]//Proc of the 39th Annual Int Conf on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2020: 466−495
12
Hu Kai, Sun Siwei, Wang Meiqin, et al. An algebraic formulation of the division property: Revisiting degree evaluations, cube attacks, and key-independent sums[C]//Proc of the 26th Advances in Cryptology (ASIACRYPT 2020). Berlin: Springer, 2020: 446−476
13
Cui Jiamin, Hu Kai, Wang Qingju, et al. Integral attacks on Pyjamask-96 and round-reduced Pyjamask-128[C]//Proc of the 22nd Cryptographers’ Track at the RSA Conf. Berlin: Springer, 2022: 223−246
14
Chakraborty D. Finding three-subset division property for ciphers with complex linear layers[C]//Proc of the 23rd Progress in Cryptology (INDOCRYPT 2022). Berlin: Springer, 2023: 398−421
15
Zhang Wenying, Cao Meichun, Guo Jian, et al. Improved security evaluation of SPN block ciphers and its applications in the single-key attack on SKINNY[J]. IACR Transactions on Symmetric Cryptology, 2019, 2019(4): 171−191
16
叶涛, 韦永壮, 李灵琛. ACE密码算法的积分分析[J]. 电子与信息学报, 2021, 43(4): 908−914
Ye Tao, Wei Yongzhuang, Li Lingchen. Integral cryptanalysis of ACE encryption algorithm[J]. Journal of Electronics & Information Technology, 2021, 43(4): 908−914 (in Chinese)
17
邢朝辉, 张文英, 曹梅春. 基于代数结构视角对轻量分组密码WARP的积分分析[J]. 计算机研究与发展, 2023, 60(4): 860−872
Xing Zhaohui, Zhang Wenying, Cao Meichun. Integral cryptanalysis on lightweight block cipher WARP based on the algebraic structure perspective[J]. Journal of Computer Research and Development, 2023, 60(4): 860−872 (in Chinese)
18
Borghoff J, Canteaut A, Güneysu T, et al. PRINCE―A low-latency block cipher for pervasive computing applications[C]//Proc of the 32nd Workshop on the Theory and Application of Cryptographic Techniques. Berlin: Springer, 2012: 208−225
2026年第63卷第11期
106
48
0
引用本文
BibTeX
文章信息
doi: 10.7544/issn1000-1239.202550746
  • 接收时间:2025-10-14
  • 首发时间:2026-11-17
  • 出版时间:2026-11-01
补充材料
相关文章
文章信息
作者
出版历史
  • 收稿日期:2025-10-14
  • 修回日期:2026-06-12
  • 录用日期:2026-06-22
基金
作者信息
    1桂林电子科技大学计算机与信息安全学院 广西桂林 541004
    2密码科学技术国家重点实验室 北京 100878
    3广西密码学与信息安全重点实验室(桂林电子科技大学) 广西桂林 541004

通讯作者:

韦永壮()
参考文献
分享链接
https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/10.7544/issn1000-1239.202550746
分享至
全文二维码

扫描看全文

引用本文
BibTeX
本文的引用情况
2种不同金属材料的力学参数
科
Family
属数
Number of
genus
种数
Number of
species
占总种数比例
Percentage of
total species (%)
属
Genus
种数
Number of
species
占总种数比例
Percentage of total
species (%)
鹅膏菌科Amanitaceae 2 11 5.26 鹅膏菌属 Amanita 10 4.78
小菇科 Mycenaceae 2 12 5.74 丝盖伞属 Inocybe 5 2.39
多孔菌科 Polyporaceae 8 14 6.70 蜡蘑属 Laccaria 5 2.39
红菇科 Russulaceae 3 23 11.00 小皮伞属 Marasmius 6 2.87
小菇属 Mycena 11 5.26
光柄菇属 Pluteus 5 2.39
红菇属 Russula 17 8.13
栓菌属 Trametes 5 2.39
关闭全屏