A cryptographic hash function compresses arbitrarily long messages to digests of a short
and fixed length. Most of existing hash functions are designed to evaluate a compression …

Abstract At CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulation
of advanced meet-in-the-middle techniques for preimage attacks on hash functions. They …

Proprietary cryptography is a term used to describe custom encryption techniques that are
kept secret by its designers to add additional security. It is questionable if such an approach …

Hash functions are often constructed based on permutations or blockciphers, and security
proofs are typically done in the ideal permutation or cipher model. However, once these …

Sažetak Cryptographic hash functions have recently brought an exceptional research
interest. With the increasing number of attacks against the widely used functions as MD5 …

In this paper, we introduce a new class of double-block-length hash functions. Using the
ideal cipher model, we prove that these hash functions, dubbed MJH, are asymptotically …

Generalised Feistel network (GFN) is a popular design for block ciphers and hash functions.
The round function of the network often chooses a substitution–permutation (SP) …

The block cipher Crypton is a 128-bit block cipher was proposed by Lim as a candidate for
the Advanced Encryption Standard (AES) competition. So far, a variety of cryptanalytic …

Cryptographic constructions are often designed and analyzed in idealized frameworks such
as the random-oracle or ideal-cipher models. When the underlying primitives are …

At SAC 2006, Liskov proposed the zipper hash, a technique for constructing secure
(indifferentiable from random oracles) hash functions based on weak (invertible) …