Skip to search formSkip to main contentSkip to account menu

One-way function

Known as: One-way, One-way permutation, OWF 
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
We present, implement, and analyze a new scalable centralized algorithm, called OFT, for establishing shared cryptographic keys… 
Highly Cited
2001
Highly Cited
2001
Modern cryptography relies on algorithmic one-way functions—numerical functions which are easy to compute but very difficult to… 
Highly Cited
1999
Highly Cited
1999
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a… 
Highly Cited
1990
Highly Cited
1990
  • J. Rompel
  • Symposium on the Theory of Computing
  • 1990
  • Corpus ID: 10858937
Much research in theoretical cryptography has been centered around finding the weakest possible cryptographic assumptions… 
Highly Cited
1989
Highly Cited
1989
A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core… 
Highly Cited
1989
Highly Cited
1989
  • R. Merkle
  • Annual International Cryptology Conference
  • 1989
  • Corpus ID: 206579020
One way hash functions are a major tool in cryptography. DES is the best known and most widely used encryption function in the… 
Highly Cited
1989
Highly Cited
1989
  • M. NaorM. Yung
  • Symposium on the Theory of Computing
  • 1989
  • Corpus ID: 14383498
We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function… 
Highly Cited
1989
Highly Cited
1989
We show that the existence of one-way functions is necessary and sufficient for the existence of pseudo-random generators in the… 
Highly Cited
1989
Highly Cited
1989
It is shown that many of the standard cryptographic tasks are equivalent to the usual definition of a one-way function. In… 
Highly Cited
1985
Highly Cited
1985
  • L. Levin
  • Symposium on the Theory of Computing
  • 1985
  • Corpus ID: 15520002
One-way are those functions which are easy to compute, but hard to invert on a non-negligible fraction of instances. The…