65 search results - page 4 / 13 » On the Randomness of Bits Generated by Sufficiently Smooth F... |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
CHES
1999
Springer
13 years 11 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
STACS
2012
Springer
12 years 2 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
ETT
2000
13 years 7 months ago
2000
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...