Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,814 papers from all fields of science
Search
Sign In
Create Free Account
Pseudorandom generator
Known as:
Pseudorandom generators
In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
AC0
Algorithm
Circuit complexity
Computational complexity theory
Expand
Broader (1)
Algorithmic information theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Pseudorandom Generators from Polarizing Random Walks
Eshan Chattopadhyay
,
Pooya Hatami
,
Kaave Hosseini
,
Shachar Lovett
Electron. Colloquium Comput. Complex.
2018
Corpus ID: 19937588
We propose a new framework for constructing pseudorandom generators for n-variate Boolean functions. It is based on two new…
Expand
Highly Cited
2005
Highly Cited
2005
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
I. Damgård
,
Yuval Ishai
Annual International Cryptology Conference
2005
Corpus ID: 7321547
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom…
Expand
Highly Cited
2001
Highly Cited
2001
Extractors and pseudorandom generators
L. Trevisan
JACM
2001
Corpus ID: 6078275
We introduce a new approach to constructing extractors. Extractors are algorithms that transform a "e;weakly random"e…
Expand
Highly Cited
2000
Highly Cited
2000
Stable distributions, pseudorandom generators, embeddings and data stream computation
P. Indyk
Proceedings 41st Annual Symposium on Foundations…
2000
Corpus ID: 3923409
In this paper we show several results obtained by combining the use of stable distributions with pseudorandom generators for…
Expand
Highly Cited
1999
Highly Cited
1999
A Pseudorandom Generator from any One-way Function
J. Håstad
,
R. Impagliazzo
,
L. Levin
,
M. Luby
SIAM journal on computing (Print)
1999
Corpus ID: 5951610
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a…
Expand
Highly Cited
1999
Highly Cited
1999
Pseudorandom generators without the XOR lemma
M. Sudan
,
L. Trevisan
,
S. Vadhan
Proceedings. Fourteenth Annual IEEE Conference on…
1999
Corpus ID: 577594
Summary form only given. R. Impagliazzo and A. Wigderson (1997) have recently shown that if there exists a decision problem…
Expand
Highly Cited
1994
Highly Cited
1994
Pseudorandomness for network algorithms
R. Impagliazzo
,
N. Nisan
,
A. Wigderson
Symposium on the Theory of Computing
1994
Corpus ID: 7258383
We define pseudorandom generators for Yao’s two-party communication complexity model and exhibit a simple construction, based on…
Expand
Highly Cited
1992
Highly Cited
1992
Pseudorandom generators for space-bounded computation
N. Nisan
Comb.
1992
Corpus ID: 126021210
Pseudorandom generators are constructed which convertO(SlogR) truly random bits toR bits that appear random to any algorithm that…
Expand
Highly Cited
1989
Highly Cited
1989
Bit commitment using pseudorandomness
M. Naor
Journal of Cryptology
1989
Corpus ID: 15002247
We show how a pseudorandom generator can provide a bit-commitment protocol. We also analyze the number of bits communicated when…
Expand
Highly Cited
1985
Highly Cited
1985
One-way functions and pseudorandom generators
L. Levin
Symposium on the Theory of Computing
1985
Corpus ID: 15520002
One-way are those functions which are easy to compute, but hard to invert on a non-negligible fraction of instances. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE