TheInfoListRev V5.1.84
Xfr/
SummaryRelatedTreeNews

Topic summary

Pseudorandom ensemble

Pseudorandom ensemble

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

Let U={Un}n∈N{\displaystyle U=\{U_{n}\}_{n\in \mathbb {N} }}{\displaystyle U=\{U_{n}\}_{n\in \mathbb {N} }} be a uniform ensemble and X={Xn}n∈N{\displaystyle X=\{X_{n}\}_{n\in \mathbb {N} }}{\displaystyle X=\{X_{n}\}_{n\in \mathbb {N} }} be an ensemble. The ensemble X{\displaystyle X}{\displaystyle X} is called pseudorandom if X{\displaystyle X}{\displaystyle X} and U{\displaystyle U}{\displaystyle U} are indistinguishable in polynomial time.

Wikipedia source
AboutPrivacyContact

TheInfoList organizes topic information and links to original sources.

Loading topic…