Pseudorandom ensemble

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In cryptography, a pseudorandom ensemble is a family of variables meeting the following criteria: 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.

In cryptography, a pseudorandom ensemble is a family of variables meeting the following criteria: 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. . Fragments available at the author's web site.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1208064941 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.