Skip to search formSkip to main contentSkip to account menu

Hash function

Known as: Hashing algorithm, Hashing function, Hashlink 
A hash function is any function that can be used to map data of arbitrary size to data of fixed size. The values returned by a hash function are… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstract data typeArtificial intelligence (video games)BackupBiological database

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Parallel chaotic hash function based on the shuffle-exchange network
In recent years, cryptologists have been delving into chaos theory to design more secure cryptographic primitives. However, many… 
Highly Cited
2013
Highly Cited
2013
A novel image encryption based on hash function with only two-round diffusion process
In this paper, a novel algorithm for image encryption based on hash function is proposed. In our algorithm, a 512-bit long… 
Highly Cited
2012
Highly Cited
2012
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient… 
Highly Cited
2010
Highly Cited
2010
Semi-supervised hashing for scalable image retrieval
Large scale image search has recently attracted considerable attention due to easy availability of huge amounts of data. Several… 
Highly Cited
2007
Highly Cited
2007
A Framework for Iterative Hash Functions - HAIFA
Since the seminal works of Merkle and Damgard on the iter- ation of compression functions, hash functions were built from compres… 
Highly Cited
2004
Highly Cited
2004
Identity-Based Chameleon Hash and Applications
Chameleon signatures are non-interactive signatures based on a hash-and-sign paradigm, and similar in efficiency to regular… 
Highly Cited
2003
Highly Cited
2003
The WHIRLPOOL Hashing Function
We present Whirlpool, a 512-bit hash function operating on messages less than 2 bits in length. The function structure is… 
Highly Cited
2002
Highly Cited
2002
Toward Hierarchical Identity-Based Encryption
We introduce the concept of hierarchical identity-based encryption (HIBE) schemes, give precise definitions of their security and… 
Highly Cited
1998
Highly Cited
1998
The Block Cipher Rijndael
In this paper we present the block cipher Rijndael, which is one of the fifteen candidate algorithms for the Advanced Encryption… 
Highly Cited
1997
Highly Cited
1997
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
We present a simple, new paradigm for the design of collision-free hash functions. Any function emanating from this paradigm is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)