Pseudorandom generator
In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps a random seed to a longer pseudorandom string such that no statistical test in the class can distinguish between the output of the generator and the uniform distribution. The random seed itself is typically a short binary string drawn from the uniform distribution.
Pseudorandom generator - Wikipedia Jump to content From Wikipedia, the free encyclopedia Formal concept in theoretical computer science and cryptography This article is about the formal concept in theoretical computer science. For the common meaning of this term, see Pseudorandom number generator . In theoretical computer science and cryptography , a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps a random seed to a longer pseudorandom string such that no statistical test in the class can distinguish between the output of the generator and t
related reading
- Pseudorandom permutation - Wikipediaen.wikipedia.org
- Pseudorandom Number Generators | Computer Securitytextbook.cs161.org
- Types of generators - The Rust Rand Bookrust-random.github.io
- /dev/random - Wikipediaen.wikipedia.org
- Permuted congruential generator - Wikipediaen.wikipedia.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Random self-reducibilityen.wikipedia.org
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- Mersenne Twisteren.wikipedia.org
- Myths about /dev/urandom2uo.de
- Lecture 14: Zero knowledge proofsboazbarak.org
- Pseudoprosetaylor.town