期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2000
卷号：2000
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：the first construction of a pseudo-random generator with
optimal seed length that uses (essentially) arbitrary hardness.
It builds on the novel recursive use of the NW-generator in
a previous paper by the same authors, which produced many optimal
generators one of which was pseudo-random. This is achieved in two
stages - first significantly reducing the number of candidate generators,
and then efficiently combining them into one.
We also give the first construction of an extractor with optimal seed
length, that can handle sub-polynomial entropy levels.
It builds on the fundamental connection between extractors and
pseudo-random generators discovered by Trevisan, combined
with construction above. Moreover, using Kolmogorov Complexity rather
than circuit size in the analysis gives super-polynomial savings for
our construction, and renders our extractors better than known for all
entropy levels.
关键词：Keywords:
extractors, hardness versus randomness, Pseudo-Random Generators
