Near-optimal conversion of hardness into pseudo-randomness

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson

Research output: Contribution to journalConference articlepeer-review


This work addresses the question of hardness versus randomness trade-offs. By using the NW-generator in a new, more sophisticated way, derandomization in almost optimal time using any lower bound s(n) is obtained. Following Trevisan, information theoretic analogs of the new construction are explored.

Original languageEnglish
Pages (from-to)181-190
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA
Duration: 17 Oct 199919 Oct 1999

ASJC Scopus subject areas

  • Hardware and Architecture


Dive into the research topics of 'Near-optimal conversion of hardness into pseudo-randomness'. Together they form a unique fingerprint.

Cite this