Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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… Expand

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… Expand

Highly Cited

1999

Highly Cited

1999

Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a… Expand

Highly Cited

1990

Highly Cited

1990

Much research in theoretical cryptography has been centered around finding the weakest possible cryptographic assumptions… Expand

Highly Cited

1989

Highly Cited

1989

A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core… Expand

Highly Cited

1989

Highly Cited

1989

One way hash functions are a major tool in cryptography. DES is the best known and most widely used encryption function in the… Expand

Highly Cited

1989

Highly Cited

1989

We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function… Expand

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… Expand

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… Expand

Highly Cited

1985

Highly Cited

1985

One-way are those functions which are easy to compute, but hard to invert on a non-negligible fraction of instances. The… Expand