约圆PRESENT的椭圆分析

Q3 Computer Science 计算机学报 Pub Date : 2014-03-17 DOI:10.3724/SP.J.1016.2013.01139
Gong Zheng, Liu Shusheng, Wen Yamin, Tang Shaohua
{"title":"约圆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":"{\"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}","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

摘要

由于其优异的硬件性能和优雅的设计,轻量级分组密码PRESENT受到了业界和学术界的广泛关注。本文提出了一种新的基于21轮present的Biclique密码分析方法,该方法可以以278.9的时间复杂度和264个选定的密文恢复密钥。此外,我们的Biclique攻击可以扩展到PRESENT-128和DM-PRESENT的压缩函数。与已发表的结果相比,我们的Biclique分析在记忆复杂度上具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Biclique Analysis on the Reduced-Round PRESENT
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
计算机学报
计算机学报 Computer Science-Computer Graphics and Computer-Aided Design
CiteScore
3.00
自引率
0.00%
发文量
7308
期刊介绍:
期刊最新文献
Survey of randomization defenses on cloud computing Predicate Execution-Sequence Based Fault Localization Algorithm p-order Normal Cloud Model Recursive Definition and Analysis of Bidirectional Cognitive Computing: p-order Normal Cloud Model Recursive Definition and Analysis of Bidirectional Cognitive Computing A Deadlock Prevention Policy Based on Complementary Places: A Deadlock Prevention Policy Based on Complementary Places An Efficient and Accurate Scheme for Computing the Fiedler Vector: An Efficient and Accurate Scheme for Computing the Fiedler Vector
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1