paint-brush
Will AES-256 Withstand The Gauntlet Thrown by Quantum Computers?by@wagslane
362 reads
362 reads

Will AES-256 Withstand The Gauntlet Thrown by Quantum Computers?

by Lane WagnerMarch 4th, 2020
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow

Too Long; Didn't Read

As quantum computers improve in performance and the number of qubits used for calculations increase, current crypto systems are under more threat of attack. Shor's algorithm solves the following problem: Given an integer N, find its prime factors. Because algorithms like RSA rely heavily on the fact that normal computers can't find prime factors quickly, they have remained secure for years. With quantum computers breaking that assumption, then it may be time to find new standards. The author is the Founder at qVault, who uses 256-bit keys and AES-256-GCM for all encryption.

Company Mentioned

Mention Thumbnail
featured image - Will AES-256 Withstand The Gauntlet Thrown by Quantum Computers?
Lane Wagner HackerNoon profile picture

With quantum computers getting more powerful every year, many worry about the safety of modern encryption standards. As quantum computers improve in performance and the number of qubits used for calculations increase, current crypto systems are under more threat of attack.

What will break It?

Many asymmetric encryption algorithms have been mathematically proven to be broken by quantum computers using Shor's algorithm. Shor's algorithm solves the following problem:

Given an integer N, find its prime factors.

https://en.wikipedia.org/wiki/Shor%27s_algorithm

Because algorithms like RSA rely heavily on the fact that normal computers can't find prime factors quickly, they have remained secure for years. With quantum computers breaking that assumption, then it may be time to find new standards.

The following are examples of encryption that Shor's algorithm can break:

What is Symmetric Encryption?

Symmetric encryption, or more specifically AES-256, is believed to be quantum resistant. That means that quantum computers are not expected to be able to reduce the attack time enough to be effective if the key sizes are large enough.

Grover's algorithm can reduce the brute force attack time to its square root. So for AES-128 the attack time becomes reduced to 2^64 (not very secure), while AES-256 becomes reduced to 2^128 which is still considered extremely secure.

Qvault uses 256-bit keys and AES-256-GCM for all encryption which gives us reason to believe our users remain protected against quantum attacks at least in the short term.

It is important to remember that even 256-bit keys derived from passwords actually can have less than 256-bits of entropy because an attacker could try deriving keys from likely passwords vs trying random 256-bit numbers.

For example, instead of randomly trying

  1. azpV4CYbAwQUP4BaJJJNDBxEUkghMF8x2Sd4Q7ihD04=
  2. mtOXPNln432smP3pd3rVLw9rpGGkVsiqRhUFLXy/KBw=
  3. ..

An attacker would try the following:

  1. password123 --> 75K3eLr+dx6JJFuJ7LwIpEpOFmwGZZkRiB84PURz6U8=
  2. password1234 --> uclQZA4bN0DpisuT5mnGV2b2Zw3RYJupH/QQUrpIxvM=
  3. ...

For this reason Qvault will soon offer optional physical cards which when used in conjunction with a password will give our users quantum resistant security for the foreseeable future.

If you are implementing AES in a crypto system in 2019 you should favor AES-256 over AES-128 for the quantum resistance that it offers.

Further Reading

https://eprint.iacr.org/2019/272.pdf

https://pdfs.semanticscholar.org/20da/4038038031bcbb99a1063180a40a2e25dc47.pdf

Featured image credit: https://www.scienceandtechnologyresearchnews.com/the-race-to-build-a-quantum-computer/

Follow us on medium! https://medium.com/qvault

(Originally published here)

(Disclaimer: The author is the Founder at qVault)