# Pseudorandomness

## Papers overview

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

Highly Cited

2013

Highly Cited

2013

- IACR Cryptology ePrint Archive
- 2013

We introduce two new cryptographic primitives: functional digital signatures and functional pseudorandom functions. In aâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 2007

On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol by Christian Mauduit (Marseille) andâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- computational complexity
- 2007

Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators from a uniform complexity assumption onâ€¦Â (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

1996

Highly Cited

1996

- Princeton computer science notes
- 1996

No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish inâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- STOC
- 1996

The race to find the weakest possible assumptions on which to base cryptographic primitives such aa oblivious transfer wasâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- STOC
- 1994

We define pseudorandom generators for Yaoâ€™s two-party communication complexity model and exhibit a simple construction, based onâ€¦Â (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

1987

Highly Cited

1987

- 1987

Some people may be laughing when looking at you reading in your spare time. Some may be admired of you. And some may want be likeâ€¦Â (More)

Is this relevant?