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.
Highly Cited
2015
Highly Cited
2015
Parallel chaotic hash function based on the shuffle-exchange network
In recent years, cryptologists have been delving into chaos theory to design more secure cryptographic primitives. However, many… 
Highly Cited
2012
Highly Cited
2012
Self-embedding fragile watermarking with restoration capability based on adaptive bit allocation mechanism
Highly Cited
2008
Highly Cited
2008
Range queries on structured overlay networks
Highly Cited
2007
Highly Cited
2007
Known-Key Distinguishers for Some Block Ciphers
We present two block cipher distinguishers in a setting where the attacker knows the key. One is a distinguisher for AES reduced… 
Highly Cited
2007
Highly Cited
2007
Reversible Data-Hiding Scheme for 2-D Vector Maps Based on Difference Expansion
Reversible watermarking is suitable for hiding data in 2-D vector maps because the distortions induced by data embedding can be… 
Highly Cited
2006
Highly Cited
2006
A Case Against Currently Used Hash Functions in RFID Protocols
Designers of RFID security protocols can choose between a wide variety of cryptographic algorithms However, when implementing… 
Highly Cited
2003
Highly Cited
2003
Efficient multicast stream authentication using erasure codes
We describe a novel method for authenticating multicast packets that is robust against packet loss. Our focus is to minimize the… 
Highly Cited
2001
Highly Cited
2001
Counting twig matches in a tree
Describes efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e. a twig, in a… 
Highly Cited
2001
Highly Cited
2001
On random walks for Pollard's rho method
We consider Pollard's rho method for discrete logarithm computation. Usually, in the analysis of its running time the assumption… 
Review
1990
Review
1990
LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications
This paper provides an overview of the LOKI encryption primitive which may be used to encrypt and decrypt a 64-bit block of data… 
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)