One-way permutations

A one-way permutation is an efficiently computable, length-preserving permutation of each that no efficient adversary inverts on a uniform input, except with negligible probability.

Syntax

A one-way permutation is a deterministic polynomial-time algorithm computing such that for every , the restriction is a permutation.

Properties

One-wayness

\begin{algorithm}
\algname{Game}
\caption{$\Game^{\mathrm{owp}}_{\pi,\calA}(\secpar)$}
\begin{algorithmic}
\State $x \getsr \bits^\secpar$
\State $\hat{x} \gets \calA(1^\secpar, \pi_\secpar(x))$
\Return $[\hat{x} = x]$
\end{algorithmic}
\end{algorithm}

A permutation is one-way if for all efficient ,

is negligible — Gol01. Hardness is on a uniform input over all of : for a one-way , the permutation of mapping to and fixing every other input is hard to invert on , yet it is the identity on a fraction of its domain, so it is not one-way — standard.

Other results

Participates in

Builds on One-way permutations

Barriers