Bitcoinist, libertarian, atheist, cryptography fan, and founder of http://qvault.io
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 following are examples of encryption that Shor's algorithm can break:
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
An attacker would try the following:
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.
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)