Also imagine that it can test a key in the amount of time it takes light to cross it. Imagine a computer that is the size of a grain of sand that can test keys against some encrypted data. Burt Kaliski first came up with this characterization, and if he had a nickel for every time I tell it, he could buy a latte or three. It is very easy to underestimate the power of exponentials. We have argued for, designed, and built systems with 128 bits of security precisely because they are essentially unbreakable. Modern cryptographic systems are essentially unbreakable, particularly if an adversary is restricted to intercepts. In it, Jon describes the impossibility of brute force attacks on modern cryptography: ![]() Cory Doctorow recently linked to this fascinating email from Jon Callas, the CTO of PGP corporation.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |