soneill@[EMAIL PROTECTED]
writes:
Do I understand you right? You assume that there could exist a second key
that
would decrypt a message encrypted with another key into meaningful
content?
Ok, nothing is impossible, but this comes pretty close. If you had a
single
charcter encrypted, you couldn't tell which decryption was right. But the
longer the encrypted message gets the less likey you find a second key
that
could result in a possible message.
In that respect hash functions wouldn't help, cause they always have
collisions. But to exploit that, you first needed to find a collision and
then
you would have to find a meaningful message that gave you the collision.
In short, if you use digital signatures for example, they don't confirm
100%
that you signed the do***ent, but with an error possibility of 10^-30 (I
don't
know to what parameters and system this would correspond, it is just a
very,
very small number).
|
