Pseudorandom ensemble

Let $U=\{U_{n}\}_{{n\in {\mathbb {N}}}}$ be a uniform ensemble and $X=\{X_{n}\}_{n\in \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 author's web site.

This article is issued from Wikipedia - version of the 7/6/2013. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.