Tag Info

New answers tagged

3

No, there is no known way. It would actually be rather surprising if there were even a theoretical way; the SHA-256 and the SHA-512 compression functions are rather different (for one, one works with 32 bit words and the other works with 64 bit words); one wouldn't expect them to share any sort of relation.


1

I don't think this problem is solvable as specified. With a small message space, and deterministic hashing (or encryption), a generic attack involves exhaustively searching all likely messages to find one that corresponds to the known hash / ciphertext. If all of the digits of the ID numbers were random, an exhaustive search would require about $10^{10} ...


0

Bitcoin uses a problem similar to that as a proof of work, although it uses SHA256 (actually SHA256 twice in a specified fashion), and you're modifying a small part of a larger message. With Bitcoin, you're trying to find a message which hashes to a value less than a specified target, which is expressed as a difficulty level. The higher the difficulty, the ...


3

As far as we know, SHA512 acts like a random function. So, the only way we know to find a preimage whose hash starts with 0x12345678, is to go through distinct preimages, and hash each one until we find one that starts with 0x12345678. If the output of SHA512 is equidistributed (and we have no reason to believe it isn't), then the probability of any hash ...



Top 50 recent answers are included