268 search results - page 21 / 54 » An Analysis of Bitstate Hashing |
IPTPS
2004
Springer
14 years 2 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...
ASIACRYPT
2009
Springer
14 years 3 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...
TALG
2008
13 years 9 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. ...
CORR
2012
Springer
12 years 4 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...
FSE
2011
Springer
13 years 17 days 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...