The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach in many Internet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new constructions of message authentication schemes based on a cryptographic hash function. Our schemes...

Message Authentication Codes (MACs) are a valuable tool for ensuring the integrity of messages. MACs may be built around a keyed hash function. In this paper, we propose three variations on NH (a universal hash function explored in UMAC [1]), namely PH, PR and WH. Our main motivation was to prove that universal hash functions can be employed to provide provable security in ultra-low-power appli...

This paper reconsiders the established Merkle-Damg̊ard design principle for iterated hash functions. The internal state size w of an iterated n-bit hash function is treated as a security parameter of its own right. In a formal model, we show that increasing w quantifiably improves security against certain attacks, even if the compression function fails to be collision resistant. We propose the w...

This paper presents a compact and effective chaosbased keyed hash function implemented by a cross-coupled topology of chaotic maps, which employs absolute-value of sinusoidal nonlinearity, and offers robust chaotic regions over broad parameter spaces with high degree of randomness through chaoticity measurements using the Lyapunov exponent. Hash function operations involve an initial stage when...

In this paper, we suggest a Q2 multiple-collision trapdoor hash family under both integer factoring and discrete logarithm problems, and we present their security proofs. In multiple-collision trapdoor hash family, exposing multiple collisions of similar hash functions will not disclose the private key of trapdoor hash value. In the proposed multiple-collision trapdoor hash family, a pair of se...

Cayley hash values are defined by paths of some oriented graphs (quivers) called graphs, whose vertices and arrows given elements a group H. On the other hand, Brauer messages obtained concatenating words associated with multisets constituting configurations configurations. These define named quivers which induce particular class bound quiver algebras configuration algebras. Elements in can be ...

Universal hash functions (UHFs) have been extensively used in the design of cryptographic schemes. If we consider the related-key attack (RKA) against these UHF-based schemes, some of them may not be secure, especially those using the key of UHF as a part of the whole key of scheme, due to the weakness of UHF in the RKA setting. In order to solve the issue, we propose a new concept of related-k...

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̊ard construction against generic attacks. The family has as its special design features: a nested feedforward mechanism and an internal wide-pipe construction within the compression function. As examples, we give two proposed ins...

An algorithm complexity is a very crucial issue in the algorithm design, especially if large data sets are to be processed. Data search is very often used in many algorithms and hash function use gives us a possibility to speed up the process significantly. Nevertheless, it is very difficult do design a good hash function especially for geometric applications. This paper describes a new hash fu...