4 search results - page 1 / 1 » A Hard-Core Predicate for all One-Way Functions |
STOC
1989
ACM
13 years 9 months ago
1989
ACM
ECCC
2000
13 years 5 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...
CSR
2011
Springer
12 years 8 months ago
2011
Springer
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...
ICS
2010
Tsinghua U.
13 years 9 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...