Analysis of double block length hash functions

被引：0

作者：

Hattori, Mitsuhiro ^{[1
]}

Hirose, Shoichi ^{[1
]}

Yoshida, Susumu ^{[1
]}

机构：

[1] Graduate School of Informatics, Kyoto University, Kyoto

来源：

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2003年 / 2898卷

关键词：

Block ciphers - Block lengths - Compression functions - Double-block-length hash functions - Plaintext;

D O I：

10.1007/978-3-540-40974-8_23

中图分类号：

学科分类号：

摘要：

The security of double block length hash functions and their compression functions is analyzed in this paper. First, the analysis of double block length hash functions by Satoh, Haga, and Kurosawa is investigated. The focus of this investigation is their analysis of the double block length hash functions with the rate 1 whose compression functions consist of a block cipher with the key twice longer than the plaintext/ciphertext. It is shown that there exists a case uncovered by their analysis. Second, the compression functions are analyzed with which secure double block length hash functions may be constructed. The analysis shows that these compression functions are at most as secure as the compression functions of single block length hash functions. © Springer-Verlag Berlin Heidelberg 2003.

引用

页码：290 / 302

页数：12

共 8 条

[1]

Menezes A., Van Oorschot P., Vanstone S., Handbook of Applied Cryptography, (1996)

[2]

Knudsen L., Lai X., New attacks on all double block length hash functions of hash rate 1, including the parallel-DM, Lecture Notes in Computer Science, 950, pp. 410-418, (1995)

[3]

Knudsen L., Lai X., Preneel B., Attacks on fast double block length hash functions, Journal of Cryptology, 11, 1, pp. 59-72, (1998)

[4]

Satoh T., Haga M., Kurosawa K., Towards secure and fast hash functions, IEICE Transactions of Fundamentals, 82 A, 1, pp. 55-62, (1999)

[5]

Girault M., Cohen R., Campana M., A generalized birthday attack, Lecture Notes in Computer Science, 330, pp. 129-156, (1988)

[6]

Black J., Rogaway P., Shrimpton T., Black-box analysis of the block-cipherbased hash-function constructions from PGV, Lecture Notes in Computer Science, 2442, pp. 320-335, (2002)

[7]

Merkle R., One way hash functions and des, Lecture Notes in Computer Science, 435, pp. 428-446, (1990)

[8]

Damgard I., A design principle for hash functions, Lecture Notes in Computer Science, 435, pp. 416-427, (1990)

← 1 →