Pseudorandom Ensemble

This article may be confusing or unclear to readers. Please help us clarify the article. There might be a discussion about this on the talk page. (July 2013) (Learn how and when to remove this template message)

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

Let ${\displaystyle U=\{U_n{\}}_{n\in \mathbb{\mathbb{N}}}}$ be a uniform ensemble and ${\displaystyle X=\{X_n{\}}_{n\in \mathbb{\mathbb{N}}}}$ be an ensemble. The ensemble ${\displaystyle X}$ is called pseudorandom if ${\displaystyle X}$ and ${\displaystyle U}$ are indistinguishable in polynomial time.

• 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.

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Pseudorandom ensemble. Read more