109 search results - page 7 / 22 » Analysis of All-or-Nothing Hash Functions |
FSE
2008
Springer
14 years 11 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
104
click to vote
SIGMOD
2012
ACM
12 years 12 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
FROCOS
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducin...
FSE
2010
Springer
15 years 2 months ago
2010
Springer
EUROCRYPT
2008
Springer
14 years 11 months ago
2008
Springer
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...