Pseudorandom ensemble explained

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

Let

U = \{U _{n\}} _{n} be a uniform ensembleand X = \{X _{n\}} _{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. . Fragments available at the author's web site.