Jump to content

One-way function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 137.226.36.187 (talk) at 21:47, 11 November 2003. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A """one way function""" is a computable bijective function f with the following properties:

The computation of is tractable (which generally means that a polynomial algorithm for the computation is known, see complexity theory).

The computation of the inverse function is not tractable (i.e. no polynomial algorithm is known or exists).

An example of a one way function is the discrete lograithm.

One way functions are useful in cryptography, e.g. for digital signatures.