Results 21 to 30 of about 3,288,500 (296)
Programmable Hash Functions and Their Applications [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Hofheinz (Dennis), E. Kiltz (Eike)
openaire +5 more sources
Finding state-of-the-art non-cryptographic hashes with genetic programming [PDF]
Proceding of: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006.The design of non-cryptographic hash functions by means of evolutionary computation is a relatively new and unexplored problem.
Ribagorda Garnacho, Arturo +10 more
core +1 more source
Merkle-Damgård Construction Method and Alternatives: A Review
Cryptographic hash function is an important cryptographic tool in the field of information security. Design of most widely used hash functions such as MD5 and SHA-1 is based on the iterations of compression function by Merkle-Damgård construction method ...
Harshvardhan Tiwari
doaj +1 more source
Online Adaptive Supervised Hashing for Large-Scale Cross-Modal Retrieval
In recent years, with the continuous growth of multimedia data on the Internet, multimodal hashing has attracted increasing attention for its efficiency in large-scale cross-modal retrieval.
Ruoqi Su +4 more
doaj +1 more source
Indifferentiable hash functions in the standard model
Indifferentiability of iterated hash functions is seen as evidence that there are no structural flaws in the iteration structure of the algorithm. However, it is often overlooked that such considerations only hold in the random oracle model and do not ...
Juha Partala
doaj +1 more source
Challenging the increased resistance of regular hash functions against birthday attacks
At Eurocrypt 2004, Bellare and Kohno presented the concept of a regular hash function. For a hash function to be regular, every hash value must have the same number of preimages in the domain.
Mouha Nicky, Sekar Gautham, Preneel Bart
doaj +1 more source
A secure and efficient cryptographic hash function based on NewFORK-256
Cryptographic hash functions serve as a fundamental building block of information security and are used in numerous security applications and protocols such as digital signature schemes, construction of MAC and random number generation, for ensuring data
Harshvardhan Tiwari, Krishna Asawa
doaj +1 more source
In this paper an efficient open address hash function called exponential hashing is developed. The motivation for this hash function resulted from our ongoing efforts to apply dynamical systems theory to the study of hashing; however, the analysis conducted in this paper is primarily based on traditional number theory. Proofs of optimal table parameter
Bradley J. Smith +2 more
openaire +2 more sources
Cryptanalysis of the Tiger Hash Function [PDF]
Tiger is a cryptographic hash function with a 192-bit hash value. It was proposed by Anderson and Biham in 1996. Recently, weaknesses have been shown in round-reduced variants of the Tiger hash function. First, at FSE 2006, Kelsey and Lucks presented a collision attack on Tiger reduced to 16 and 17 (out of 24) rounds with a complexity of about 244 and ...
Mendel, Florian, Rijmen, Vincent
openaire +3 more sources
EliMAC: Speeding Up LightMAC by around 20%
Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are ...
Christoph Dobraunig +2 more
doaj +1 more source

