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}
}
  • Leonid A. Levin
  • Published in Probl. Inf. Transm. 2000
  • Computer Science, Mathematics
  • Problems of Information Transmission
  • 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

    Pseudorandomness and the Minimum Circuit Size Problem

    • Rahul Santhanam
    • Mathematics, Computer Science
    • Electronic Colloquium on Computational Complexity
    • 2019

    Kolmogorov One-Way Functions Revisited

    VIEW 1 EXCERPT
    CITES BACKGROUND

    One Way Function Candidate based on the Collatz Problem

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    PPP-Completeness with Connections to Cryptography

    FILTER CITATIONS BY YEAR

    2000
    2020

    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?

    • P. W. Shor
    • Usenet group sci.physics.research,
    • 2000
    VIEW 1 EXCERPT

    A PseudorandomGenerator from any One - way Fun tion

    • Mi hael Luby Leonid A. Levin
    • SIAM J . Comp .
    • 1999

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

    • W. ShorP.
    • SIAM J . Comp .
    • 1997

    Average-case completeness of a word problem for groups

    • Jie Wang
    • Mathematics, Computer Science
    • STOC '95
    • 1995
    VIEW 1 EXCERPT

    Randomness and Non-determinism

    VIEW 1 EXCERPT

    Matrix decomposition problem is complete for the average case

    • Yuri Gurevich
    • Mathematics, Computer Science
    • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
    • 1990
    VIEW 1 EXCERPT

    No better ways to generate hard NP instances than picking uniformly at random

    VIEW 3 EXCERPTS