Effect of Quantum Computing Attacks On Key Strength
The two best known quantum computing attacks are based on Shor's algorithm and Grover's algorithm. Of the two, Shor's offers the greater risk to current security systems.
Derivatives of Shor's algorithm are widely conjectured to be effective against all mainstream public-key algorithms including RSA, Diffie-Hellman and elliptic curve cryptography. According to Professor Gilles Brassard, an expert in quantum computing: "The time needed to factor an RSA integer is the same order as the time needed to use that same integer as modulus for a single RSA encryption. In other words, it takes no more time to break RSA on a quantum computer (up to a multiplicative constant) than to use it legitimately on a classical computer." The general consensus is that these public key algorithms are insecure at any key size if sufficiently large quantum computers capable of running Shor's algorithm become available. The implication of this attack is that all data encrypted using current standards based security systems such as the ubiquitous SSL used to protect e-commerce and Internet banking and SSH used to protect access to sensitive computing systems is at risk. Encrypted data protected using public-key algorithms can be archived and may be broken at a later time.
Mainstream symmetric ciphers (such as AES or Twofish) and collision resistant hash functions (such as SHA) are widely conjectured to offer greater security against known quantum computing attacks. They are widely conjectured to be most vulnerable to Grover's algorithm. Bennett, Bernstein, Brassard, and Vazirani proved in 1996 that a brute-force key search on a quantum computer cannot be faster than roughly 2n/2 invocations of the underlying cryptographic algorithm, compared with roughly 2n in the classical case. Thus in the presence of large quantum computers an n-bit key can provide at least n/2 bits of security. Quantum brute force is easily defeated by doubling the key length, which has little extra computational cost in ordinary use. This implies that at least a 160-bit symmetric key is required to achieve 80-bit security rating against a quantum computer.
Read more about this topic: Key Size
Famous quotes containing the words effect of, effect, quantum, attacks, key and/or strength:
“The cities of the world are concentric, isomorphic, synchronic. Only one exists and you are always in the same one. It’s the effect of their permanent revolution, their intense circulation, their instantaneous magnetism.”
—Jean Baudrillard (b. 1929)
“Where there is not discernment, the behavior even of the purest soul may in effect amount to coarseness.”
—Henry David Thoreau (1817–1862)
“The receipt to make a speaker, and an applauded one too, is short and easy.—Take of common sense quantum sufficit, add a little application to the rules and orders of the House, throw obvious thoughts in a new light, and make up the whole with a large quantity of purity, correctness, and elegancy of style.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)
“Stupidity is something unshakable; nothing attacks it without breaking itself against it; it is of the nature of granite, hard and resistant.”
—Gustave Flaubert (1821–1880)
“You have many choices. You can choose forgiveness over revenge, joy over despair. You can choose action over apathy.... You hold the key to how well you make the emotional adjustment to your divorce and consequently how well your children will adapt.”
—Stephanie Marston (20th century)
“Today, supremely, it behooves us to remember that a nation shall be saved by the power that sleeps in its own bosom; or by none; shall be renewed in hope, in confidence, in strength by waters welling up from its own sweet, perennial springs. Not from above; not by patronage of its aristocrats. The flower does not bear the root, but the root the flower.”
—Woodrow Wilson (1856–1924)