What Encryption Really Does — Quantum-Safe: Foundations

Most confusion about encryption comes from treating it as one thing. In real systems it is two different tools used together. One tool is a shared secret key that scrambles the data itself. The other is a public and private key pair that lets strangers agree on that shared secret and prove who they are. Quantum risk becomes much clearer once you separate those two jobs.

Encryption is about keys, not secrecy of the method

A good encryption system does not depend on hiding how the algorithm works. It assumes attackers can know the recipe. What they must not have is the key.

The algorithm is the public method for scrambling and unscrambling information. The key is the particular secret value that makes one locked message different from another. If the key is strong and protected, the same public algorithm can be used by banks, phones, governments, and cloud services without each one inventing its own private trick.

This is why the shape of the key matters so much. Some encryption uses one shared key. Some uses a matched pair of keys. Those two shapes solve different problems, and quantum computers affect them in very different ways.

📌

The core split. Encryption comes in two families: symmetric systems with one shared key, and public-key systems with a public key and a private key.

Family one: the shared lockbox

Symmetric encryption means both sides use the same secret key. Picture a lockbox with one kind of key. You lock the box with your copy, send the box, and the receiver opens it with an identical copy.

This family is fast, compact, and very strong when used correctly. It protects the bulk of digital life: messages, stored files, database fields, disk volumes, backups, video streams, and the contents of secure web sessions.

The best-known standard is the Advanced Encryption Standard, or AES. Common AES key sizes are 128 bits and 256 bits. A bit is a binary digit, so a 128-bit key represents one choice among 2 to the power of 128 possibilities, an unimaginably large number.

The weakness of symmetric encryption is not usually the lock. It is key delivery. If two people have never met and their only connection is a network that an attacker can watch, how do they get the same secret key without revealing it?

✅

Workhorse. Symmetric encryption is what normally protects the actual data after a secure session has been established.

Symmetric encryption is fast but hard to key; public-key solves delivery.

Family two: the public mailbox

Public-key encryption, also called asymmetric encryption, solves the key delivery problem by using two different keys that belong together. One key is public. The other is private.

Imagine a mailbox on the street. Anyone can drop a letter through the public slot. Only the owner can open the private door at the bottom. Publishing the slot does not give strangers the door key.

That is the breakthrough. A person or service can publish a public key widely. Anyone can use it to send a secret to that owner, or to take part in a key agreement. Only the matching private key can complete the operation.

Classic public-key systems include RSA, named after Ron Rivest, Adi Shamir, and Leonard Adleman, and elliptic-curve cryptography, or ECC. RSA relies on the difficulty of factoring very large numbers into their prime-number parts. ECC relies on the difficulty of a related problem called the elliptic-curve discrete logarithm problem.

In both cases, the important point is the same: the forward operation is practical, while reversing it without the private key is believed to be infeasible for ordinary computers when parameters are large enough.

The public key is meant to be copied, published, and sent across untrusted networks.
The private key is the sensitive asset and should never leave controlled custody.
The two keys are mathematically related, but the private key should not be recoverable from the public key by a classical computer.

Public keys also prove identity

Public-key cryptography does another job that is just as important as secrecy: it supports digital signatures.

A digital signature is not simply ordinary encryption run backward, although that picture is a helpful first intuition. In modern systems, the private key creates a special proof over a message or software package. Anyone with the public key can verify that proof.

This is how your computer can check that an operating system update really came from its maker. It is how a website presents a certificate saying, in effect, this public key belongs to this domain name. It is also how signed documents, code packages, containers, firmware images, and identity tokens resist forgery.

The risk is therefore bigger than someone reading old messages. If a public-key signature scheme becomes forgeable, attackers may be able to impersonate services, publish malicious updates, or undermine chains of trust.

⚠️

Trust depends on signatures. Quantum-safe planning must cover digital signatures as well as encryption and key exchange.

Digital signatures let anyone verify that an artifact came from its owner.

Real systems use both at once

Secure communication on the internet is usually hybrid. The system uses public-key cryptography briefly to authenticate the other side and establish a fresh shared secret. Then it uses symmetric encryption for the high-volume data.

Transport Layer Security, or TLS, is the protocol behind the familiar secure connection between a browser and a website. In modern TLS, the server proves its identity with a certificate and a digital signature. The browser and server then perform a key agreement, commonly based on elliptic-curve Diffie-Hellman, to derive shared symmetric keys.

After that handshake, AES or another symmetric cipher protects the actual session traffic. This division is not accidental. Public-key operations are powerful but comparatively expensive and limited in what they can directly protect. Symmetric encryption is efficient enough to protect every request, response, image, form field, and application programming interface call.

