<?xml version="1.0" encoding="UTF-8"?>

<record version="3" id="3460">
 <title>pseudorandom generator</title>
 <name>PsuedorandomGenerator</name>
 <created>2002-09-15 16:39:09</created>
 <modified>2005-02-14 19:47:27</modified>
 <type>Definition</type>
 <creator id="455" name="Henry"/>
 <author id="455" name="Henry"/>
 <classification>
	<category scheme="msc" code="68Q30"/>
 </classification>
 <defines>
	<concept>stretch function</concept>
 </defines>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here
%\PMlinkescapeword{theory}</preamble>
 <content>Let $G$ be a deterministic polynomial-time function from $\mathbb{N}^{&lt;\omega}$ to $\mathbb{N}^{&lt;\omega}$ with \emph{stretch function} $l:\mathbb{N}\rightarrow\mathbb{N}$, so that if $x$ has length $n$ then $G(x)$ has length $l(n)$.  Then let $G_n$ be the distribution on strings of length $l(n)$ defined by the output of $G$ on a randomly selected string of length $n$ selected by the uniform distribution.

Then we say $G$ is \emph{pseudorandom generator} if $\{G_n\}_{n\in\mathbb{N}}$ is pseudorandom.

In effect, $G$ translates a random input of length $n$ to a pseudorandom output of length $l(n)$.  Assuming $l(n)&gt;n$, this expands a random sequence (and can be applied multiple times, since $G_n$ can be replaced by the distribution of $G(G(x))$).</content>
</record>
