Biclique Analysis on the Reduced-Round PRESENT

Q3 Computer Science
Gong Zheng, Liu Shusheng, Wen Yamin, Tang Shaohua
{"title":"Biclique Analysis on the Reduced-Round PRESENT","authors":"Gong Zheng, Liu Shusheng, Wen Yamin, Tang Shaohua","doi":"10.3724/SP.J.1016.2013.01139","DOIUrl":null,"url":null,"abstract":"Due to its excellent hardware performance and elegant design,the lightweight block cipher PRESENT attracts widely attention from both industry and academy society.In this paper,we present a new Biclique cryptanalysis on 21-round PRESENT,which can recover secret key with 278.9 time complexity and 264 chosen ciphertexts.Moreover,our Biclique attack can be extended to PRESENT-128 and the compression function of DM-PRESENT with the same rounds.Compared with the published results,our new Biclique analysis has the advantage on its memory complexity.","PeriodicalId":35776,"journal":{"name":"计算机学报","volume":"36 1","pages":"1139-1148"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"计算机学报","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.3724/SP.J.1016.2013.01139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 3

Abstract

Due to its excellent hardware performance and elegant design,the lightweight block cipher PRESENT attracts widely attention from both industry and academy society.In this paper,we present a new Biclique cryptanalysis on 21-round PRESENT,which can recover secret key with 278.9 time complexity and 264 chosen ciphertexts.Moreover,our Biclique attack can be extended to PRESENT-128 and the compression function of DM-PRESENT with the same rounds.Compared with the published results,our new Biclique analysis has the advantage on its memory complexity.
约圆PRESENT的椭圆分析
由于其优异的硬件性能和优雅的设计,轻量级分组密码PRESENT受到了业界和学术界的广泛关注。本文提出了一种新的基于21轮present的Biclique密码分析方法,该方法可以以278.9的时间复杂度和264个选定的密文恢复密钥。此外,我们的Biclique攻击可以扩展到PRESENT-128和DM-PRESENT的压缩函数。与已发表的结果相比,我们的Biclique分析在记忆复杂度上具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
计算机学报
计算机学报 Computer Science-Computer Graphics and Computer-Aided Design
CiteScore
3.00
自引率
0.00%
发文量
7308
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信