Short answer: Yes, eventually, but not the way most headlines suggest. A large, error-corrected quantum computer could break the public-key cryptography that secures websites, messaging apps, software updates, and digital signatures. No machine that can do this exists today, and the people responsible for internet security have been building replacements for years. Your passwords aren’t about to be cracked overnight, and you don’t need to panic. But some of the data being sent over the internet right now could be at risk later, which is why the transition is already underway.
This guide explains what quantum computers actually do, which parts of encryption they threaten and which they don’t, how far along the technology really is, and what you can do about it, whether you’re an everyday user or someone responsible for an organization’s security.
What quantum computing actually is?
Your laptop, your phone, and the servers behind your bank all work with bits. A bit is either 0 or 1. Everything you do on a computer, from streaming video to running encryption, comes down to enormous numbers of these simple switches flipping very fast.
A quantum computer works with qubits. Like a bit, a qubit gives you a 0 or a 1 when you measure it. Before you measure it, though, it can exist in a combination of both states, which physicists call superposition. The usual way to picture this is a spinning coin: while it’s spinning, it isn’t cleanly heads or tails, and only when it lands do you get a definite answer.
That picture is a bit misleading if you take it too literally, so it helps to be more precise. A qubit’s state is described by numbers called amplitudes, which can be positive, negative, or even complex numbers. When you measure, the amplitudes determine the probability of getting 0 or 1. The key point is that amplitudes can cancel each other out or reinforce each other, much like waves in water.
Two other ideas matter here.
Entanglement. Qubits can be linked so that their states depend on each other, even though you can’t describe each qubit independently. If you have several entangled qubits, the system as a whole carries information that no individual qubit holds on its own. This is how a quantum computer’s state space grows so quickly. Describing the full state of 50 qubits on a classical computer requires tracking over a quadrillion numbers, and each extra qubit doubles that.
Interference. This is the part that makes quantum algorithms useful, and it’s the most commonly skipped. A quantum algorithm is a carefully designed sequence of operations that arranges the amplitudes so wrong answers cancel each other out and the right answer becomes more likely when you measure. The computer isn’t trying every possibility at once and picking the winner. That “tries everything in parallel” description is popular, and it’s wrong. If it were true, quantum computers would solve everything instantly. What actually happens is a choreographed process that exploits interference, and it only works for problems with the right mathematical structure.
Why this isn’t just a faster computer
People often assume quantum computers are simply much faster versions of the machines we already have. They aren’t. For most everyday tasks, including browsing the web, editing a document, or running a game, a quantum computer would be no help at all and would probably be slower and far more expensive than your phone.
What quantum computers offer is a different way of computing that gives dramatic speedups on specific kinds of problems. The most important ones are:
- Simulating quantum systems, such as molecules and materials. This is the original motivation. Physicist Richard Feynman suggested in the early 1980s that if nature behaves according to quantum mechanics, the best way to simulate it might be with a machine that works the same way. This could eventually help with drug discovery, battery chemistry, and fertilizer production.
- Certain optimization and search problems, where the speedup is more modest and more debated.
- Factoring large numbers and solving related math problems, which is where the security concern comes from.
That last item is why cryptographers pay such close attention. A quantum algorithm discovered in 1994 turns out to be devastating for the particular math that protects most of the internet.
Where quantum computers stand today
If you read press releases, you’d think quantum computing is either about to change everything or is pure hype. The reality sits between those two views.
Companies and research labs have built working quantum processors using several different approaches. Superconducting circuits (used by Google and IBM), trapped ions (used by companies like Quantinuum and IonQ), neutral atoms, and photonics are all active areas. Today’s machines have somewhere from dozens to over a thousand physical qubits, depending on the design.
The problem is that qubits are fragile. Heat, vibration, stray electromagnetic fields, and even the act of controlling them introduce errors. Today’s physical qubits make mistakes far more often than the transistors in a normal processor, which almost never do. Running a long computation on error-prone qubits quickly turns the result into noise.
The solution is quantum error correction. The idea is to combine many physical qubits into one more reliable logical qubit, using redundancy to detect and fix errors as they happen. This is a hard engineering problem because the overhead is large: depending on the error rates and the code used, a single logical qubit can require hundreds or thousands of physical qubits.
There has been real progress. In late 2024, Google reported results from its Willow chip showing that adding more qubits to an error-correcting code reduced the error rate, rather than increasing it. This “below threshold” behavior is something researchers had been chasing for decades, because it shows error correction can scale in principle. Other groups have reported steady improvements in qubit quality and in demonstrations of small error-corrected systems.
Still, a machine with the thousands of high-quality logical qubits needed for serious cryptographic attacks doesn’t exist. Several companies have published roadmaps aiming for large-scale, fault-tolerant machines later this decade or in the 2030s. IBM, for instance, has publicly stated a goal of a fault-tolerant system by 2029. Roadmaps are targets rather than guarantees, and the timelines in this industry have a habit of slipping, but they also show that serious money and serious engineering are aimed at this problem.
One more thing worth knowing: headlines about quantum computers “breaking RSA” have appeared several times, and they’ve generally been exaggerated. Some involved tiny numbers that classical computers factor trivially, and others used specialized machines that can’t run the relevant algorithm. When you see one, check whether the number being factored was anywhere near a real 2048-bit key. So far, none have been.
How today’s encryption works
To understand what’s threatened, you need a rough picture of what protects your data now. Modern security uses two broad families of cryptography, and quantum computers affect them very differently.
Symmetric encryption
In symmetric encryption, the same secret key locks and unlocks the data. AES is the standard example, and it’s what encrypts the bulk of your data: your files on an encrypted drive, the traffic inside a secure web connection, your phone’s storage. It’s fast and efficient. The challenge is that both sides need to share the key somehow without anyone else getting it.
Public-key (asymmetric) encryption
Public-key cryptography solves that problem. Each person has two mathematically linked keys, a public key that anyone can see and a private key that stays secret. It’s used for two main jobs:
- Key exchange. Two parties who’ve never met can agree on a shared secret key over an open network. When your browser connects to a secure website, this is what happens at the start, and then the rest of the session uses fast symmetric encryption with that agreed key.
- Digital signatures. Proving that a message, a software update, or a website’s certificate really came from who it claims to, and wasn’t altered along the way.
The most widely used public-key systems are RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), including its signature and key-exchange variants. Their security depends on math problems that are easy to do in one direction and extremely hard to reverse for classical computers:
- RSA relies on the difficulty of factoring a huge number into its two prime factors. Multiplying two 1,000-bit primes is trivial. Taking the product and recovering the primes is, with known classical methods, out of reach.
- Diffie-Hellman and ECC rely on related problems called the discrete logarithm problem and its elliptic curve version.
Nobody has proven these problems are hard. The security rests on the fact that brilliant people have tried for decades to find fast classical solutions and haven’t. That track record is the entire foundation, which matters in a moment, because quantum computers change the rules for exactly these problems.
How a quantum computer could break encryption
Shor’s algorithm and public-key cryptography
In 1994, mathematician Peter Shor published an algorithm showing that a sufficiently large quantum computer could factor large numbers and solve discrete logarithm problems in a reasonable amount of time. The difference from classical methods isn’t a small improvement. It’s the gap between “would take longer than the age of the universe” and “feasible in hours or days.”
Without getting into the math, the algorithm uses a quantum operation to find the repeating pattern hidden inside a number-theory problem. Interference makes the period of that pattern stand out when you measure, and once you know the period, ordinary math gives you the factors. It’s one of the clearest examples of a problem where quantum interference does something classical machines can’t match.
The consequences are broad. A quantum computer running Shor’s algorithm at sufficient scale would break:
- RSA, at any key size currently in practical use
- Diffie-Hellman key exchange
- Elliptic curve cryptography, including ECDH key exchange and ECDSA signatures
That list covers nearly everything that handles key exchange and digital signatures on today’s internet. Secure web connections, VPN handshakes, encrypted email, code signing, certificate authorities, cryptocurrency wallet signatures, and passkeys all depend on one of these.
How big would the machine need to be?
For years, the estimate for breaking a 2048-bit RSA key was around 20 million noisy physical qubits running for about eight hours, based on a 2019 analysis by researchers Craig Gidney and Martin Ekerå. In 2025, Gidney published a refined analysis estimating that fewer than a million noisy qubits could do the job in under a week. Those numbers are still far beyond current hardware, but the trend matters: the required resources have dropped substantially as algorithms and error-correction methods improved.
This is a recurring theme in the field. Progress comes from two directions at once, better hardware and better algorithms, and either can move the timeline forward. A breakthrough in one doesn’t have to wait for the other.
Grover’s algorithm and symmetric cryptography
Quantum computers also affect symmetric encryption, but much less. In 1996, Lov Grover described an algorithm that speeds up searching through an unstructured set of possibilities. Applied to guessing an encryption key, it provides a quadratic speedup, meaning the effort drops roughly to the square root of the original.
In practice, that effectively halves the key length in bits. A 128-bit AES key would offer about 64 bits of security against an ideal quantum attacker, and a 256-bit key would still offer about 128 bits, which is considered very strong. There’s another factor working in defenders’ favor: Grover’s algorithm is difficult to parallelize efficiently, and the overhead of running it on error-corrected hardware is substantial. Many analyses conclude that even AES-128 is unlikely to be practically breakable by Grover’s algorithm. The standard recommendation is simply to use AES-256 where you want a comfortable margin, and AES-256 is already common.
Hash functions like SHA-256 are in a similar position. They’re affected by quantum search algorithms to a limited degree, and increasing output sizes covers the gap.
So the summary is lopsided. Public-key cryptography faces a fundamental break. Symmetric cryptography needs, at most, longer keys.
What isn’t at risk
Because the topic is surrounded by dramatic language, it’s worth stating what quantum computers don’t do.
Your strong passwords aren’t suddenly weak. Passwords are typically protected by hashing, which is a symmetric-style technique, not by RSA or ECC. A long, random password remains difficult to guess. Shor’s algorithm doesn’t help an attacker crack a password hash.
Encrypted data at rest is mostly fine. Disk encryption and encrypted files using AES-256 hold up well. The weak point is how the keys were exchanged or protected, which is where public-key cryptography often comes in.
Quantum computers can’t break “all encryption.” This claim shows up constantly and is simply incorrect. The threat is to specific mathematical problems that Shor’s algorithm happens to solve.
There’s no hidden quantum machine reading your messages today. If one existed with that capability, we’d expect to see signs of it in the public research. Everything known about the state of the hardware says we aren’t there.
The “harvest now, decrypt later” problem
If the machine doesn’t exist yet, why is everyone talking about this now? Largely because of a strategy called “harvest now, decrypt later,” sometimes called “store now, decrypt later.”
The logic is simple. An attacker with access to network traffic, whether a government intelligence agency or a well-resourced criminal group, can record encrypted data today. They can’t read it yet. But if they store it and a capable quantum computer arrives in, say, 10 or 15 years, they could decrypt it then.
Whether this is a real concern for a given piece of data depends on a simple calculation sometimes called Mosca’s inequality. Add together:
- X: how long the data needs to stay confidential
- Y: how long it will take your organization to migrate to quantum-safe cryptography
If X plus Y is greater than Z, the time until a cryptographically relevant quantum computer exists, you have a problem. Data that has to stay secret for decades, such as government secrets, medical records, trade secrets, financial records, and long-term legal material, is the most exposed. A text message about dinner plans isn’t worth anyone’s storage costs. A diplomatic cable or a genome database is.
This is also why the timeline for the transition is driven by when systems need to be protected, rather than only when the quantum computer arrives. The recording can happen today. Only the decryption has to wait.
A related point: key exchange is the main target of harvesting. If an attacker records a session and later breaks the key exchange, they can recover the session key and decrypt the traffic. That’s why the first deployments of post-quantum cryptography have focused on key exchange rather than signatures. Signatures matter too, but a forged signature has to be forged at the time of the attack, so signatures can generally be migrated on a slightly later schedule.
When could “Q-Day” arrive?
“Q-Day” is the informal name for the moment a quantum computer can break widely used public-key cryptography. Nobody knows when it is, and anyone who gives you an exact year is guessing.
What we can say with reasonable confidence:
- It hasn’t happened.
- Experts’ estimates range widely, from “within the decade” at the optimistic end to “several decades away” or “possibly never at that scale” at the skeptical end.
- Resource estimates for the attack have been falling.
- Hardware has been improving, particularly in error correction.
- Migrating cryptography across the global internet is slow, and measured in years, often a decade or more.
That last point is the heart of the argument for acting early. Changing cryptography is not like patching a bug. It touches protocols, hardware, embedded devices, certificates, legacy software, and industrial equipment, some of which has a lifespan of 15 to 20 years. History offers a useful comparison: the move away from weak older algorithms such as SHA-1 and 3DES took many years even though the weaknesses were well known. Waiting until a quantum computer exists to start the migration would leave a long exposed gap.
So the sensible position is neither alarm nor dismissal. The risk is real enough, and the migration slow enough, that preparing now is reasonable even if Q-Day turns out to be 20 years off. If it turns out to be 10, preparing now is essential.
The fix: post-quantum cryptography
The good news is that cryptographers saw this coming. Post-quantum cryptography (PQC), sometimes called quantum-resistant or quantum-safe cryptography, refers to new algorithms designed to run on ordinary computers while resisting attacks from both classical and quantum machines. You don’t need a quantum computer to use them. They’re software that replaces the vulnerable math with different math.
What makes them quantum-resistant
These algorithms are based on mathematical problems that no known quantum algorithm solves efficiently. The main families are:
- Lattice-based cryptography. Built on problems such as Learning With Errors, which involve finding structure in noisy high-dimensional grids of points. Most of the leading standards use this approach because it’s efficient and flexible.
- Hash-based signatures. These rely only on the security of hash functions, which makes their security assumptions especially conservative, though the signatures are larger.
- Code-based cryptography. Based on the difficulty of decoding certain error-correcting codes. The McEliece system dates to 1978 and has resisted attack for decades, but it has very large public keys.
- Multivariate and isogeny-based schemes. Other approaches, with a more mixed record. A candidate called SIKE was broken in 2022 by a classical attack, running on an ordinary computer in a short time, after it had advanced deep into the standardization process.
That last example is worth remembering. It shows why the standardization process is public and slow, and why people are cautious about trusting new math too quickly. It also explains why the transition strategy leans on hybrid approaches, described below.
The NIST standards
The US National Institute of Standards and Technology (NIST) ran an open, multi-year competition, inviting cryptographers worldwide to submit and attack candidate algorithms. In August 2024 it published its first finalized post-quantum standards:
- FIPS 203 (ML-KEM), derived from the CRYSTALS-Kyber algorithm, for key establishment
- FIPS 204 (ML-DSA), derived from CRYSTALS-Dilithium, for digital signatures
- FIPS 205 (SLH-DSA), derived from SPHINCS+, a hash-based signature scheme intended as a conservative backup
NIST has also been working on a standard based on the Falcon signature scheme, and in 2025 it selected an additional key-establishment algorithm called HQC as a backup, based on a different mathematical approach than ML-KEM, so that a single break in lattice math wouldn’t leave the world without options.
NIST has also published a transition roadmap proposing that the older RSA and elliptic curve algorithms be deprecated by 2030 and disallowed by 2035 for federal use. Other governments have set their own timelines, and the US National Security Agency has published schedules for national security systems that phase in quantum-resistant algorithms across the early-to-mid 2030s. The details differ, but the direction is consistent across countries.
The trade-offs
Post-quantum algorithms aren’t a free upgrade. The main cost is size. An X25519 key exchange uses a public key of 32 bytes. An ML-KEM-768 public key is 1,184 bytes, and its ciphertext is 1,088 bytes. Post-quantum signatures are also larger: ML-DSA signatures in the lowest security level are around 2,400 bytes, compared with roughly 64 bytes for an elliptic curve signature.
That sounds minor, but at internet scale it matters. Larger handshakes mean more data and occasionally trouble with devices and middleboxes that weren’t built to handle them. Certificate chains, which include multiple signatures, grow considerably. Constrained devices such as smart cards, small sensors, and some embedded systems face real engineering challenges. Computation speed is generally fine, since lattice-based schemes are quite fast, but the bandwidth and memory costs are real.
Hybrid cryptography
Because the new algorithms are comparatively young, most early deployments combine them with the older ones. In a hybrid key exchange, the connection runs a traditional exchange (for example, X25519) and a post-quantum one (for example, ML-KEM) at the same time and combines the results. An attacker would have to break both to recover the key.
This is a practical hedge. If a flaw turns up in the new algorithm, the classical one still protects you against today’s attackers. If a quantum computer arrives, the post-quantum one protects you. It costs a bit of extra overhead for a substantial reduction in risk, and it’s the approach most browsers and services have taken so far.
What’s already changed
The migration isn’t theoretical. Parts of it are already running on devices you likely use.
Web browsers and servers. Chrome, Edge, Firefox, and other major browsers have enabled hybrid post-quantum key exchange for secure connections. Chrome began with a Kyber-based hybrid and later moved to the final ML-KEM standard. Large infrastructure providers such as Cloudflare have reported that a significant and growing share of connections through their networks already use post-quantum key agreement. If you’ve used an up-to-date browser with a major site recently, there’s a good chance your connection was protected this way without you noticing.
Messaging. Signal added a post-quantum key agreement in 2023 and has continued extending its protections. Apple introduced a protocol called PQ3 for iMessage in 2024, which adds quantum-resistant protection and periodic re-keying. These are aimed squarely at the harvest-now-decrypt-later threat.
Remote access tools. OpenSSH has supported post-quantum hybrid key exchange for some time and made it the default in recent releases, meaning that many administrators are already using it without changing any settings.
Cryptographic libraries. OpenSSL, BoringSSL, and other major libraries have added support for the new standards, which is the prerequisite for most software to follow.
What hasn’t moved nearly as far is the signature side: certificates, code signing, and the public key infrastructure that underpins trust on the web. Larger signatures create more complications, and the certificate ecosystem involves many independent parties, so this part will take longer. It’s also less urgent for the reason mentioned above, since forging a signature requires the quantum computer to exist at the moment of the attack.
What about quantum key distribution?
You might also have heard of quantum key distribution (QKD), which uses the physics of photons to share encryption keys, in a way that in theory reveals eavesdropping. It sounds like the obvious answer to a quantum threat, and it gets a lot of attention.
It’s a different thing from post-quantum cryptography, and for most uses it isn’t the recommended path. QKD requires specialized hardware and dedicated optical links, such as fiber or satellite connections. It doesn’t authenticate the parties on its own, so it still depends on other cryptography for that. It doesn’t scale easily to the general internet, and real-world implementations have been shown to be vulnerable to side-channel and hardware attacks. Security agencies in several countries, including the NSA and the UK’s National Cyber Security Centre, have said they prefer post-quantum cryptography over QKD for most applications.
QKD may have niche uses in specialized high-security networks, but for the average organization and certainly for individuals, it isn’t the answer.
What you can do as an individual
The reassuring news is that most of the work isn’t yours. The migration is being handled primarily by browser makers, operating system vendors, app developers, and the standards bodies. Still, there are practical steps that make a difference.
Keep your software updated. This is the single most useful thing you can do. Post-quantum protections reach most people through browser updates, OS updates, and app updates. If your devices run old software, they won’t get the new protections.
Use apps that take the problem seriously. For private messaging, an app with post-quantum protection in its protocol gives you protection against harvesting that others don’t. Check the vendor’s security documentation.
Don’t reuse passwords, and use a password manager. This hasn’t changed. Quantum computing doesn’t alter the basics, and password hygiene still blocks far more real-world attacks than any quantum scenario will for years.
Turn on multi-factor authentication. Same reasoning. The threats people are actually facing today are phishing, credential reuse, and account takeovers.
Consider which of your data needs long-term secrecy. For most people, very little. If you do handle sensitive information that must remain private for many years, such as medical research, legal files, or confidential business records, favor tools and providers that have published post-quantum plans.
Treat passkeys as a good move anyway. Passkeys currently rely on elliptic curve signatures, so they will eventually need post-quantum versions as the standards evolve. That doesn’t make them a bad choice. Their protection against phishing is a present-day benefit, and the underlying standards bodies are already working on quantum-resistant options. Expect this to arrive through updates rather than something you manage yourself.
Be skeptical of quantum scare marketing. Some vendors sell “quantum-proof” products with vague claims. Genuine post-quantum security refers to specific, standardized algorithms such as ML-KEM and ML-DSA. If a product claims to be quantum-safe without naming what it uses, treat that as a warning sign.
Cryptocurrency holders have a particular concern. Bitcoin, Ethereum, and most other chains rely on elliptic curve signatures. In many cases an address’s public key is only revealed when you spend from it, which offers some protection, but addresses whose public keys are already exposed on-chain would be more vulnerable. Communities are actively discussing upgrade paths. If you hold significant amounts, follow the discussion for your specific coins, and avoid reusing addresses.
What organizations should be doing?
If you manage systems for a business, a school, a healthcare provider, or any organization that holds sensitive data, the planning window is now. The steps are fairly consistent across government and industry guidance.
1. Build a cryptographic inventory. You can’t replace what you can’t find. List where your organization uses public-key cryptography: TLS endpoints, VPNs, internal PKI, code signing, email encryption, databases, hardware devices, third-party software, and embedded systems. This is usually the hardest step, because cryptography is buried inside products and libraries that nobody has documented.
2. Identify the data that needs long-term protection. Apply the logic above: how long must it stay confidential, how long would migration take, and what’s exposed to harvesting in the meantime? Prioritize systems that protect long-lived sensitive data transmitted over networks you don’t fully control.
3. Build crypto agility. Design systems so that algorithms can be swapped without rebuilding everything. Hard-coded algorithms, undocumented dependencies, and devices that can’t be updated are the main sources of future pain. Even if you aren’t migrating yet, avoid making the problem worse with new hard-coded choices.
4. Talk to your vendors. Ask suppliers of software, cloud services, network equipment, and hardware about their post-quantum roadmaps. Procurement is a lever: requiring support for the NIST standards in new purchases prevents you from buying tomorrow’s legacy problem.
5. Start with pilots, using hybrid approaches. Test post-quantum key exchange in non-critical systems, measure the performance and compatibility effects of larger handshakes, and find the things that break before it matters.
6. Plan for devices with long lifespans. Industrial control systems, medical devices, vehicles, satellites, and smart meters may remain in service for 10 to 20 years or more, and some can’t be updated easily. Anything being deployed now that will still be running in the 2030s deserves attention today.
7. Follow the official timelines. Government deadlines, such as those from NIST and the NSA, give a realistic reference for how much time regulated industries will have. Even if you aren’t directly subject to them, they signal where the market and your suppliers are headed.
8. Keep good security hygiene in the meantime. A quantum-safe cipher doesn’t help if credentials are phished, patches are skipped, or backups are exposed. Don’t let the new problem pull attention from the old ones that cause most breaches.
Common myths, briefly corrected
“Quantum computers will break all encryption.” They threaten specific public-key algorithms. Symmetric encryption like AES-256 stays strong, and post-quantum algorithms are designed to withstand quantum attacks.
“Someone has already broken RSA with a quantum computer.” Not at any real key size. Publicized claims have involved toy-sized numbers or methods that don’t scale.
“A quantum computer tries every answer at once.” It doesn’t. It manipulates probability amplitudes so that wrong answers cancel, and this only helps for particular problem types.
“It’s decades away, so there’s no point worrying.” The timing is uncertain, but data harvested now can be decrypted later, and migrations take years. The cost of preparing early is much lower than the cost of being late.
“It’s imminent, so everything is already compromised.” Also incorrect. No such machine exists today, and a great deal of careful work is being done to prepare.
“Quantum key distribution is the solution.” It’s a different technology with significant limitations and isn’t the mainstream recommendation.
Frequently asked questions
Can a quantum computer crack my Wi-Fi or my phone’s passcode?
Not in any way that’s different from today’s attackers. Wi-Fi security and device unlock rely on symmetric cryptography and rate-limited hardware protections, neither of which is the main target of Shor’s algorithm.
Is AES-256 safe against quantum computers?
Based on current knowledge, yes. Grover’s algorithm reduces its effective strength to roughly that of a 128-bit key, which remains out of reach.
Is my bank’s website vulnerable?
The underlying cryptography is vulnerable in principle to a future quantum computer, which is why financial institutions are among those planning migrations. Today, your connection is not at risk from quantum attacks, and many providers are already deploying hybrid protections.
Should I stop using RSA or elliptic curve keys right now?
For most people, no. Keep using them where nothing else is offered, and stay updated so that new protections arrive automatically. Organizations with long-lived sensitive data should be planning the transition.
Is post-quantum cryptography proven secure?
No cryptography is proven secure in an absolute sense, and that includes RSA. The new algorithms rest on mathematical problems that have survived years of public analysis, though they’ve had less time under scrutiny than RSA and ECC. That’s the reason for hybrid deployments and for keeping backup algorithms standardized.
Will quantum computers ever help security, not just threaten it?
Possibly in niche ways, such as quantum random number generation or certain sensing applications, but the main story is the threat to public-key cryptography and the migration to replace it.
The Key Takeaway
Quantum computing is real science and a real long-term threat to the public-key cryptography that secures most of the internet. It is not a threat to everything. Symmetric encryption and hashing come through with minor adjustments, and your day-to-day security habits still matter far more than quantum computers do for now.
The risk isn’t a sudden day when everything breaks. It’s the slow, uneven transition that has to happen before such a machine exists, combined with the possibility that data recorded today could be read later. The standards are finished, the first deployments are running in browsers, messaging apps, and remote access tools, and the work now is rolling them out everywhere else.
If you’re a regular user, the most useful step is also the least dramatic: keep your devices, browsers, and apps up to date, and keep using strong, unique passwords with multi-factor authentication or passkeys. If you manage systems, start the inventory, ask your vendors the hard questions, and build the ability to swap algorithms without a crisis. Neither takes much effort relative to what’s at stake, and both put you ahead of the problem instead of behind it.
