Download proof_problems/exam1/problem2.tex from yuuwwang/aicrypto: direct link, hf CLI and curl.
- Browser
- Download file 327 Bytes
-
https://huggingface.co/datasets/yuuwwang/aicrypto/resolve/main/proof_problems/exam1/problem2.tex
- Command line
-
hf download hf://datasets/yuuwwang/aicrypto/proof_problems/exam1/problem2.tex
-
curl -L -o problem2.tex https://huggingface.co/datasets/yuuwwang/aicrypto/resolve/main/proof_problems/exam1/problem2.tex
327 Bytes
| \paragraph{Problem 2 (18 points)} | |
| Show that there is no universal hardcore bit. | |
| In more detail, show that for every $n\in\mathbb{N}$, there is no deterministic function $h: \{0,1\}^n \to \{0,1\}$ such that for any polynomial $p()$, \emph{any} one-way function $f: \{0,1\}^n \to \{0,1\}^{p(n)}$, $h$ is a hardcore bit for $f$. |