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 ﬁnd 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 a.2m encryptions, where a is a small number.
Information Security and Trust
2002 International Workshop on Cryptology and Network Security
City or Country
San Francisco, CA
WU, Hongjun; BAO, Feng; and Deng, Robert Huijie.
Cryptanalysis of some Hash Functions based on Block Ciphers and Codes. (2002). 2002 International Workshop on Cryptology and Network Security. 221-224. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1101
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.