406 search results - page 16 / 82 » Pseudorandomness and Combinatorial Constructions |
COCO
2005
Springer
15 years 1 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
101
click to vote
ASIACRYPT
2006
Springer
15 years 2 months ago
2006
Springer
In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions. These schemes are used to construct pseudo-random permutations from kn bits to ...
COCO
2004
Springer
15 years 4 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
67
Voted
EJC
2010
14 years 11 months ago
2010
We further generalise a construction