Misplaced Pages

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

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

Let ${\displaystyle U=\{U_{n}\}_{n\in \mathbb {N} }}$ be a uniform ensemble and ${\displaystyle X=\{X_{n}\}_{n\in \mathbb {N} }}$ be an ensemble. The ensemble ${\displaystyle X}$ is called pseudorandom if ${\displaystyle X}$ and ${\displaystyle 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 cryptography-related article is a stub. You can help Misplaced Pages by expanding it.

• v
• t
• e

• Algorithmic information theory
• Pseudorandomness
• Cryptography
• Cryptography stubs