pseudorandom ensemble

{{confusing|date=July 2013}}

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

Let $U\; =\; \backslash \{U\_n\backslash \}\_\{n\; \backslash in\; \backslash mathbb\{N\}\}$ be a uniform ensemble

and $X\; =\; \backslash \{X\_n\backslash \}\_\{n\; \backslash in\; \backslash mathbb\{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 [http://www.wisdom.weizmann.ac.il/~oded/frag.html author's web site].

Category:Algorithmic information theory

Category:Pseudorandomness

Category:Cryptography

{{crypto-stub}}