Results 1 
2 of
2
Structural properties of oneway hash functions
 Advances in cryptology  CRYPTO 90, Lecture Notes in Computer Science
, 1991
"... We study the following two kinds of oneway hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initialstring x, it is computationally difficult to find a different string y that collides with x. An ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We study the following two kinds of oneway hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initialstring x, it is computationally difficult to find a different string y that collides with x. And the main property of the latter is that it is computationally difficult to find a pair x � = y of strings such that x collides with y. Our main results are as follows. First we prove that UOHs with respect to initialstrings chosen arbitrarily exist if and only if UOHs with respect to initialstrings chosen uniformly at random exist. Then, as an application of the result, we show that UOHs with respect to initialstrings chosen arbitrarily can be constructed under a weaker assumption, the existence of oneway quasiinjections. Finally, we investigate relationships among various versions of oneway hash functions. We prove that some versions of oneway hash functions are strictly included in others by explicitly constructing hash functions that are oneway in the sense of the former but not in the sense of the latter. 1
Duality between two cryptographic primitives
 Papers of Technical Group for Information Security, IEICE of Japan
, 1990
"... This paper reveals a duality between constructions of two basic cryptographic primitives, pseudorandom string generators and oneway hash functions. Applying the duality, we present a construction for universal oneway hash functions assuming the existence of oneway permutations. Under a stronger ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudorandom string generators and oneway hash functions. Applying the duality, we present a construction for universal oneway hash functions assuming the existence of oneway permutations. Under a stronger assumption, the existence of distinctionintractable permutations, we prove that the construction constitutes a collisionintractable hash function. Using ideas behind the construction, we propose practical oneway hash functions, the fastest of which compress nearly 2nbit long input into nbit long output strings by applying only twice a oneway function. 1