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 ...
This paper presents the first non-trivial collision attack on the double-block-length compression fu...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
Abstract. IDEA is a block cipher designed by Xuejia Lai and James L. Massey and was first described ...
In this article, we study the security of the IDEA block cipher when it is used in various simple-le...
In this article, we study the security of the IDEA block cipher when it is used in various simple-le...
The idea of double block length hashing is to construct a compression function on 2n bits using a bl...
© 2016, Springer Science+Business Media New York. The idea of double block length hashing is to cons...
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit outpu...
In this article, the security of double-block-length hash functions with the rate 1 is analyzed, who...
In this article, we study the security of the IDEA block cipher when it is used in various simple-le...
Abstract. In this article, it is discussed how to construct a compres-sion function with 2n-bit outp...
In this work the security of the rate-1 double block length hash functions, which based on a block c...
© Springer-Verlag Berlin Heidelberg 1996. We consider constructions for cryptographic hash functions...
Knudsen and Preneel (Asiacrypt'96 and Crypto'97) introduced a hash function design in which a linear...
This paper presents the first non-trivial collision attack on the double-block-length compression fu...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
Abstract. IDEA is a block cipher designed by Xuejia Lai and James L. Massey and was first described ...
In this article, we study the security of the IDEA block cipher when it is used in various simple-le...
In this article, we study the security of the IDEA block cipher when it is used in various simple-le...
The idea of double block length hashing is to construct a compression function on 2n bits using a bl...
© 2016, Springer Science+Business Media New York. The idea of double block length hashing is to cons...
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit outpu...
In this article, the security of double-block-length hash functions with the rate 1 is analyzed, who...
In this article, we study the security of the IDEA block cipher when it is used in various simple-le...
Abstract. In this article, it is discussed how to construct a compres-sion function with 2n-bit outp...
In this work the security of the rate-1 double block length hash functions, which based on a block c...
© Springer-Verlag Berlin Heidelberg 1996. We consider constructions for cryptographic hash functions...
Knudsen and Preneel (Asiacrypt'96 and Crypto'97) introduced a hash function design in which a linear...
This paper presents the first non-trivial collision attack on the double-block-length compression fu...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...