New answers tagged

2

Suppose the input of SHA-512 is 512 bits of data (so exactly the same size as the output). If I would test every possible combination (so $2^{512}$ calculations), then will the output also be exactly $2^{512}$ different hashes, or will collisions occur? It would be astonishing if SHA-512 turned out to be a permutation on 512-bit inputs, so no, absent a ...


4

If you skip the padding and final non-padding characters then yes, each character should be equally likely. The output of SHA-256 is indistinguishable from random if you cannot guess the input. This also goes for iterations of the hash calculations over itself. The final characters are not over just SHA-256 but are padded with zero characters. This is ...


8

In short: Will every possible 'final' password be equally likely? Yes, we expect that they equally likely. Cryptographic hash functions expected to have a well-distributed output. If you find any bias, you can convert this into an attack. Even there is a tiny bias then that can be used to attack for the hash function. You seem like you are going to use the ...


Top 50 recent answers are included