44 search results - page 1 / 9 » On basing one-way functions on NP-hardness |
PKC
1998
Springer
13 years 9 months ago
1998
Springer
One-way hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel one-way hash function based on cellular aut...
JCP
2008
13 years 4 months ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
ECCC
2000
13 years 4 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
EUROCRYPT
1997
Springer
13 years 9 months ago
1997
Springer