Sciweavers

4 search results - page 1 / 1
» One-Way Functions and the Berman-Hartmanis Conjecture
Sort
View
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
13 years 11 months ago
One-Way Functions and the Berman-Hartmanis Conjecture
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
Manindra Agrawal, Osamu Watanabe
ECCC
2000
113views more  ECCC 2000»
13 years 4 months ago
Candidate One-Way Functions Based on Expander Graphs
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...
Oded Goldreich
IEICET
2006
73views more  IEICET 2006»
13 years 4 months ago
Candidate One-Way Functions on Non-Supersingular Elliptic Curves
This paper proposes candidate one-way functions constructed with a certain type of endomorphisms on non-supersingular elliptic curves and presents several pieces of evidence of the...
Taiichi Saito, Fumitaka Hoshino, Shigenori Uchiyam...
CSR
2011
Springer
12 years 8 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov