268 search results - page 21 / 54 » An Analysis of Bitstate Hashing |
115
click to vote
IPTPS
2004
Springer
15 years 9 months ago
2004
Springer
Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these syste...
128
click to vote
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
The hash function Skein is the submission of Ferguson et al. to the NIST Hash Competition, and is arguably a serious candidate for selection as SHA-3. This paper presents the firs...
158
click to vote
TALG
2008
15 years 3 months ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
139
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
173
click to vote
FSE
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...