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

<record version="4" id="3458">
 <title>one-way function</title>
 <name>OneWayFunction</name>
 <created>2002-09-15 16:18:48</created>
 <modified>2006-11-16 10:39:04</modified>
 <type>Definition</type>
 <creator id="455" name="Henry"/>
 <author id="455" name="Henry"/>
 <classification>
	<category scheme="msc" code="68Q30"/>
 </classification>
 <synonyms>
	<synonym concept="one-way function" alias="one way function"/>
	<synonym concept="one-way function" alias="one-way"/>
	<synonym concept="one-way function" alias="one way"/>
 </synonyms>
 <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>A function $f$ is a \emph{one-way function} if for any probabilistic, polynomial time computable function $g$ and any polynomial function $p$ there is $m$ such that for all $n&gt;m$:

$$\operatorname{Pr}[f(g(f(x)))=f(x)]&lt;\frac{1}{p(n)}$$

where $x$ has length $n$ and all numbers of length $n$ are equally likely.

That is, no probabilistic, polynomial time function can effectively compute $f^{-1}$.

Note that, since $f$ need not be injective, this is a stricter requirement than
$$\operatorname{Pr}[g(f(x)))=x]&lt;\frac{1}{p(n)}$$

since not only is $g(f(x))$ (almost always) not $x$, it is (almost always) no value such that $f(g(f(x)))=f(x)$.</content>
</record>
