The Community for Technology Leaders
Proceedings 17th IEEE Annual Conference on Computational Complexity (2002)
Montreal, Canada
May 21, 2002 to May 24, 2002
ISBN: 0-7695-1468-5
pp: 0011
Christopher Umans , Microsoft Research
ABSTRACT
We construct the first pseudo-random generators with logarithmic seed length that convert s bits of hardness into s^{\Omega(1)} bits of 2-sided pseudo-randomness, for any s. This improves [ISW00] and gives a direct proof of the optimal hardness vs. randomness tradeoff in [SU01]. A key element in our construction is an augmentation of the standard low-degree extension encoding that exploits the field structure of the underlying space in a new way.
INDEX TERMS
pseudo-random generator, low-degree extension, hardness vs. randomness tradeoffs
CITATION

C. Umans, "Pseudo-Random Generators for All Hardnesses," Proceedings 17th IEEE Annual Conference on Computational Complexity(CCC), Montreal, Canada, 2002, pp. 0011.
doi:10.1109/CCC.2002.1004326
93 ms
(Ver 3.3 (11022016))