400 search results - page 16 / 80 » Derandomization and Distinguishing Complexity |
FSE
2007
Springer
15 years 5 months ago
2007
Springer
Two general attacks that can be applied to all versions and variants of the Pomaranch stream cipher are presented. The attacks are demonstrated on all versions and succeed with com...
104
click to vote
STOC
2009
ACM
16 years 8 days ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
CCS
2004
ACM
15 years 5 months ago
2004
ACM
Address-space randomization is a technique used to fortify systems against bu er over
ow attacks. The idea is to introduce arti cial diversity by randomizing the memory location o...
106
click to vote
COLT
2006
Springer
15 years 3 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
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...