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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2018
0500100019682018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Nearest neighbor search is a problem of finding the data points from the database such that the distances from them to the query… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
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… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and… (More)
  • table 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach in many… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Iterated hash functions based on block ciphers are treated. Five attacks on an iterated hash function and on its round function… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
One way hash functions are a major tool in cryptography. DES is the best known and most widely used encryption function in the… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We define a <italic>Universal One-Way Hash Function</italic> family, a new primitive which enables the compression of elements in… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We show that if there exists a computationally collision free function f from m bits to t bits where m > 1, then there exists a… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
This paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a… (More)
Is this relevant?