IPG Algorith Broken!

[Bill Frantz]

At  4:21 PM 11/23/96 -0800, John Anonymous MacDonald wrote:
>At 12:33 PM 11/23/1996, Eric Murray wrote:
>>You point could have been that the same problem exists
>>for proofs- that next week someone could come up
>>with a way to prove, for all time, that an algorithim
>>really IS unbreakable.  So, to cover that posibility
>>I should have said "it's currently impossible to
>>prove an algorithim unbreakable". :-)
>
>Or, more accurately, nobody credible has seen such a proof.  But, a
>clever person might invent one.

I thought Shannon proved one-time-pads to be unbreakable using information
theory.


-------------------------------------------------------------------------
Bill Frantz       | The lottery is a tax on    | Periwinkle -- Consulting
(408)356-8506     | those who can't do math.   | 16345 Englewood Ave.
frantz at netcom.com |       - Who 1st said this? | Los Gatos, CA 95032, USA