2006Unpublished venueRequires access

Near-Collision Attack and Collision-Attack on Double Block Length Compression Functions based on the Block Cipher IDEA.

Donghoon Chang

Open publisher page 4 citations

Abstract

Abstract. IDEA is a block cipher designed by Xuejia Lai and James L. Massey and was first described in 1991. IDEA does not vary the constant in its key schedule. In [1], Donghoon Chang and Moti Yung showed that there may be a weakness of hash function based on block cipher whose key schedule does not use various constants. Based on their result, we investigate the security of double block length compression functions based on the block cipher IDEA such that the key size of IDEA is 128 bits and its block length is 64 bits. We use the double block length hash functions proposed by Shoichi Hirose in the second hash workshop in 2006 [2]. Then, we can easily find a near-collision by hand. And also, for a constant c of DBL hash functions, we can find a collision by hand. This means that the constant c may be used as a trapdoor to make the attacker find collision easily.

About this research paper

What this paper is about

Abstract. IDEA is a block cipher designed by Xuejia Lai and James L. Massey and was first described in 1991. IDEA does not vary the constant in its key schedule. In [1], Donghoon Chang and Moti Yung showed that there may be a weakness of hash function based on block cipher whose key schedule does not use various constants. Based on their result, we investigate the security of double block length compression functions based on the block cipher IDEA such that the key size of IDEA is 128 bits and its block length is 64 bits. We use the double block length hash functions proposed by Shoichi Hirose in the second hash workshop in 2006 [2]. Then, we can easily find a near-collision by hand. And also, for a constant c of DBL hash functions, we can find a collision by hand. This means that the constant c may be used as a trapdoor to make the attacker find collision easily.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract. IDEA is a block cipher designed by Xuejia Lai and James L. Massey and was first described in 1991. IDEA does not vary the constant in its key schedule. In [1], Donghoon Chang and Moti Yung showed that there may be a weakness of hash function based on block cipher whose key schedule does not use various constants. Based on their result, we investigate the security of double block length compression functions based on the block cipher IDEA such that the key size of IDEA is 128 bits and its block length is 64 bits. We use the double block length hash functions proposed by Shoichi Hirose in the second hash workshop in 2006 [2]. Then, we can easily find a near-collision by hand. And also, for a constant c of DBL hash functions, we can find a collision by hand. This means that the constant c may be used as a trapdoor to make the attacker find collision easily.

Key concepts: Collision attack, CBC-MAC, Hash function, Block cipher, Computer science, Collision, MDC-2, Collision resistance

Related papers

Back to paper searchBrowse research topicsOriginal source
Near-Collision Attack and Collision-Attack on Double Block Length Compression Functions based on the Block Cipher IDEA. — Research Paper | ScholarLens