Collision Search of a Hash Function by Using Random Mapping

Hikaru MORITA; Hideki ODAGI; Kazuo OHTA

Collision Search of a Hash Function by Using Random Mapping

Hikaru MORITA, Hideki ODAGI, Kazuo OHTA

Full Text Views

0

Share
Cite this

Summary :

This paper proposes to apply random mapping methods of a pseudo random function to find collisions of a hash function. We test a hash function including a block cipher (see ISO/IEC 10118-2) with computers, where users can select its initial vector. In particular, the paper shows that a hash function with multiple stages generates a lot of collision hash values, so our probabilistic consideration of a small model for the hash function well explains the computational results. We show that it's feasible to find collisions between the selected messages in advance for 64-bit-size hash functions with WSs linked via an ordinary LAN (Local Area Network). Thus, it is dangerous to use the hash function -- single block mode -- defined in [6] and [7].

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.1 pp.35-40

Publication Date: 1998/01/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category

Cite this

Copy

Hikaru MORITA, Hideki ODAGI, Kazuo OHTA, "Collision Search of a Hash Function by Using Random Mapping" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 1, pp. 35-40, January 1998, doi: .
Abstract: This paper proposes to apply random mapping methods of a pseudo random function to find collisions of a hash function. We test a hash function including a block cipher (see ISO/IEC 10118-2) with computers, where users can select its initial vector. In particular, the paper shows that a hash function with multiple stages generates a lot of collision hash values, so our probabilistic consideration of a small model for the hash function well explains the computational results. We show that it's feasible to find collisions between the selected messages in advance for 64-bit-size hash functions with WSs linked via an ordinary LAN (Local Area Network). Thus, it is dangerous to use the hash function -- single block mode -- defined in [6] and [7].
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e81-a_1_35/_p

Copy

@ARTICLE{e81-a_1_35,
author={Hikaru MORITA, Hideki ODAGI, Kazuo OHTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Collision Search of a Hash Function by Using Random Mapping},
year={1998},
volume={E81-A},
number={1},
pages={35-40},
abstract={This paper proposes to apply random mapping methods of a pseudo random function to find collisions of a hash function. We test a hash function including a block cipher (see ISO/IEC 10118-2) with computers, where users can select its initial vector. In particular, the paper shows that a hash function with multiple stages generates a lot of collision hash values, so our probabilistic consideration of a small model for the hash function well explains the computational results. We show that it's feasible to find collisions between the selected messages in advance for 64-bit-size hash functions with WSs linked via an ordinary LAN (Local Area Network). Thus, it is dangerous to use the hash function -- single block mode -- defined in [6] and [7].},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Collision Search of a Hash Function by Using Random Mapping
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 35
EP - 40
AU - Hikaru MORITA
AU - Hideki ODAGI
AU - Kazuo OHTA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1998
AB - This paper proposes to apply random mapping methods of a pseudo random function to find collisions of a hash function. We test a hash function including a block cipher (see ISO/IEC 10118-2) with computers, where users can select its initial vector. In particular, the paper shows that a hash function with multiple stages generates a lot of collision hash values, so our probabilistic consideration of a small model for the hash function well explains the computational results. We show that it's feasible to find collisions between the selected messages in advance for 64-bit-size hash functions with WSs linked via an ordinary LAN (Local Area Network). Thus, it is dangerous to use the hash function -- single block mode -- defined in [6] and [7].
ER -