Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
spongent: A Lightweight Hash Function
This paper proposes spongent - a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Highly Cited
2011
Highly Cited
2011
The PHOTON Family of Lightweight Hash Functions
RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an ontag… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Highly Cited
2011
Highly Cited
2011
Learning Hash Functions for Cross-View Similarity Search
Many applications in Multilingual and Multimodal Information Access involve searching large databases of high dimensional data… Expand
  • table 3
  • table 2
  • table 1
Highly Cited
2009
Highly Cited
2009
Learning to Hash with Binary Reconstructive Embeddings
Fast retrieval methods are increasingly critical for many large-scale analysis tasks, and there have been several recent methods… Expand
  • figure 1
  • figure 2
Highly Cited
2006
Highly Cited
2006
Robust and secure image hashing
Image hash functions find extensive applications in content authentication, database search, and watermarking. This paper… Expand
  • figure 1
  • figure 2
  • figure 3
  • table II
  • figure 4
Highly Cited
2005
Highly Cited
2005
Merkle-Damgård Revisited: How to Construct a Hash Function
The most common way of constructing a hash function (e.g., SHA-1) is to iterate a compression function on the input message. The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD
MD5 is the hash function designed by Ron Rivest [9] as a strengthened version of MD4[8]. In 1993 Bert den Boer and Antoon… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Highly Cited
2003
Highly Cited
2003
Fast pose estimation with parameter-sensitive hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality… Expand
  • figure 1
  • figure 3
  • table 1
  • figure 4
  • figure 5
Highly Cited
2000
Highly Cited
2000
Robust image hashing
The proliferation of digital images creates problems for managing large image databases, indexing individual images, and… Expand
  • figure 1
Highly Cited
1993
Highly Cited
1993
Hash Functions Based on Block Ciphers: A Synthetic Approach
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE