Pseudorandom ensemble

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

Let <math>U = \{U_n\}_{n \in \mathbb{N</math> be a uniform ensemble

and <math>X = \{X_n\}_{n \in \mathbb{N</math> be an ensemble. The ensemble <math>X</math> is called pseudorandom if <math>X</math> and <math>U</math>

are indistinguishable in polynomial time.

References

• Goldreich, Oded (2001). Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press. . Fragments available at the author's web site.