# The Tale of One-Way Functions

@article{Levin2000TheTO, title={The Tale of One-Way Functions}, author={Leonid A. Levin}, journal={Problems of Information Transmission}, year={2000}, volume={39}, pages={92-103} }

The existence of one-way functions (owf) is arguably the most important problem in computer theory. The article discusses and refines a number of concepts relevant to this problem. For instance, it gives the first combinatorial complete owf, i.e., a function which is one-way if any function is. There are surprisingly many subtleties in basic definitions. Some of these subtleties are discussed or hinted at in the literature and some are overlooked. Here, a unified approach is attempted.

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 53 CITATIONS

## Quantum one-way permutation over the finite field of two elements

VIEW 3 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Reductions for One-Way Functions

VIEW 6 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## On complete one-way functions

VIEW 5 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## An Efficient Golden Ratio Method for Secure Cryptographic Applications

VIEW 2 EXCERPTS

CITES BACKGROUND

## Interested in publishing with us ? Contact book

VIEW 1 EXCERPT

CITES BACKGROUND

## Kolmogorov One-Way Functions Revisited

VIEW 1 EXCERPT

CITES BACKGROUND

## One Way Function Candidate based on the Collatz Problem

VIEW 2 EXCERPTS

CITES BACKGROUND

### FILTER CITATIONS BY YEAR

### CITATION STATISTICS

**3**Highly Influenced Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 29 REFERENCES

## Re: When will quantum computers become practical?

VIEW 1 EXCERPT

## A Pseudorandom Generator from any One-way Function

VIEW 1 EXCERPT

## A PseudorandomGenerator from any One - way Fun tion

## Polynomial - Time Algorithms for Prime Fa torization and Dis rete Logarithms on a Quantum Computer

## Average-case completeness of a word problem for groups

VIEW 1 EXCERPT

## Randomness and Non-determinism

VIEW 1 EXCERPT