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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
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
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
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
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
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
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
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
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
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
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