A provably secure non-iterative hash function resisting birthday attack

作者：Su, Shenghui^*; Xie, Tao; Lu, Shuwang

来源：Theoretical Computer Science, 2016, 654: 128-142.

DOI：10.1016/j.tcs.2016.02.023

• Hash function
• Compression algorithm
• Non-iterative structure
• Provable security
• Birthday attack
• Meet-in-the-middle attack

To examine the integrity and authenticity of an IP address efficiently and economically, this paper proposes a new non -iterative hash function called JUNA that is based on a multivariate permutation problem and an anomalous subset product problem to which no subexponential time solutions are found so far. JUNA includes an initialization algorithm and a compression algorithm, and converts a short message of n bits which is regarded as only one block into a digest of m bits, where 80 <= m <= 232 and 80 <= m <= n <= 4096. The analysis and proof show that the new hash is one-way, weakly collision -free, and strongly collision-free, and its security against existent attacks such as birthday attack and meet in -the -middle attack is to 0(2(m)). Moreover, a detailed proof that the new hash function is resistant to the birthday attack is given. Compared with the Chaum-Heijst-Pfitzmann hash based on a discrete logarithm problem, the new hash is lightweight, and thus it opens a door to convenience for utilization of lightweight digital signing schemes.

• 出版日期2016-11-22
• 单位北京工业大学; 中国科学院大学; 中国人民解放军国防科学技术大学