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

Header Data

From: nobody@cypherpunks.ca (John Anonymous MacDonald)
To: cypherpunks@toad.com
Message Hash: 14689b246b98cf97254417fa14c59d1820e9a4f033bea5b55c05fc689348b235
Message ID: <199611231914.LAA10101@abraham.cs.berkeley.edu>
Reply To: N/A
UTC Datetime: 1996-11-23 19:20:16 UTC
Raw Date: Sat, 23 Nov 1996 11:20:16 -0800 (PST)

Raw message

From: nobody@cypherpunks.ca (John Anonymous MacDonald)
Date: Sat, 23 Nov 1996 11:20:16 -0800 (PST)
To: cypherpunks@toad.com
Subject: Re: IPG Algorith Broken!
Message-ID: <199611231914.LAA10101@abraham.cs.berkeley.edu>
MIME-Version: 1.0
Content-Type: text/plain



At 8:09 AM 11/23/1996, Eric Murray wrote:
>No, you can't.  It's impossible to prove an algorithim unbreakable.

No?  Please prove your assertion.

Your claim is similar to IPG's - nobody has done it yet.

Your claim is stronger - hardly anybody has worked on IPG's algorithm,
nor are they likely to.

diGriz







Thread