1 research outputs found
Simple extractors via constructions of cryptographic pseudo-random generators
Trevisan has shown that constructions of pseudo-random generators from hard
functions (the Nisan-Wigderson approach) also produce extractors. We show that
constructions of pseudo-random generators from one-way permutations (the
Blum-Micali-Yao approach) can be used for building extractors as well. Using
this new technique we build extractors that do not use designs and
polynomial-based error-correcting codes and that are very simple and efficient.
For example, one extractor produces each output bit separately in
time. These extractors work for weak sources with min entropy , for
arbitrary constant , have seed length , and their
output length is .Comment: 21 pages, an extended abstract will appear in Proc. ICALP 2005; small
corrections, some comments and references adde