Pseudorandom ensemble

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

Let [math]\displaystyle{ U = \{U_n\}_{n \in \mathbb{N}} }[/math] be a uniform ensemble and [math]\displaystyle{ X = \{X_n\}_{n \in \mathbb{N}} }[/math] be an ensemble. The ensemble [math]\displaystyle{ X }[/math] is called pseudorandom if [math]\displaystyle{ X }[/math] and [math]\displaystyle{ U }[/math] 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.