利用遗传算法寻找Hamsi-256压缩函数的近碰撞

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI:10.1109/BICTA.2010.5645231

Yun-qiang Li, Ai-lan Wang

{"title":"利用遗传算法寻找Hamsi-256压缩函数的近碰撞","authors":"Yun-qiang Li, Ai-lan Wang","doi":"10.1109/BICTA.2010.5645231","DOIUrl":null,"url":null,"abstract":"Hamsi is one of 14 remaining candidates in NIST's Hash Competition for the future hash standard SHA-3 and Hamsi-256 is one of four kinds of Hamsi. In this paper we present a genetic algorithm to search near collisions for the compress function of Hamsi-256, give a near collision on (256 - 20) bits and a near collision on (256 - 21) bits with four differences in the chaining value, and obtain a differential path for three rounds of Hamsi-256 with probability 2−24, 2−23 respectively, which are better than previous work reported about near collisions.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Using genetic algorithm to find near collisions for the compress function of Hamsi-256\",\"authors\":\"Yun-qiang Li, Ai-lan Wang\",\"doi\":\"10.1109/BICTA.2010.5645231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hamsi is one of 14 remaining candidates in NIST's Hash Competition for the future hash standard SHA-3 and Hamsi-256 is one of four kinds of Hamsi. In this paper we present a genetic algorithm to search near collisions for the compress function of Hamsi-256, give a near collision on (256 - 20) bits and a near collision on (256 - 21) bits with four differences in the chaining value, and obtain a differential path for three rounds of Hamsi-256 with probability 2−24, 2−23 respectively, which are better than previous work reported about near collisions.\",\"PeriodicalId\":302619,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2010.5645231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

Hamsi是NIST未来哈希标准SHA-3的哈希竞赛中剩下的14个候选者之一，Hamsi-256是四种Hamsi中的一种。本文提出了一种搜索Hamsi-256压缩函数的近碰撞的遗传算法，给出了(256 - 20)位的近碰撞和(256 - 21)位的近碰撞，它们的链值有4个不同，得到了Hamsi-256三轮的微分路径，其概率分别为2−24和2−23，优于前人关于近碰撞的研究。

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

查看原文本刊更多论文

Using genetic algorithm to find near collisions for the compress function of Hamsi-256

Hamsi is one of 14 remaining candidates in NIST's Hash Competition for the future hash standard SHA-3 and Hamsi-256 is one of four kinds of Hamsi. In this paper we present a genetic algorithm to search near collisions for the compress function of Hamsi-256, give a near collision on (256 - 20) bits and a near collision on (256 - 21) bits with four differences in the chaining value, and obtain a differential path for three rounds of Hamsi-256 with probability 2−24, 2−23 respectively, which are better than previous work reported about near collisions.

求助全文

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

来源期刊

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)

自引率

0.00%

发文量