cryptoanarchy.wiki

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

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

Header Data

From: ichudov@algebra.com (Igor Chudov @ home)
To: unicorn@schloss.li (Black Unicorn)
Message Hash: c34042956837d3f9174c5f56321db1fba1f3c583d322f0160c41d6be51a9c265
Message ID: <199611240059.SAA16286@manifold.algebra.com>
Reply To: <Pine.SUN.3.94.961123175345.20738B-100000@polaris>
UTC Datetime: 1996-11-24 01:02:22 UTC
Raw Date: Sat, 23 Nov 1996 17:02:22 -0800 (PST)

Raw message

From: ichudov@algebra.com (Igor Chudov @ home)
Date: Sat, 23 Nov 1996 17:02:22 -0800 (PST)
To: unicorn@schloss.li (Black Unicorn)
Subject: Re: IPG Algorith Broken!
In-Reply-To: <Pine.SUN.3.94.961123175345.20738B-100000@polaris>
Message-ID: <199611240059.SAA16286@manifold.algebra.com>
MIME-Version: 1.0
Content-Type: text


Black Unicorn wrote:
> On Sat, 23 Nov 1996, Eric Murray wrote:
> > John Anonymous MacDonald writes:
> > > 
> > > 
> > > 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.
> > 
> > You can't prove a negative.  The best IPG could say is that
> > it can't be broken with current technology.
> > Next week someone might come up with a new way
> > to break ciphers that renders the IPG algorithim breakable.
> 
> Someone needs to write an IPG and Don Wood FAQ.  No, I'm not volunteering.

As a crypto amateur, I would appreciate a good technical explanation as
to why IPG's algorithm cannot be considered secure.

Thank you.

	- Igor.

Thread