A body of research of mine I fear ends the robustness of RSA encryption as a means of securing the Internet.
Powerful factoring algorithms should be possible now based on the new research.
It seems reasonable to me to suppose at this time that such methods will be developed and I believe they would probably end the viability of RSA encryption, which as I understand it depends on the difficulty of factoring a product of two large primes to provide a public key.
In the past I worried quite a bit about finding a result that could rapidly change the factoring landscape but now feel that the world is robust enough that it can have nominal impact as long as rational solutions are pursued with serious intent and some forethought.
For instance, a simple step post-RSA would be the directing of confidential information through secure routers, so that if, say, packets were tagged as containing confidential information, routers would only send to other secure routers so that the information would be protected in that way.
Wireless networks might see the least impact, as it seems to me that keys can simply be transferred by physical means, like by jump drives and the systems would be just as secure as long as at no point they relied on public key encryption.
My opinions here are the result of my own research and knowledge where I do not claim to be an expert on RSA encryption nor on network security. It can seem reasonable that I am wrong about the mathematics as well, especially its implication, but those simple congruences are, of course, easily testable.
James Harris
Monday, February 11, 2008
Securing networks, post RSA encryption
Subscribe to:
Post Comments (Atom)
0 comments:
Post a Comment