Cryptanalysis of Some Hash Functions Based on Block Ciphers and Codes
At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash functions are secure: 2^((d-1)m/2) encryptions are necessary to find a collision, where d and m are the minimal distance of the code and the block size of block cipher, respectively. However, we show in this paper that a collision could be found with about alpha*2^m encryptions, where alpha is a small number.
Information Security and Trust
Informatica: A Journal of Computing and Informatics
Slovenian Society Informatika
City or Country
WU, Hongjun; Bao, Feng; and DENG, Robert H..
Cryptanalysis of Some Hash Functions Based on Block Ciphers and Codes. (2002). Informatica: A Journal of Computing and Informatics. 26, (3), 255-258. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/192
This document is currently not available here.