131 search results - page 10 / 27 » The complexity of constructing pseudorandom generators from ... |
AAECC
2006
Springer
13 years 7 months ago
2006
Springer
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
LATINCRYPT
2010
13 years 6 months ago
2010
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
ENTCS
2006
13 years 7 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...