针对MIBS-80的一种新的相关密钥不可能差分攻击

2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS) Pub Date : 2016-09-01 DOI:10.1109/INCoS.2016.41

Lu Cheng, Peng Xu, Yuechuan Wei

{"title":"针对MIBS-80的一种新的相关密钥不可能差分攻击","authors":"Lu Cheng, Peng Xu, Yuechuan Wei","doi":"10.1109/INCoS.2016.41","DOIUrl":null,"url":null,"abstract":"MIBS is a lightweight block cipher designed by M. Izadi et al in 2009 for tiny computing devices, such as RFID tags and sensor network nodes. The cipher algorithm iterates a Feistel structure with SP type round function by 32 rounds. It with 64-bit block size and supports 64/80-bit key size. In this paper, a new related-key impossible differential attacks to reduced-round MIBS with 80 bit keys is presented. By carefully choosing the relations of keys, a new 8 rounds related-key differential trials is constructed, by using which we first break 15-round MIBS with 80 bit keys. This result improves the known impossible differential attack on MIBS-80 by one round.","PeriodicalId":102056,"journal":{"name":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New Related-Key Impossible Differential Attack on MIBS-80\",\"authors\":\"Lu Cheng, Peng Xu, Yuechuan Wei\",\"doi\":\"10.1109/INCoS.2016.41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"MIBS is a lightweight block cipher designed by M. Izadi et al in 2009 for tiny computing devices, such as RFID tags and sensor network nodes. The cipher algorithm iterates a Feistel structure with SP type round function by 32 rounds. It with 64-bit block size and supports 64/80-bit key size. In this paper, a new related-key impossible differential attacks to reduced-round MIBS with 80 bit keys is presented. By carefully choosing the relations of keys, a new 8 rounds related-key differential trials is constructed, by using which we first break 15-round MIBS with 80 bit keys. This result improves the known impossible differential attack on MIBS-80 by one round.\",\"PeriodicalId\":102056,\"journal\":{\"name\":\"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)\",\"volume\":\"2012 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2016.41\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2016.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

MIBS是M. Izadi等人在2009年为小型计算设备(如RFID标签和传感器网络节点)设计的轻量级分组密码。该密码算法每32轮迭代一个具有SP型轮函数的festel结构。它具有64位块大小，并支持64/80位密钥大小。本文提出了一种新的针对80位密钥的减轮MIBS的相关密钥不可能差分攻击。通过仔细选择密钥的关系，构造了一个新的8轮相关密钥差分试验，利用该试验我们首先用80位密钥打破了15轮MIBS。该结果将已知的对MIBS-80的不可能差分攻击提高了一发。

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

查看原文本刊更多论文

New Related-Key Impossible Differential Attack on MIBS-80

MIBS is a lightweight block cipher designed by M. Izadi et al in 2009 for tiny computing devices, such as RFID tags and sensor network nodes. The cipher algorithm iterates a Feistel structure with SP type round function by 32 rounds. It with 64-bit block size and supports 64/80-bit key size. In this paper, a new related-key impossible differential attacks to reduced-round MIBS with 80 bit keys is presented. By carefully choosing the relations of keys, a new 8 rounds related-key differential trials is constructed, by using which we first break 15-round MIBS with 80 bit keys. This result improves the known impossible differential attack on MIBS-80 by one round.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS)

自引率

0.00%

发文量