Score:0

Suppose there exists a one-way function, show that there exists a one-way function with none of its input bit is a hardcore bit

us flag

I just learnt the definition of hardcore bit, and I have no intuition about this. I want to know what are the possible approaches to this problem.

cn flag
Hint: For any fixed output, some input bits must be hard to predict. But each bit can be easy to predict on *average* over random inputs.
Score:1
us flag

I get a good idea form my classmate.

Suppose that $f:\{0,1\}^n\to\{0,1\}^m$ is a one-way function.

We construct another one-way function $F:\{0,1\}^{n+1+\log(n+1)}\to\{0,1\}^{m+\log(n+1)+1}$ : For an input $x=x_0x_1\cdots x_{n-1}x_n||s$, where $s\in\{0,1,2,\cdots,n\}$ is a $\log(n+1)$-bit string, we have $$ F(x)=f(x_0x_1\cdots x_{s-1}x_{s+1}\cdots x_n)||s||x_s $$ Then we can prove that $F$ is a a one-way function with none of its input bit is a hardcore bit.

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.