Quantum Computing Not an Imminent Threat To Public Encryption

Bruce Schneier's latest blog entry points out an interesting analysis of how quantum computing will affect public encryption. The author takes a look at some of the mathematics involved with using a quantum computer to run a factoring algorithm, and makes some reasonable assumptions about the technological constraints faced by the developers of the technology. He concludes that while quantum computing could be a threat to modern encryption, it is not the dire emergency some researchers suggest.

Comments

Re:Shor's Algorithm

[profplump]

A) To the best of my knowledge is no theory that places even moderately strict bounds on the Rho method. That was the point of the original post. B) RSA has discontinued their factoring challenges.