5 ms·
As said above, this is well known in crypto circles. There's even a quantum coin flipping protocol to address the possible future case where these sorts of fac
by qbunny 17y ago
As said above, this is well known in crypto circles. There's even a quantum coin flipping protocol to address the possible future case where these sorts of factoring-based bit commitment schemes are insecure. (see the seminal BB84 quantum cryptography paper or a recent experimental demonstration of a "fair" quantum coin flipping protocol by F. Bussieres.)
- RiderOfGiraffes 17y agoTwo observations: evgen above seems to think it's wrong, and yet you seem to be saying it's right (implicitly, because it's "well known in crypto circles.") So, is it right or wrong? Obviously I believe it to be right ... Secondly, I know that it's well known in crypto circles. I read about it, refined it (I hope without breaking it as evgen suggests but does not prove) and reproduce it here because it does not seem to be well known outside of them. I find that this is about the most accessible non-obvious result, and yet it rarely seems to be described in simple, clear terms. I've tried to do so here, but if you know of a better, clearer explanation I'd genuinely appreciate the pointer. Thanks. (small edits for clarity)
- stephen_cagle 17y agoNear as I can tell (no expert mind you) it seems right. Given that SHA is secure (cannot calculate a plaintext that will result in the same SHA result) then only the original text could have reasonably generated it. Sending the SHA result to your friend does not help him in determining your original plaintext. Only with random text can he determine the plaintext that generated the SHA result. Seems good enough.