What a Secret and a Key Really Are

The oldest problem: passing a note through many hands

Picture a folded note you want to get to a friend across a crowded room. It cannot fly straight there; it has to be passed hand to hand by people you do not know and do not trust. If you write it plainly, any of those hands can unfold it and read it. This is, in miniature, the exact situation of every message on the internet: your data is passed through routers, cables, Wi-Fi access points, and servers owned by strangers before it reaches the other side.

The ancient answer is to scramble the note by an agreed rule, so that only someone who knows how to unscramble it can read it. The rule for scrambling is called a cipher, the scrambled note is called ciphertext, and the original readable note is the plaintext. Julius Caesar famously shifted each letter three places along the alphabet — A became D, B became E — so his generals could read orders that a captured messenger could not.

Caesar’s scheme hides two things at once: the idea (“shift the letters”) and the amount (“by three”). Teasing those two apart is the single most important step in understanding all of modern cryptography.

Hide the method, or hide the key?

There are two very different places you could put your secrecy:

• Hide the method. Keep the whole scrambling procedure secret. As long as no one knows you shift letters at all, you are safe.
• Hide only the setting. Let everyone know you shift letters — publish it in a book if you like — but keep secret how far you shift. That number, the “by three,” is the key.

Hiding the method feels safer to beginners, and for most of history that is what people did. It has a fatal flaw: methods leak, and when they leak they cannot be recalled. A soldier defects. A cipher machine is captured. A clever outsider reverse-engineers the pattern from enough intercepted messages. The moment that happens, every message ever sent — past and future — is exposed, and there is nothing you can do except invent an entirely new method and somehow redistribute it to everyone, secretly, all over again.

Hiding only the key flips this on its head. The method can be public, printed, studied by friend and enemy alike. If a key leaks, you shrug and choose a new one, and everything is safe again in seconds. Keys are cheap to change; methods are not.

Kerckhoffs’s principle: assume the enemy knows the lock

In 1883 a Dutch linguist, Auguste Kerckhoffs, wrote down the rule that still governs the field. Stated simply: a system should stay secure even if everything about it, except the key, is public knowledge. Assume your adversary has the manual, the source code, the circuit diagram — everything but the key.

This sounds pessimistic but it is deeply practical, and it delivers two gifts:

• Public methods can earn trust. If an algorithm is open for the whole world — academics, rival governments, curious teenagers — to attack for years and it still stands, you have real evidence it is strong. A secret method has no such evidence; it is merely untested. This is exactly why the post-quantum algorithms later in this series were chosen through an open, multi-year public competition rather than picked behind closed doors.
• Recovery becomes possible. Because only the key is secret, a compromise is survivable. Change the key, and you are safe again — without redesigning anything.

The opposite approach — leaning on the method staying hidden — has a dismissive nickname among security engineers: security through obscurity. It is not that hiding details is worthless; it is that your safety must never depend on them staying hidden.

Two shapes of key

So the key is the crown jewel. But keys come in two fundamentally different shapes, and the entire quantum story hinges on telling them apart.

Shape one — the shared key. Both people hold the same secret. One uses it to lock, the other uses the identical key to unlock. This is like two people owning identical copies of one physical key, or two friends agreeing on a password. It is fast and it works wonderfully — once both sides have the key. That caveat hides an awkward problem: if you and I have never met, and the only way we can talk is over the very wire that eavesdroppers are tapping, how do we agree on a shared secret without the eavesdropper learning it too? Shouting the password across the room defeats the point.

Shape two — the public/private pair. In the 1970s came one of the most beautiful ideas in all of computing: a key split into two matching halves that are mathematically linked but not identical. One half, the public key, you can publish to the entire world — put it on a billboard. The other half, the private key, you keep utterly to yourself. Anything scrambled with the public half can be unscrambled only by the private half. This is the magic that lets total strangers agree on a shared secret over an open, tapped line, because the eavesdropper hears only public information and cannot reverse it back to the private half. It is also what lets someone prove their identity by “signing” with the private half, which anyone can then check with the public half.

Why one shape is about to be in trouble

Here is the punchline of this first article, and the thread that runs through the whole series:

• The shared key (symmetric) shape is largely fine. A quantum computer can attack it, but only weakly — the practical fix is simply to use a longer key, which is cheap and already common. We will see exactly why in the “Shor and Grover” article.
• The public/private pair shape is the real casualty. The one-way streets it depends on — multiplying primes, and a cousin problem on elliptic curves — are precisely the ones a quantum computer can run backwards efficiently. When that happens, the public half quietly betrays the private half, and the strangers-agreeing-over-open-lines magic collapses.

That is why the coming chapters are not about scrapping cryptography. They are about replacing the one-way streets underneath the public-key shape with new ones that a quantum computer cannot run backwards — while keeping the shared-key shape almost exactly as it is. Everything from “harvest now, decrypt later” to the NIST standards to a full enterprise readiness assessment is, at bottom, about that one swap.

Plaintext / ciphertext

The readable message, and its scrambled form.

Cipher

The method (algorithm) used to scramble and unscramble.

Key

The secret, changeable setting the cipher uses. The only thing that must stay secret.

Kerckhoffs’s principle

A system must stay secure even if everything but the key is public. The opposite — relying on a hidden method — is “security through obscurity.”

Symmetric (shared) key

One secret held by both sides; used to lock and unlock. Only mildly affected by quantum computers.

Public / private key pair (asymmetric)

Two linked halves: one publishable, one secret. Lets strangers agree on secrets and prove identity. The main quantum target.

NIST (National Institute of Standards and Technology)

The US standards body that ran the global competition and published the post-quantum algorithms.

NSA (National Security Agency)

The US signals-intelligence and cybersecurity agency; sets algorithm requirements for national-security systems.

CISA (Cybersecurity and Infrastructure Security Agency)

The US cyber-defence agency that co-publishes quantum-readiness migration guidance.

What to carry forward

• Security lives in the key, not in hiding the method — that is Kerckhoffs’s principle, and it is why strong crypto can be public and still trusted.
• There are two shapes of key: shared (symmetric) and public/private (asymmetric).
• The quantum threat hits the public/private shape hard and the shared shape only mildly.
• The entire post-quantum project is, at heart, swapping the fragile one-way streets under public-key crypto for quantum-resistant ones.

Next: What Encryption Really Does (and the Two Kinds of Locks) — we open the box on those two shapes with a mailbox you can picture, and pin down exactly which one quantum breaks.

Understand it in your own words

Paste this into any AI assistant to check your grasp before moving on:

I'm learning the foundations of cryptography before studying the quantum
threat. Please quiz me on these ideas and correct me kindly:

1. In my own words, why is it safer to hide a "key" than to hide the
   "method" of encryption? What is Kerckhoffs's principle?
2. What's the difference between a shared (symmetric) key and a
   public/private (asymmetric) key pair? Give me an everyday analogy
   for each.
3. Why can a public key be published to the whole world without making
   the system insecure?
4. Which of the two key shapes is badly threatened by quantum computers,
   and which is only mildly affected — and what's the intuition for why?

Ask me one question at a time and wait for my answer before the next.