Results 1  10
of
3,601,479
associative, oneway functions
, 2004
"... Tight lower bounds on the ambiguity of strong, total, associative, oneway functions ..."
Abstract
 Add to MetaCart
Tight lower bounds on the ambiguity of strong, total, associative, oneway functions
On Complete OneWay Functions
, 2009
"... Complete constructions play an important role in theoretical computer science. However, in cryptography complete constructions have so far been either absent or purely theoretical. In 2003, L.A. Levin presented the idea of a combinatorial complete oneway function. In this paper, we present two new ..."
Abstract
 Add to MetaCart
Complete constructions play an important role in theoretical computer science. However, in cryptography complete constructions have so far been either absent or purely theoretical. In 2003, L.A. Levin presented the idea of a combinatorial complete oneway function. In this paper, we present two new
Physical OneWay Functions
 MIT
, 2001
"... Modern cryptography relies on algorithmic oneway functions numerical functions which are easy to compute but very difficult to invert. This dissertation introduces physical oneway functions and physical oneway hash functions as primitives for physical analogs of cryptosystems. Physical oneway f ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
Modern cryptography relies on algorithmic oneway functions numerical functions which are easy to compute but very difficult to invert. This dissertation introduces physical oneway functions and physical oneway hash functions as primitives for physical analogs of cryptosystems. Physical oneway
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 854 (18 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
The tale of oneway functions
 PROBLEMS OF INFORMATION TRANSMISSION
, 2003
"... The existence of oneway 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 oneway if any function is. The ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
The existence of oneway 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 oneway if any function is
Oneway Functions In Reversible Computations
, 1996
"... Oneway functions are used in modern cryptosystems as doortraps because their inverse functions are supposed to be difficult to compute. Nonetheless with the discovery of reversible computation, it seems that one may break a oneway function by running a reversible computer backward. Here, we argue ..."
Abstract
 Add to MetaCart
Oneway functions are used in modern cryptosystems as doortraps because their inverse functions are supposed to be difficult to compute. Nonetheless with the discovery of reversible computation, it seems that one may break a oneway function by running a reversible computer backward. Here, we
Separability and Oneway Functions
, 2000
"... We settle all relativized questions of the relationships between the following ve propositions: P = NP P = UP P = NP \ coNP All disjoint pairs of NP sets are Pseparable. ..."
Abstract

Cited by 26 (12 self)
 Add to MetaCart
We settle all relativized questions of the relationships between the following ve propositions: P = NP P = UP P = NP \ coNP All disjoint pairs of NP sets are Pseparable.
Physical OneWay Functions Abstract
, 2001
"... Modern cryptography relies on algorithmic oneway functions numerical functions which are easy to compute but very difficult to invert. This dissertation introduces physical oneway functions and physical oneway hash functions as primitives for physical analogs of cryptosystems. Physical oneway f ..."
Abstract
 Add to MetaCart
Modern cryptography relies on algorithmic oneway functions numerical functions which are easy to compute but very difficult to invert. This dissertation introduces physical oneway functions and physical oneway hash functions as primitives for physical analogs of cryptosystems. Physical oneway
Oneway functions and circuit complexity
 Information and Computation
, 1987
"... A finite function f is a mapping of {1, 2,..., m} into {1, 2,..., m} ∪ {#} where # is a symbol to be thought of as ‘‘undefined.’ ’ This paper defines a measure M ( f) of the difficulty of inverting a finite function f, which is given by M ( f) = MIN ⎧ log 2 C(g) _ ________ _ : g an inverse of f⎬ ⎭ ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
⎬ ⎭ where C ( f) is a circuit log 2 C ( f) complexity measure of the difficulty of computing f. We say that oneway functions exist (in a circuit complexity sense) if and only if M ( f) is unbounded. We prove that oneway functions exist if and only if the satisfiability problem SAT has polynomial sized
Results 1  10
of
3,601,479