Add to ORKG© Springer-Verlag Berlin Heidelberg 1993. In [ZMI89, ZMI90] two constructions for a collision resistant hash function were proposed. The first scheme is based on a block cipher, and the second scheme uses modular arithmetic. It is shown in this paper that both proposals have serious weaknesses.status: publishe
. This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses o...
The Zémor-Tillich hash function has remained unbroken since its introduction at CRYPTO'94. We presen...
Cryptographic hash functions compute a small fixed-size hash value for any given message. A main app...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
© Springer-Verlag Berlin Heidelberg 1996. We consider constructions for cryptographic hash functions...
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...
This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses of his m...
Abstract. In this article, it is discussed how to construct a compres-sion function with 2n-bit outp...
© Springer-Verlag Berlin Heidelberg 1993. Collision resistant hash functions are an important basic ...
A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is ...
A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is ...
© Springer-Verlag Berlin Heidelberg 1994. Constructions for hash functions baaed on a block cipher a...
The design principle of Merkle-Damgård construction is collision resistance of the compression funct...
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit outpu...
. This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses o...
The Zémor-Tillich hash function has remained unbroken since its introduction at CRYPTO'94. We presen...
Cryptographic hash functions compute a small fixed-size hash value for any given message. A main app...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
© Springer-Verlag Berlin Heidelberg 1996. We consider constructions for cryptographic hash functions...
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...
This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses of his m...
Abstract. In this article, it is discussed how to construct a compres-sion function with 2n-bit outp...
© Springer-Verlag Berlin Heidelberg 1993. Collision resistant hash functions are an important basic ...
A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is ...
A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is ...
© Springer-Verlag Berlin Heidelberg 1994. Constructions for hash functions baaed on a block cipher a...
The design principle of Merkle-Damgård construction is collision resistance of the compression funct...
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit outpu...
. This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses o...
The Zémor-Tillich hash function has remained unbroken since its introduction at CRYPTO'94. We presen...
Cryptographic hash functions compute a small fixed-size hash value for any given message. A main app...