Pseudorandom

Some articles on pseudorandom:

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 ... That is, evaluating any low-degree polynomial at a point determined by the pseudorandom string is statistically close to evaluating the same polynomial at a point that is chosen uniformly at random ... Pseudorandom generators for low-degree polynomials are a particular instance of pseudorandom generators for statistical tests, where the statistical tests ...
Pseudorandom Encoder
... A pseudorandom encoder is an electro-mechanical device used for measuring distance and finding position ... The disk of a pseudorandom encoder has an evenly spaced notch design just as an incremental encoder to measure distance ... from reading from multiple parallel tracks while a pseudorandom encoder uses one single track ...
Pseudorandom Generator Theorem
... complexity theory and cryptography, the existence of pseudorandom generators is related to the existence of one-way functions through a number of theorems, collectively ...
Pseudorandom Generator Theorem - Existence of Pseudorandom Generators
... The existence of pseudorandom generators is related to the existence of one-way functions and hard-core predicates ... Formally, pseudorandom generators exist if and only if one-way functions exist, or ...
Pseudorandom Generator Theorem - Introduction - Pseudorandom Generators
... A function Gl {0,1}l → {0,1}m, where l < m is a pseudorandom generator if Gl can be computed in time polynomial in l Gl(x) is pseudorandom, when x is uniformly random ...