Sciweavers

658 search results - page 7 / 132
» The Grindahl Hash Functions
Sort
View
ACNS
2011
Springer
254views Cryptology» more  ACNS 2011»
12 years 11 months ago
Linear Analysis of Reduced-Round CubeHash
Abstract. Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join t...
Tomer Ashur, Orr Dunkelman
IJHPCN
2006
106views more  IJHPCN 2006»
13 years 7 months ago
Hash chains with diminishing ranges for sensors
Sensors and other small devices that periodically transmit relatively small packets of information motivate the study of hash chains with small domains and ranges. Hash chain based...
Phillip G. Bradford, Olga V. Gavrylyako
INDOCRYPT
2005
Springer
14 years 26 days ago
Towards Optimal Double-Length Hash Functions
In this paper we design several double length hash functions and study their security properties in the random oracle model. We design a class of double length hash functions (and ...
Mridul Nandi
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 7 months ago
Optimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
Daniel M. Gordon, Victor Miller, Peter Ostapenko
SBBD
2008
256views Database» more  SBBD 2008»
13 years 8 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...