A Family of Fast Syndrome Based Cryptographic Hash Functions
A Family of Fast Syndrome Based Cryptographic Hash Functions
复制标题
DOI：
10.1007/11554868_6
复制
发表时间：
2005-09
期刊：
影响因子：
--
通讯作者：
D. Augot;M. Finiasz;N. Sendrier
中科院分区：
文献类型：
--
作者：
D. Augot;M. Finiasz;N. Sendrier
最近，各种加密哈希函数 [20,21] 出现了一些冲突，其中包括一些当今最广泛使用的函数。然而，使用类似结构的许多其他哈希函数仍然可以被认为是安全的。尽管如此，这引起了人们对新的哈希函数设计的需求的关注。本文提出了一系列安全哈希函数，其安全性与纠错码理论中的校正子解码问题直接相关。考虑到Coron和Joux[4]基于Wagner广义生日算法[19]的分析，我们研究了函数的渐近安全性。我们证明这种攻击在哈希值的长度方面总是呈指数增长。我们还研究了这种攻击的工作因子，以及来自编码理论的其他攻击，对于非渐近范围，即实用值。因此，我们提出了几组参数，提供了良好的安全性以及更快的散列或更短的函数描述。
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using similar constructions can however still be considered secure. Nevertheless, this has drawn attention on the need for new hash function designs.In this article is presented a family of secure hash functions, whose security is directly related to the syndrome decoding problem from the theory of error-correcting codes.Taking into account the analysis by Coron and Joux [4] based on Wagner’s generalized birthday algorithm [19] we study the asymptotical security of our functions. We demonstrate that this attack is always exponential in terms of the length of the hash value.We also study the work-factor of this attack, along with other attacks from coding theory, for non asymptotic range, i.e. for practical values. Accordingly, we propose a few sets of parameters giving a good security and either a faster hashing or a shorter description for the function.