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

Let be a uniform ensemble and be an ensemble. The ensemble is called pseudorandom if and are indistinguishable in polynomial time.

References

edit
  • 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.

📚 Artikel Terkait di Wikipedia

Pseudorandomness

A pseudorandom sequence of numbers is one that appears to be statistically random, despite having been produced by a completely deterministic and repeatable

Distribution ensemble

also a stochastic process. Provable security Statistically close Pseudorandom ensemble Computational indistinguishability Goldreich, Oded (2001). Foundations

Algorithmic information theory

length – Formal information theory restatement of Occam's Razor Pseudorandom ensemble Pseudorandom generator – Formal concept in theoretical computer science

Statistical mechanics

the system and environment. These correlations appear as chaotic or pseudorandom influences on the variables of interest. By replacing these correlations

LCG

Hadron Collider Linear congruential generator, in mathematics, a type of pseudorandom number generator algorithm Liquid Cooling Garment, a component of space

Monte Carlo method

large amounts of random numbers, and their use benefitted greatly from pseudorandom number generators, which are far quicker to use than the tables of random

Geographic coordinate system

TomTom. What3words, a proprietary system that encodes GCS coordinates as pseudorandom sets of words by dividing the coordinates into three numbers and looking

Computational indistinguishability

indistinguishability. Lecture 4 - Computational Indistinguishability, Pseudorandom Generators Goldreich, O. (2003). Foundations of cryptography. Cambridge