IPG Algorith Broken!

John Anonymous MacDonald nobody at cypherpunks.ca
Sun Nov 24 01:05:56 PST 1996



At 6:56 PM 11/23/1996, The Deviant wrote:
>On Sat, 23 Nov 1996, John Anonymous MacDonald wrote:
>> The good news is that you can prove a negative.  For example, it has
>> been proven that there is no algorithm which can tell in all cases
>> whether an algorithm will stop.
>
>No, he was right.  They can't prove that their system is unbreakable.
>They _might_ be able to prove that their system hasn't been broken, and
>they _might_ be able to prove that it is _unlikely_ that it will be, but
>they *CAN NOT* prove that it is unbreakable.  This is the nature of
>cryptosystems.

Please prove your assertion.

If you can't prove this, and you can't find anybody else who has, why
should we believe it?

>> diGriz
>
>Use an anon. remailer and sign your posts.  Brilliant.  Just brilliant.

Oops!

diGriz








More information about the cypherpunks-legacy mailing list