Results 21 to 30 of about 18,371 (299)
Merkle-Damgård Construction Method and Alternatives: A Review
Journal of Information and Organizational Sciences, 2017 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
Finding state-of-the-art non-cryptographic hashes with genetic programming [PDF]
, 2006 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
New Zémor-Tillich Type Hash Functions Over GL2 (𝔽pn)
Journal of Mathematical Cryptology, 2020 We present a large class of new Zémor-Tillich type hash functions whose target space is the finite group GL2(𝔽pn) for any prime p and power n. To do so, we use a novel group-theoretic approach that uses Tits’ “Ping-Pong Lemma” to outline conditions under
Tomkins Hayley +2 more
doaj +1 more source
Programmable Hash Functions and Their Applications [PDF]
Journal of Cryptology, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Hofheinz (Dennis), E. Kiltz (Eike)
openaire +5 more sources
Challenging the increased resistance of regular hash functions against birthday attacks
Journal of Mathematical Cryptology, 2012 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
Egyptian Informatics Journal, 2012 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
ACM Journal of Experimental Algorithmics, 1997 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]
, 2007 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 +2 more sources
String commitment scheme with low output locality [PDF]
, 2019 Commitment schemes are important tools for various protocols. However, no scheme with output locality have been proposed yet. Low output locality is a property of functions that every output bit to depend on a small number of input bits.
Atsuko Miyaji +5 more
core +1 more source
On the Indifferentiability of the Grøstl Hash Function [PDF]
, 2010 The notion of indifferentiability, introduced by Maurer et al., is an important criterion for the security of hash functions. Concretely, it ensures that a hash function has no structural design flaws and thus guarantees security against generic attacks up to the proven bounds. In this work we prove the indifferentiability of Grostl, a second round SHA-
Elena Andreeva 0001 +2 more
openaire +3 more sources