cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1996-11-24 - Re: IPG Algorith Broken!

Header Data

From: nobody@cypherpunks.ca (John Anonymous MacDonald)
To: cypherpunks@toad.com
Message Hash: fe35140436b2849353a24f21e94c01dc86a952b77b90d91bddaf7927b15f120e
Message ID: <199611240904.BAA23488@abraham.cs.berkeley.edu>
Reply To: N/A
UTC Datetime: 1996-11-24 09:05:56 UTC
Raw Date: Sun, 24 Nov 1996 01:05:56 -0800 (PST)

Raw message

From: nobody@cypherpunks.ca (John Anonymous MacDonald)
Date: Sun, 24 Nov 1996 01:05:56 -0800 (PST)
To: cypherpunks@toad.com
Subject: Re: IPG Algorith Broken!
Message-ID: <199611240904.BAA23488@abraham.cs.berkeley.edu>
MIME-Version: 1.0
Content-Type: text/plain



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

Thread