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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
As deep nets are increasingly used in applications suited for mobile devices, a fundamental dilemma becomes apparent: the trend… 
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… 
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… 
Highly Cited
2011
Highly Cited
2011
We propose a method for learning similarity-preserving hash functions that map high-dimensional data onto binary codes. The… 
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… 
Highly Cited
2006
Highly Cited
2006
Image hash functions find extensive applications in content authentication, database search, and watermarking. This paper… 
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… 
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… 
Highly Cited
2000
Highly Cited
2000
The proliferation of digital images creates problems for managing large image databases, indexing individual images, and… 
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…