# Pseudorandom generator

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- STOC
- 2011

We provide a characterization of pseudoentropy in terms of hardness of sampling: Let (X,B) be jointly distributed random… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IACR Cryptology ePrint Archive
- 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

- J. ACM
- 2005

A “randomness extractor” is an algorithm that given a sample from a distribution with sufficiently high min-entropy and a short… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- J. ACM
- 2001

We introduce a new approach to constructing extractors. Extractors are algorithms that transform a "e;weakly random"e… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Application

- 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

- SIAM J. Comput.
- 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

- J. Comput. Syst. Sci.
- 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

- J. Comput. Syst. Sci.
- 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

- Journal of Cryptology
- 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

- STOC
- 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?