{"title":"Cryptanalysis of the HaF family of hash functions","authors":"M. Buczek, M. Kontak","doi":"10.1556/012.2015.52.2.1310","DOIUrl":null,"url":null,"abstract":"HaF is a family of hash functions developed by prof. Stokłosa and his team from Institute of Control and Information Engineering of Poznań University of Technology. HaF is classical Merkle-Damgård construction with output sizes of 256, 512 or 1024 bits. In this paper we will present an attack on all the members of HaF family with negligible complexity (collision for all the members can be found without using a computer). We will also show that the improved function (without the critical transformation) is still insecure. It is possible to find a preimage for short messages. We can also create some fixed points, with a complexity of single compression function call.","PeriodicalId":176909,"journal":{"name":"2013 Military Communications and Information Systems Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Military Communications and Information Systems Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1556/012.2015.52.2.1310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
HaF is a family of hash functions developed by prof. Stokłosa and his team from Institute of Control and Information Engineering of Poznań University of Technology. HaF is classical Merkle-Damgård construction with output sizes of 256, 512 or 1024 bits. In this paper we will present an attack on all the members of HaF family with negligible complexity (collision for all the members can be found without using a computer). We will also show that the improved function (without the critical transformation) is still insecure. It is possible to find a preimage for short messages. We can also create some fixed points, with a complexity of single compression function call.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
