Corpus ID: 59865441

The WHIRLPOOL Hashing Function

@inproceedings{SLM2003TheWH,
  title={The WHIRLPOOL Hashing Function},
  author={Paulo S.L.M and V. Rijmen},
  year={2003}
}
We present Whirlpool, a 512-bit hash function operating on messages less than 2 bits in length. The function structure is designed according to the Wide Trail strategy and permits a wide variety of implementation tradeoffs. (Revised on May 24, 2003) 
The Hash Function Family LAKE
TLDR
A new hash function family based on the HAIFA framework is proposed, inheriting built-in randomized hashing and higher security guarantees than the Merkle-Damgard construction against generic attacks, with a nested feedforward mechanism and an internal wide-pipe construction within the compression function. Expand
High-Speed Parallel Architecture of the Whirlpool Hash Function
TLDR
The proposed architecture can tremendously improve the performance of Whirlpool hash function, and can encrypt continuous bit streams seamlessly, achieving a throughput of 56.89 G bps, which is considerably high compared to existing implementations in literature. Expand
Cryptographic Hash Functions: A Review
Cryptographic Hash functions are used to achieve a number of security objectives. In this paper, we bring out the importance of hash functions, its various structures, design techniques, attacks andExpand
Universal One Way Hash Functions ( UOWHF )
Cryptographic Hash functions are used to achieve a number of security objectives. In this paper, we bring out the importance of hash functions, its various structures, design techniques, attacks andExpand
Non-random properties of reduced-round Whirlpool ⁄ NES/DOC/UIB/WP5/016/2
In this note it is shown that a variant of the hash function Whirlpool where the number of rounds in the compression function is reduced from ten to six (or less), exhibits some nonrandom properties.Expand
The Whirlpool Secure Hash Function
TLDR
Whirlpool is a block-cipher-based secure hash function that produces a hash code of 512 bits for an input message of maximum length less than 2256 bits. Expand
A Bit-Slice Implementation of the Whirlpool Hash Function
TLDR
A bit-slice implementation of the Whirlpool hash function for 64-bit CPUs, which processes a single input block in one pass and is immune against cache timing attacks, e.g. if used in an HMAC. Expand
The Grindahl Hash Functions
TLDR
The Grindahl hash functions, which are based on components of the Rijndael algorithm, are proposed with claimed security levels with respect to collision, preimage and second preimage attacks of 2128 and 2256, respectively. Expand
Looking Back at a New Hash Function
TLDR
The computational trade-off between the key schedule and encryption in a block cipher-based hash function is explored and the approach is illustrated with a 256-bit hash function that has a hashing rate equivalent to the encryption rate of AES-128. Expand
TWOBLOCK: A Fast New Hash Function
In this paper, the author studies the fast cryptographic hash function. This work suggests a different notion with respect to the traditional hash functions, MD5, SHA-1, and Whirlpool. The notion ofExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Efficient architecture and hardware implementation of the Whirlpool hash function
TLDR
This is the first Whirlpool implementation allowing fast execution, and effective substitution of any previous hash families' implementations such as MD5, RIPEMD-160, SHA-2 etc, in any cryptography application. Expand
On the diffusion matrix employed in the Whirlpool hashing function
Abstract. It has been claimed that the matrix employed in diffusion layer, i.e. the diffusion matrix, of Whirlpool hashing function was designed to hold branch number B = 9. However, we have foundExpand
Cipher and hash function design strategies based on linear and differential cryptanalysis
TLDR
This thesis contains a new approach to design block ciphers, synchronous and self-synchronizing stream cipher and cryptographic hash functions that can be implemented efficiently on a wide variety of platforms. Expand
Differential cryptanalysis of hash functions based on block ciphers
TLDR
A differential attack on several hash functions based on a block cipher with the emphasis on the results for cases where DES [8] is the underlying block cipher. Expand
Improved Characteristics for Differential Cryptanalysis of Hash Functions Based on Block Ciphers
TLDR
An improvement of the differential attack on hash functions based on block ciphers is presented that can greatly reduce the work factor to find a pair that follows the characteristic. Expand
The Block Cipher Square
TLDR
A new 128-bit block cipher called Square, which concentrates on the resistance against differential and linear cryptanalysis, and the publication of the resulting cipher for public scrutiny is published. Expand
Improved Cryptanalysis of Rijndael
TLDR
The best attack on Rijndael reduced to 6 rounds from complexity 272 to 244 is improved and a related-key attack that can break 9-round Rijnael with 256-bit keys is described. Expand
Cryptanalytic Attacks on Pseudorandom Number Generators
TLDR
It is argued that PRNGs are their own unique type of cryptographic primitive, and should be analyzed as such, and a model forPRNGs is proposed, and possible attacks against this model are discussed. Expand
Handbook of Applied Cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access ofExpand
Perfect Diffusion Primitives for Block Ciphers
TLDR
This paper considers software implementations on various platforms of linear perfect diffusion primitives to construct efficient 4 × 4 and 8 × 8 MDS matrices to be used e.g. in block ciphers. Expand
...
1
2
3
4
...