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...

Full description

Saved in:
Bibliographic Details
Main Authors: WU, Hongjun, BAO, Feng, Deng, Robert Huijie
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
id sg-smu-ink.sis_research-2100
record_format dspace
spelling sg-smu-ink.sis_research-21002015-01-17T10:04:26Z Cryptanalysis of some Hash Functions based on Block Ciphers and Codes WU, Hongjun BAO, Feng Deng, Robert Huijie 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. 2002-09-01T07:00:00Z text application/pdf 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 http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Information Security
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Information Security
spellingShingle Information Security
WU, Hongjun
BAO, Feng
Deng, Robert Huijie
Cryptanalysis of some Hash Functions based on Block Ciphers and Codes
description 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.
format text
author WU, Hongjun
BAO, Feng
Deng, Robert Huijie
author_facet WU, Hongjun
BAO, Feng
Deng, Robert Huijie
author_sort WU, Hongjun
title Cryptanalysis of some Hash Functions based on Block Ciphers and Codes
title_short Cryptanalysis of some Hash Functions based on Block Ciphers and Codes
title_full Cryptanalysis of some Hash Functions based on Block Ciphers and Codes
title_fullStr Cryptanalysis of some Hash Functions based on Block Ciphers and Codes
title_full_unstemmed Cryptanalysis of some Hash Functions based on Block Ciphers and Codes
title_sort cryptanalysis of some hash functions based on block ciphers and codes
publisher Institutional Knowledge at Singapore Management University
publishDate 2002
url 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
_version_ 1770570855407943680