Given the SHA256 hashing algorithm, is there any shortcut to determine whether 1 bit will be set in the output in a given position (or set of positions)? Relaxing the question a little bit, is there any probabilistic test (simpler than performing a full hash of course) to tell if a bit will be set (with probability 1) or not set (with probability <1)?
$\begingroup$
$\endgroup$
2
asked Dec 19, 2017 at 14:12
-
$\begingroup$ Should that last probability not be 1 as well? I can tell if a bit is unset with probability 0.5 without any problem at all. $\endgroup$– Maarten Bodewes ♦Dec 19, 2017 at 14:18
-
$\begingroup$ @MaartenBodewes I mean a probabilistic outcome as some primality tests: this number is not prime with probability 1 or it is prime with probability <1 $\endgroup$– Gianluca GhettiniDec 19, 2017 at 14:22
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
2
No, the output of the hash is indistinguishable from random. If there was a shortcut to determine the value of an output bit given a certain input (other than executing the hash) then the hash would be broken.
answered Dec 19, 2017 at 14:17
-
$\begingroup$ Well, if you are just interesting in bit one of output word 1 I presume you could shave off an instruction or two, but I have the strong impression that this will not count towards a break (or a shortcut) :P $\endgroup$– Maarten Bodewes ♦Dec 19, 2017 at 14:33
-
$\begingroup$ Yeah, you can ignore most of the last round if you only need one bit and it doesn't happen to be in the most mixed positions. $\endgroup$– otusDec 19, 2017 at 14:48