Pseudorandom ensemble

This article may be confusing or unclear to readers. Please help us clarify the article. There might be a discussion about this on the talk page. (July 2013) (Learn how and when to remove this template message)

|

In cryptography, a pseudorandom ensemble is a family of variables meeting the following criteria:

Let U={Un}n∈ℕ be a uniform ensemble and X={Xn}n∈ℕ be an ensemble. The ensemble X is called pseudorandom if X and U are indistinguishable in polynomial time.

## References

* Goldreich, Oded (2001). Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press. ISBN 0-521-79172-3. Fragments available at the author's web site.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Pseudorandom ensemble. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Pseudorandom_ensemble&oldid=3991596"