In cryptography, a pseudorandom ensemble is a family of variables meeting the following criteria: Let U = { U n } n ∈ N {\displaystyle U=\{U_{n}\}_{n\in \mathbb {N} }} be a uniform ensemble and X = { X n } n ∈ N {\displaystyle X=\{X_{n}\}_{n\in \mathbb {N} }} be an ensemble. The ensemble X {\displaystyle X} is called pseudorandom if X {\displaystyle X} and U {\displaystyle 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 ∈ N {\displaystyle U=\{U_{n}\}_{n\in \mathbb {N} }} be a uniform ensemble and X = { X n } n ∈ N {\displaystyle X=\{X_{n}\}_{n\in \mathbb {N} }} be an ensemble. The ensemble X {\displaystyle X} is called pseudorandom if X {\displaystyle X} and U {\displaystyle U} are indistinguishable in polynomial time.
Source: Wikipedia "Pseudorandom ensemble" · CC BY-SA 4.0
Share this article: X · Bluesky