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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We provide a characterization of pseudoentropy in terms of hardness of sampling: Let (X,B) be jointly distributed random… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A “randomness extractor” is an algorithm that given a sample from a distribution with sufficiently high min-entropy and a short… (More)
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We introduce a new approach to constructing extractors. Extractors are algorithms that transform a &quote;weakly random&quote… (More)
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • Jiri. Sobotik
  • 2001
This paper discusses some aspects of testing random and pseudorandom number generators. A Statistical Test Suite for Random and… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Impagliazzo andWigderson IW have recently shown that if there exists a decision problem solvable in time O n and having circuit… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Let f (xl, .. . xk) be a Boolean function that k parties wish to collaboratively evaluate, where each xi is a bit-string of… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We show how a pseudorandom generator can provide a bit-commitment protocol. We also analyze the number of bits communicated when… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Pseudorandom generators are constructed which convert O(SlogR) truly random bits to R bits that appear random to any algorithm… (More)
Is this relevant?