A year shown by a TLS confidentiality calculator should be treated as a planning estimate—not a known date when TLS will stop being secure. The underlying concern is “harvest now, decrypt later”: an attacker can capture encrypted traffic today and retain it in case a future quantum computer can decrypt it. The risk depends on how long the data must remain confidential, the cryptography protecting it, and how quickly systems can migrate.
What does “the year your TLS stops being secret” mean?
It means estimating how long data encrypted in transit might remain confidential against a future quantum-capable attacker. It does not identify a scheduled expiration date for TLS. NIST describes TLS as one of the most widely deployed online security protocols and a target for harvest-now-decrypt-later attacks: NIST: What Is Post-Quantum Cryptography? and NIST NCCoE: Frequently Asked Questions about Post-Quantum Cryptography.
The title’s specific tool, its inputs, formula, assumptions, and displayed year are not established here. Without those details, the result cannot be verified as an accurate forecast. More broadly, the cited guidance does not establish a universal year when TLS will lose confidentiality. Any estimate depends on assumptions about future quantum capability, the algorithms in use, and the time needed to change systems.
How harvest now, decrypt later works
An attacker does not need a quantum computer to begin this attack. They can record encrypted traffic now and store it. If a sufficiently capable quantum computer becomes available later and can break the relevant cryptography, some previously captured data could become readable.
#1 Best Overall
This makes the useful life of the information central to the risk. A short-lived secret may no longer matter by the time a future decryption capability exists; medical, financial, government, or business information that must stay confidential for years or decades may remain valuable to an attacker for much longer. NIST frames this planning question as: “How long will my data need to remain confidential?” See NIST’s post-quantum cryptography overview.
What determines a useful estimate?
A calculator’s result is only as meaningful as the assumptions behind it. For an organization assessing TLS-protected information, these factors matter:
Rank #2
- Full Stack Python Security: Cryptography, TLS, and attack resistance
- Manning
- ABIS BOOK
- Required confidentiality lifetime: Identify how long the information would cause harm if exposed. Rank systems holding long-lived sensitive data ahead of information whose value expires quickly.
- Cryptography in use: Determine which public-key algorithms protect key establishment and whether a system supports post-quantum or hybrid approaches. The label “TLS” alone does not reveal the cryptographic configuration.
- Migration lead time: Account for the work needed to inventory systems, test changes, coordinate with vendors, and deploy updates. A risk horizon that is farther away than the migration timeline can still require action now.
- Uncertainty about future capability: The date at which a quantum computer could break relevant cryptography is not established by the cited sources. A displayed year necessarily depends on a forecast or scenario, not a confirmed deadline.
Use a calculator’s year to prompt questions about these factors. Do not treat it as a guarantee that data is safe until that year or exposed immediately afterward.
Is 2035 the year TLS stops being secret?
No. NIST’s 2022 explanation of a White House memorandum describes 2035 as a federal goal to mitigate as much quantum risk as feasible by that year. That is a policy transition target, not a prediction of when a quantum computer will decrypt TLS traffic: NIST’s 2022 explanation of the federal memorandum.
Rank #3
Confusing the two dates can lead to poor decisions. A migration goal says when organizations are expected to make progress; a cryptographic-break forecast would estimate when a capability might exist. Neither date, by itself, determines the confidentiality horizon for a particular system’s data.
Independent reader supportYour contribution helps us test, update, and keep practical guides available for everyone.What should organizations do now?
NIST says its three post-quantum cryptography standards were finalized in 2024 and are ready to implement. It recommends identifying where vulnerable algorithms are used and planning updates or replacements. Its guidance also points organizations toward identifying sensitive data and discussing vendor readiness. See NIST’s overview of post-quantum cryptography and NIST NCCoE’s FAQ.
Rank #4
- Inventory cryptography: Map systems and vendors that use public-key cryptography, including TLS connections, and identify the algorithms and configurations involved.
- Rank data by secrecy lifetime: Record how long confidentiality must be maintained, then prioritize systems with sensitive information that needs protection for the longest period.
- Build a migration roadmap: Plan how and when to update or replace vulnerable cryptography, including testing and dependencies that could delay deployment.
- Ask vendors for concrete readiness information: Request their plans for post-quantum standards, supported products and versions, and expected update paths. NIST’s migration guidance is available at NIST and NIST NCCoE.
NIST mathematician Dustin Moody, who leads its post-quantum cryptography standardization project, urges organizations to begin transitioning to the standards immediately so their data remains secure in the quantum era. That advice is a call to plan and migrate—not evidence that a particular year marks the end of TLS confidentiality.
Quick Recap
Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply.
Do these 3 things before closing this tab:
1Clear out junk files and repair common Windows errors2Fix the driver behind crashes, sound loss and screen glitches3Repair Windows errors before they cause bigger problems

