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:
“Self-denial is not a virtue: it is only the effect of prudence on rascality.”
—George Bernard Shaw (1856–1950)
“To get time for civic work, for exercise, for neighborhood projects, reading or meditation, or just plain time to themselves, mothers need to hold out against the fairly recent but surprisingly entrenched myth that “good mothers” are constantly with their children. They will have to speak out at last about the demoralizing effect of spending day after day with small children, no matter how much they love them.”
—Wendy Coppedge Sanford. Ourselves and Our Children, by Boston Women’s Health Book Collective, introduction (1978)
“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)
“There exists, at the bottom of all abasement and misfortune, a last extreme which rebels and joins battle with the forces of law and respectability in a desperate struggle, waged partly by cunning and partly by violence, at once sick and ferocious, in which it attacks the prevailing social order with the pin-pricks of vice and the hammer-blows of crime.”
—Victor Hugo (1802–1885)
“Sunshine of late afternoon—
On the glass tray
a glass pitcher, the tumbler
turned down, by which
a key is lying—And the
immaculate white bed”
—William Carlos Williams (1883–1963)
“We meet I don’t say when
But must bring to the meeting the maturest,
The longest-saved-up, raciest, localest
We have strength of reserve in us to bring.”
—Robert Frost (1874–1963)