Expanded into two volumes, the Second Edition of Springer's Encyclopedia of Cryptography
and Security brings the latest and most comprehensive coverage of the topic: Definitive …

Recent years have witnessed an exceptional research interest in cryptographic hash
functions, especially after the popular attacks against MD5 and SHA-1 in 2005. In 2007, the …

The first designs of cryptographic hash functions date back to the late 1970s; more
proposals emerged in the 1980s. During the 1990s, the number of hash function designs …

This paper advocates a new hash function family based on the HAIFA framework, inheriting
built-in randomized hashing and higher security guarantees than the Merkle-Damgård …

Parallel computing has led to fundamental changes in almost all research areas associated
with computer science; cryptography is no exception. Besides improved speed and resource …

Cryptographic hash functions are an essential building block for security applications. Until
2005, the amount of theoretical research and cryptanalysis invested in this topic was rather …

This paper focuses on parallel hash functions based on tree modes of operation for an inner
Variable-Input-Length function. This inner function can be either a single-block-length (SBL) …

This paper defines a generalized SHA algorithm based on the SHA family rules. The
proposed algorithm accepts arbitrary length message as input to generate message digest …

Most of the currently accepted designs for cryptographic hash functions are in the style of a
block cipher in feed-forward mode. With increasing interest in all forms of cryptanalysis, this …

Cryptographic hash functions play a central role in applications of cryptography. In spite of
this, there has been only limited interest for theoretical work on the definitions and …