Re:Why should hard be secure enough? Information and non-inv...
by StavrosK on Tuesday February 07, 2017 @01:09PM
(#13591250)
It's confusing to me why the author is confused by these. As you say, he's literally saying "if I know nothing about x, then I should also know nothing about 0x". Wtf? No.
Re:Why should hard be secure enough? Information and non-inv...
by geofft on Tuesday February 07, 2017 @01:32PM
(#13591424)
I think the confusion is between the idea that a hash function conveys zero information about the input, and the idea that you will have zero information about the input once seeing the output of the hash.
But if we move it out of math, it's easier to understand: if you have some guesses about x, and I tell you nothing, you have the same guesses about x. You don't stop having guesses.
Re:Why should hard be secure enough? Information and non-inv...
by acchow on Tuesday February 07, 2017 @01:09PM
(#13591248)
In code:
i(x) = x // We know i is uniformly distributed just as x is - preserve "unknowability"
f(x) = x^2 // We know f has higher probability between [0,1] than [1,2]
g(x) = 1 // We know g is always 1.
Just because your inputs are random, doesn't mean your output is - the implementation matters.
If I multiply x by 0, the distribution is now just 0.
If I take abs(x) now it is positive.
Are these confusing to anyone?