Near-optimal conversion of hardness into pseudo-randomness

Russell Impagliazzo; Ronen Shaltiel; Avi Wigderson

doi:10.1109/sffcs.1999.814590

Near-optimal conversion of hardness into pseudo-randomness

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson

Research output: Contribution to journal › Conference article › peer-review

Abstract

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 language	English
Pages (from-to)	181-190
Number of pages	10
Journal	Annual Symposium on Foundations of Computer Science - Proceedings
DOIs	https://doi.org/10.1109/sffcs.1999.814590
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA Duration: 17 Oct 1999 → 19 Oct 1999

ASJC Scopus subject areas

Hardware and Architecture

Access to Document

10.1109/sffcs.1999.814590

Cite this

@article{0db922c737b847409b76168583a9a91d,

title = "Near-optimal conversion of hardness into pseudo-randomness",

abstract = "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.",

author = "Russell Impagliazzo and Ronen Shaltiel and Avi Wigderson",

year = "1999",

doi = "10.1109/sffcs.1999.814590",

language = "English",

pages = "181--190",

journal = "Annual Symposium on Foundations of Computer Science - Proceedings",

issn = "0272-5428",

note = "Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science ; Conference date: 17-10-1999 Through 19-10-1999",

}

TY - JOUR

T1 - Near-optimal conversion of hardness into pseudo-randomness

AU - Impagliazzo, Russell

AU - Shaltiel, Ronen

AU - Wigderson, Avi

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033352910&partnerID=8YFLogxK

U2 - 10.1109/sffcs.1999.814590

DO - 10.1109/sffcs.1999.814590

M3 - Conference article

AN - SCOPUS:0033352910

SN - 0272-5428

SP - 181

EP - 190

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

T2 - Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science

Y2 - 17 October 1999 through 19 October 1999

ER -

Near-optimal conversion of hardness into pseudo-randomness

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this