> Or are you going to say that under all conditions that when your data is > outside of your control, that no one at any time is ever going to break > it?
There is a famous outstanding problem in computer science that relates to this. If you can solve it then the Clay Institute has committed to paying your ONE MILLION dollars! It is called the "P != NP" problem. Strangely enough, most everyone *believes* RSA, elliptical crypto, etc. are hard to crack but no has been able to *prove* they cannot be solved with a polynomial time algorithm. Chris -- [email protected] http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-list
