Publication Type
Conference Paper
Version
submittedVersion
Publication Date
9-2002
Abstract
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 a.2m encryptions, where a is a small number.
Discipline
Information Security
Research Areas
Information Security and Trust
Publication
2002 International Workshop on Cryptology and Network Security
First Page
221
Last Page
224
City or Country
San Francisco, CA
Citation
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.
Available at: https://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 International License.
Additional URL
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.3760