A simple way to remember the split is this: public-key cryptography starts the trusted conversation; symmetric cryptography carries the conversation.

TLS uses public-key to authenticate and agree a symmetric session key.

What quantum computers change

The phrase quantum computers break encryption is too broad. They do not affect both families equally.

For symmetric encryption such as AES, the main known quantum speedup is Grover’s algorithm. It can reduce the cost of exhaustive key search roughly from 2 to the power of n trials to 2 to the power of n divided by 2 trials. In plain terms, it acts like cutting the effective key length in half against brute-force search. That is serious for small keys, but manageable: AES-256 still leaves about 128 bits of brute-force security under this model.

For today’s common public-key systems, the story is different. Shor’s algorithm can solve the mathematical problems behind RSA, Diffie-Hellman, and elliptic-curve cryptography efficiently on a sufficiently large, fault-tolerant quantum computer. That kind of machine does not exist at useful scale today, but it is the reason migration work has started now.

So the practical sentence is: quantum computing mildly dents the shared lockbox, but it can break the public mailbox. The bulk data cipher is not the main target. The setup and trust machinery is.

⚠️

Not all encryption. The urgent quantum problem is replacing vulnerable public-key key exchange and signatures, not throwing away symmetric encryption.

Grover only weakens symmetric keys; Shor breaks today's public-key math.

What this means for real decisions

For leaders and practitioners, this distinction prevents wasted effort. A quantum-safe program should not begin by asking, Where do we use encryption? That question is too broad. It should ask, Where do we use vulnerable public-key cryptography, and what would happen if confidentiality or authenticity failed there?

The highest-priority systems are often the ones that create long-lived exposure. Data captured today may be decrypted later if it was protected by a vulnerable key exchange and the data remains valuable. This is the harvest-now, decrypt-later problem. Long-lived signatures matter too, especially for software, firmware, legal records, identity systems, and certificates that must remain trustworthy for years.

A practical inventory should separate symmetric ciphers, key exchange, certificates, signature algorithms, key sizes, libraries, hardware security modules, cloud services, embedded devices, and third-party dependencies. Those categories lead to different migration paths.

The replacement work is already taking shape through post-quantum cryptography, or PQC. The National Institute of Standards and Technology, or NIST, has standardized new algorithms including Module-Lattice-Based Key-Encapsulation Mechanism, or ML-KEM, for key establishment, and Module-Lattice-Based Digital Signature Algorithm, or ML-DSA, for signatures. These are designed to replace the vulnerable mailbox functions while continuing to use symmetric encryption for bulk data.

Keep strong symmetric encryption, and prefer 256-bit keys where long-term quantum margin matters.
Find where RSA, Diffie-Hellman, and elliptic-curve cryptography are used for key exchange, certificates, and signatures.
Prioritize systems protecting data with a long confidentiality lifetime or trust chains with a long validity lifetime.
Plan for crypto-agility: the ability to change algorithms, key sizes, libraries, and certificates without redesigning the whole system.

Key takeaways

Encryption has two main families: symmetric encryption with one shared key, and public-key cryptography with a public and private key pair.
Symmetric encryption such as AES protects most of the actual data because it is fast and strong.
Public-key cryptography solves the stranger problem: it lets parties establish secrets and verify identity over open networks.
Real systems such as TLS use both families: public-key cryptography for the handshake, then symmetric encryption for the session.
Quantum computers mainly threaten today’s public-key systems such as RSA, Diffie-Hellman, and elliptic-curve cryptography.
Quantum-safe migration is mostly about replacing vulnerable key exchange and signature mechanisms, while keeping strong symmetric encryption.

Glossary

Symmetric encryption: An encryption method where the same secret key is used to encrypt and decrypt data.
Public-key cryptography: A cryptographic method that uses a public key that can be shared and a private key that must be kept secret.
AES: The Advanced Encryption Standard, a widely used symmetric encryption algorithm for protecting data.
RSA: A public-key cryptographic system based on the difficulty of factoring large numbers into their prime factors.
ECC: Elliptic-curve cryptography, a family of public-key systems based on hard mathematical problems on elliptic curves.
TLS: Transport Layer Security, the protocol commonly used to secure web connections and many other network sessions.
Digital signature: A cryptographic proof created with a private key and checked with a public key to verify origin and integrity.
Shor’s algorithm: A quantum algorithm that can efficiently solve the mathematical problems behind RSA, Diffie-Hellman, and elliptic-curve cryptography on a large enough quantum computer.
Post-quantum cryptography: Cryptographic algorithms designed to resist attacks from both classical computers and future quantum computers.