Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with hard-core-predicate
Search options answers only
not deleted
user 452
A hard-core predicate of a one-way function $f$ is a predicate b (i.e., a function whose output is a single bit) which is easy to compute (as a function of x) but is hard to compute given $f(x)$.
1
vote
Hard-core bits from RSA assumption
Here is a partial result:
Assume that we have a way, given $x^e \bmod N$, to derive the parity of $x_S$. We further assume that $2 > N / 2^k > 1.5$ for some integer $k$, that is, the two msbits of $ …
- 151k