约圆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分析在记忆复杂度上具有优势。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

期刊介绍：