**Pseudorandom Generators**

A function *G _{l}*: {0,1}

*l*→ {0,1}

*m*, where

*l*<

*m*is a pseudorandom generator if:

*G*can be computed in time polynomial in_{l}*l**G*(_{l}*x*) is pseudorandom, when*x*is uniformly random.

Read more about this topic: Pseudorandom Generator Theorem, Introduction

### Other articles related to "pseudorandom generators, pseudorandom generator, 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 low-degree ... 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 considered are evaluations of low-d ...

**Pseudorandom Generators**in Cryptography - Applications

...

**Pseudorandom generators**have numerous applications in cryptography ... For instance,

**pseudorandom generators**provide an efficient analog of one-time pads ... Key length can be significantly reduced using a

**pseudorandom generator**if perfect security is replaced by semantic security ...

Main Site Subjects

Related Phrases

Related Words