The following are several candidates for one-way functions (as of April 2009).

The existence of such one-way functions is still an open conjecture.

In this respect it is the hardware analog of a one-way function.

This concept is related to that of one-way function.

The main difference between these instruments is this: the first two perform purely physical, one-way functions.

This is accomplished by applying a cryptographic one-way function to the information.

One can create a bit-commitment scheme from any one-way function that is injective.

A classic example of a one-way function is multiplication of very large prime numbers.

The way it is usually done is by using a one-way function to change a string into a hash.

Their method begins with mathematical processes that are easy to compute, but hard to reverse, known as one-way functions.

Message digest - The output of a one-way function when applied to a stream of data.

In order to forge a message Eve would have to invert the one-way function .

To prove that ƒ is indeed a one-way function let's construct an argument by contradiction.

They can be obtained by using the one-way functions based on the worst-case hardness of lattice problems.

Most delay valves have a one-way function, where there is either no restriction or no movement in one direction.

Dr. Rivest announced that he would find such a one-way function and create a public key cryptosystem.

That's how the quantum one-way functions works.

Let f be an injective one-way function, with h a hard-core predicate.

One-way functions, in this sense, are fundamental tools for cryptography, personal identification, authentication, and other data security applications.

However, it is not known whether P NP implies the existence of one-way functions.

Let be a one-way function.

In each case, the hash is used because of an important property that hash algorithms all have: they are one-way functions.

A one-way function is a function that is easy to compute but hard to invert.

The one-way function is the evolution of a finite CA whose inverse is believed to be hard to find.

It was published in 1997 and uses a trapdoor one-way function that is relying on the difficulty of lattice reduction.