- Fields of mathematics
- >
- Applied mathematics
- >
- Theoretical computer science
- >
- Pseudorandomness

- Measure theory
- >
- Probability theory
- >
- Statistical randomness
- >
- Pseudorandomness

- Probability
- >
- Probability theory
- >
- Statistical randomness
- >
- Pseudorandomness

- Probability
- >
- Randomness
- >
- Statistical randomness
- >
- Pseudorandomness

- Statistics
- >
- Statistical theory
- >
- Statistical randomness
- >
- Pseudorandomness

Stochastic screening

Stochastic screening or FM screening is a halftone process based on pseudo-random distribution of halftone dots, using frequency modulation (FM) to change the density of dots according to the gray lev

Pseudorandom binary sequence

A pseudorandom binary sequence (PRBS), pseudorandom binary code or pseudorandom bitstream is a binary sequence that, while generated with a deterministic algorithm, is difficult to predict and exhibit

Pseudorandom generators for polynomials

In theoretical computer science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to a longer pseudorandom string in such a way that lo

Small-bias sample space

In theoretical computer science, a small-bias sample space (also known as -biased sample space, -biased generator, or small-bias probability space) is a probability distribution that fools parity func

Pseudorandom noise

In cryptography, pseudorandom noise (PRN) is a signal similar to noise which satisfies one or more of the standard tests for statistical randomness. Although it seems to lack any definite pattern, pse

Hard-core predicate

In cryptography, a hard-core predicate of a one-way function f is a predicate b (i.e., a function whose output is a single bit) which is easy to compute (as a function of x) but is hard to compute giv

Verifiable random function

In cryptography, a verifiable random function (VRF) is a public-key pseudorandom function that provides proofs that its outputs were calculated correctly. The owner of the secret key can compute the f

Maximum length sequence

A maximum length sequence (MLS) is a type of pseudorandom binary sequence. They are bit sequences generated using maximal linear-feedback shift registers and are so called because they are periodic an

Ehrenfeuchtâ€“Mycielski sequence

The Ehrenfeuchtâ€“Mycielski sequence is a recursively defined sequence of binary digits with pseudorandom properties, defined by Andrzej Ehrenfeucht and Jan Mycielski.

Pseudorandom generator theorem

In computational complexity theory and cryptography, the existence of pseudorandom generators is related to the existence of one-way functions through a number of theorems, collectively referred to as

Pseudorandomness

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

PRF advantage

In cryptography, the pseudorandom-function advantage (PRF advantage) of an algorithm on a pseudorandom function family is a measure of how effectively the algorithm can distinguish between a member of

Extractor (mathematics)

An -extractor is a bipartite graph with nodes on the left and nodes on the right such that each node on the left has neighbors (on the right), which has the added property thatfor any subset of the le

Pseudorandom ensemble

In cryptography, a pseudorandom ensemble is a family of variables meeting the following criteria: Let be a uniform ensembleand be an ensemble. The ensemble is called pseudorandom if and are indistingu

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 s

Pseudorandom function family

In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle in the following way: no efficient algorithm can dis

Â© 2023 Useful Links.