45 search results - page 1 / 9 » Randomized Quicksort and the Entropy of the Random Source |
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We investigate the feasibility of a variety of cryptographic tasks with imperfect randomness. The kind of imperfect randomness we consider are entropy sources, such as those consi...
CHES
1999
Springer
13 years 9 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...
CHES
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, the evaluation of random bit generators for security applications is discussed and the concept of stateless generator is introduced. It is shown how, for t...
CORR
2012
Springer
12 years 9 days ago
2012
Springer
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...