17 Dec
2003
17 Dec
'03
11:17 p.m.
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. -- Forward complaints to : European Association of Envelope Manufactures Finger for Public Key Gutenbergstrasse 21;Postfach;CH-3001;Bern Vote Monarchist Switzerland