2157 search results - page 19 / 432 » Optimal Fast Hashing |
112
click to vote
SPIN
2009
Springer
15 years 8 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
116
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
Fast retrieval methods are critical for large-scale and
data-driven vision applications. Recent work has explored
ways to embed high-dimensional features or complex distance
fun...
JCST
2007
15 years 1 months ago
2007
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
136
click to vote
STOC
2001
ACM
16 years 2 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
117
click to vote
ICMCS
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper, we study the collision property of one of the robust hash functions proposed in [1]. This method was originally proposed for robust hash generation from blocks of i...