Analysis of Double Block Length Hash Functions
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.
KeywordsHash Function Binary Sequence Block Cipher Block Length Total Complexity
Unable to display preview. Download preview PDF.
- 4.Satoh, T., Haga, M., Kurosawa, K.: Towards secure and fast hash functions. IEICE Transactions of Fundamentals 82-A(1), 55–62 (1999)Google Scholar
- 5.Girault, M., Cohen, R., Campana, M.: A generalized birthday attack. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 129–156. Springer, Heidelberg (1988)Google Scholar
- 7.Merkle, R.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428–446. Springer, Heidelberg (1990)Google Scholar
- 8.Damgåard, I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)Google Scholar