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

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.