3

Possible Duplicate:
Is SHA-512 bijective when hashing a single 512-bit block?

Is there any guarantee that there are no collisions for all 512-bit input values for SHA-512 (every 512-bit input has a unique output), or just that they are highly improbable and can't be algorithmically deduced?

Community
  • 1
nanofarad
  • 131
  • 4
  • 1
    Welcome to Cryptography Stack Exchange. I closed your question as we had a quite similar one (with a good answer) a time ago - the answer is essentially, no, for both parts of your question. – Paŭlo Ebermann Jun 05 '12 at 18:18
  • It's highly probable that they exist, they're just hard to find. – CodesInChaos Jun 06 '12 at 21:46

0 Answers0