Sciweavers

713 search results - page 3 / 143
» Dispersing Hash Functions
Sort
View
72
Voted
INDOCRYPT
2005
Springer
15 years 3 months 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»
14 years 9 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»
14 years 11 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...
SAC
2008
ACM
14 years 9 months ago
Evaluation of Tweedie exponential dispersion model densities by Fourier inversion
The Tweedie family of distributions is a family of exponential dispersion models with power variance functions V (
Peter K. Dunn, Gordon K. Smyth
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
15 years 1 months ago
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
Jonathan J. Hoch, Adi Shamir