Pseudorandom ensemble
From Wikipedia, the free encyclopedia
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.
[edit] 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.
