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.
2015
2015
Secure Tag Search in RFID Systems Using Mobile Readers
One of the important features of an RFID system is its ability to search for a particular tag among a group of tags. In order to… 
2012
2012
Large Scale Sketch Based Image Retrieval Using Patch Hashing
This paper introduces a hashing based framework that facilitates sketch based image retrieval in large image databases. Instead… 
Highly Cited
2008
Highly Cited
2008
The SHAvite-3 Hash Function
. In this document we present SHAvite-3, a secure and efficient hash function based on the HAIFA construction and the AES building… 
Highly Cited
2005
Highly Cited
2005
H.264/AVC video authentication using skipped macroblocks for an erasable watermark
This paper presents a new watermarking framework, suitable for authentication of H.264 compressed videos. The authentication data… 
Review
2005
Review
2005
Comparative survey of high-performance cryptographic algorithm implementations on FPGAs
The authors present a comparative survey of private-key cryptographic algorithm implementations on field programmable gate arrays… 
2005
2005
Secure address auto-configuration for mobile ad hoc networks
Auto-configuration provides convenience in implementing a mobile ad hoc network. However, it may sacrifice network security if… 
Highly Cited
2004
Highly Cited
2004
Secure Hashed Diffie-Hellman over Non-DDH Groups
The Diffie-Hellman (DH) transform is a basic cryptographic primitive used in innumerable cryptographic applications, most… 
2003
2003
A case for associative peer to peer overlays
The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two… 
1993
1993
Longest‐match string searching for ziv‐lempel compression
Ziv‐Lempel coding is currently one of the more practical data compression schemes. It operates by replacing a substring of a text… 
Highly Cited
1988
Highly Cited
1988
PLOP-hashing: A grid file without directory
The authors consider the case of nonuniform weakly correlated or independent multidimensional record distributions. After… 
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)