713 search results - page 19 / 143 » Dispersing Hash Functions |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
CAI
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed ...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper we estimate the end-to-end total bandwidth (BW) and available bandwidth (ABW) of a path between a pair of nodes in an IEEE 802.11b ad hoc network, both as function...