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 c...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2002
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/1101 https://ink.library.smu.edu.sg/context/sis_research/article/2100/viewcontent/Deng200210.1.1.105.3760.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | 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. |
|---|