Lesson plan

Pseudorandom ensemble

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.

Back to article

Article summary

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.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.