Quantum computing will eventually break RSA and ECC encryption, the standards that protect most of the internet today. The reason to prepare now is not that a quantum computer exists today that can do it, but that encrypted data stolen today can be decrypted later, and migration to quantum-safe cryptography takes years. This article explains the timeline, the threat model, and the concrete steps organizations can take today.
Formula
The calculator estimates how long your data remains at risk from a future quantum computer. The formula is simple:
Total exposure window = years until quantum threat + (data retention days / 365)
Variables:
- Years until quantum threat – your estimate of when a quantum computer could break RSA-2048 or ECC-256 (commonly cited range: 10–20 years, but some experts say sooner).
- Data retention period (days) – how long you must keep encrypted data (e.g., 7 years for many financial records = 2555 days).
- Total exposure window (years) – the combined time from now until the data is no longer sensitive. If this is longer than the time until quantum threat, your data is at risk of “harvest now, decrypt later.”
Worked Example
Using the default values: 10 years until quantum threat, 2555 days retention (7 years).
- Convert days to years: 2555 / 365 = 7.0 years.
- Add the two: 10 + 7.0 = 17.0 years.
The calculator returns 17.0 years. This means if you store data for 7 years and a quantum computer arrives in 10 years, that data remains exposed for 17 years from today. Even if the quantum threat arrives later, the retention period alone can push the exposure past the migration deadline.
Why Quantum Computers Break Current Encryption
Most internet security relies on two hard math problems: factoring large numbers (RSA) and computing discrete logarithms (ECC). Classical computers cannot solve these efficiently for large key sizes, but a sufficiently powerful quantum computer running Shor’s algorithm can. In 1994, Peter Shor showed that a quantum computer could factor integers in polynomial time, which would render RSA and ECC obsolete. The catch is that the quantum computer needs thousands of logical qubits with low error rates – a machine that does not exist yet. However, progress is steady: companies and governments are investing billions, and some experts project a 10–20% chance of a quantum break by 2030, though most estimates put it later.
The “Harvest Now, Decrypt Later” Threat
Even if a quantum computer is 15 years away, any encrypted data transmitted today can be recorded and stored. When the quantum computer arrives, that data can be decrypted retroactively. This is a serious concern for data with a long shelf life: personal health records, government secrets, financial transactions, and intellectual property. For example, a patent filed today remains valuable for 20 years; a 30-year mortgage is sensitive for its full term. If you send encrypted data today that must stay secret for 10+ years, you are already at risk. This is why the U.S. National Institute of Standards and Technology (NIST) has been running a competition since 2016 to standardize post-quantum cryptography (PQC) algorithms.
What Is Post-Quantum Cryptography (PQC)?
PQC refers to cryptographic algorithms that are believed to be secure against both classical and quantum computers. They rely on different math problems, such as lattice-based, hash-based, or code-based cryptography. In 2022, NIST selected four algorithms for standardization:
- CRYSTALS-Kyber – for general encryption (key establishment).
- CRYSTALS-Dilithium – for digital signatures.
- FALCON – for digital signatures (alternative).
- SPHINCS+ – for hash-based signatures (alternative).
These are not yet widely deployed, but they are the likely replacements for RSA and ECC. NIST published the final standards in 2024, and vendors are beginning to integrate them into products.
What You Can Do Now
Preparation is not about replacing everything overnight – it is about reducing the risk of future decryption and making migration easier.
- Inventory your cryptographic assets: list all systems using RSA or ECC, including TLS certificates, VPNs, code signing, and document signatures.
- Prioritize by data sensitivity and retention: focus on data that must remain secret for 10+ years (health, finance, government).
- Adopt hybrid schemes: use a combination of classical and post-quantum algorithms (e.g., X25519Kyber768) to protect against both current and future attacks.
- Stay informed on NIST standards: plan to migrate to the finalized PQC algorithms when they become available in your software.
- Monitor quantum computing progress: track credible sources like NIST, academia, and industry roadmaps to update your timeline.
Common Misconceptions
One common myth is that quantum computers already exist that can break encryption. They do not. Another is that AES symmetric encryption is also at risk – it is not in the same way. Grover’s algorithm can speed up brute-force attacks on AES, but doubling the key size (e.g., from AES-128 to AES-256) restores security. So the immediate focus is on asymmetric cryptography (RSA, ECC). Another misconception is that migration is a simple software update. In practice, it requires careful planning because many protocols and devices have hardcoded key sizes or assumptions about algorithm performance.
Costs and Challenges of Migration
Migrating to PQC is not free. It involves:
- Hardware upgrades: some devices (e.g., IoT sensors, smart cards) may not have enough processing power or memory for PQC algorithms.
- Protocol redesign: TLS, VPN, and other protocols need changes to support new algorithms and key exchange methods.
- Testing and validation: ensuring interoperability and performance across different vendors and versions.
- Compliance: some industries may have regulatory requirements that mandate certain cryptographic standards.
These costs are why starting early is critical – a rushed migration after a quantum break is far more expensive and risky.
Frequently Asked Questions
Will quantum computers break all encryption?
No. Symmetric encryption like AES is only weakened, not broken – doubling the key size restores security. Asymmetric algorithms like RSA and ECC are the ones that become obsolete because Shor’s algorithm solves their underlying math problems efficiently.
When will a quantum computer actually break RSA?
There is no consensus. Estimates range from 10 to 30 years, but some experts believe it could happen sooner if breakthroughs in error correction occur. The threat is real enough that NIST has already standardized PQC algorithms, and governments are urging early adoption.
Is my data safe if I use a VPN or HTTPS?
Today, yes – but if an attacker records your encrypted traffic now, they can decrypt it later when a quantum computer exists. This is the “harvest now, decrypt later” risk. For data that must remain secret for decades, you should already be using quantum-safe or hybrid encryption.
What is the difference between quantum computing and post-quantum cryptography?
Quantum computing is the hardware that uses qubits to perform calculations. Post-quantum cryptography is the set of classical algorithms designed to resist attacks from such computers. PQC runs on normal computers – it does not require a quantum computer.
Can I use the same keys for both classical and PQC?
No. PQC algorithms have different key sizes and formats. You must generate new keys and certificates. Hybrid schemes combine both, but they still require separate key pairs for each algorithm.
What is the first step I should take today?
Start an inventory of where you use RSA and ECC, and identify data that must stay confidential for 10+ years. Then, plan to implement hybrid cryptography for those high-value systems as soon as your vendors support it.
Related
Formula used
in years | Years until quantum threat | years | 10 | 0 | 50 in days | Data retention period (days) | days | 2555 | 0 | 36500 out total | Total exposure window (years) | years | years + days / 365 | 1
Each line is one input (in, sel, list) or one result (out: label, unit, formula, decimals). How the calculators work
Method: the standard formula for this calculation, rounded as each result states. See how the calculators work or report an error.
More cards in this drawer
- Use Mac More Efficiently: 21 Proven Tips
- Best CPUs for Gaming and Streaming: Encoder Guide
- How to Compare AI Features and Performance in Phones
- Nginx Blocks in CentOS: Config Guide
- Create Google Meet Account: Step-by-Step Guide
- AI Frameworks: How Developers Choose and Ship Them