![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png) simont |
Fri 2008-04-18 09:23 |
You reckon? I don't think I'm nearly as confident: genuine proofs of security are pretty much unheard of except the kind that prove an attack is at least as hard as some other problem which hasn't actually been proved infeasible. I wouldn't be terribly surprised to find that the shortest proof of the unbreakability of the crypto algorithm consisted of a counterexample to every purported attack on it, and hence was infinitely long.
Still, it'd be worth a try, I suppose. |
|