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. 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". :-) -- Eric Murray ericm@lne.com ericm@motorcycle.com http://www.lne.com/ericm PGP keyid:E03F65E5 fingerprint:50 B0 A2 4C 7D 86 FC 03 92 E8 AC E6 7E 27 29 AF