한
← All rivers
River of knowledge

The River of Cryptography

When did secrecy move from linguistic tricks to mathematical guarantees?

Caesar → al-Kindi's frequency analysis → changing alphabets in Alberti, Bellaso, and Vigenère → Polish and Bletchley Enigma networks → Shannon's theory of secrecy → Diffie–Hellman and RSA public keys → post-quantum cryptography — two millennia of keeping and breaking secrets.

50 BCE–20246 city-to-city segments

Read the current

What changed between the cities?

  1. 1

    50 BCE–850

    attack model change

    RomeBaghdad

    Language Statistics Exposed the Weakness of Fixed Substitution

    The line between Caesar-style substitution at Rome and al-Kindi's ninth-century frequency analysis at Baghdad does not assert direct transmission. It marks a change in attack: a fixed substitution leaves the statistical fingerprint of language inside ciphertext.

    Monoalphabetic substitution · letter frequencies · known language patterns
    Place this segment on the map
  2. 2

    850–1511

    institutional adoption

    BaghdadVenice

    From Language Fingerprints to a State Cryptanalytic Office

    The Venetian Republic joined the deciphering skill of secretaries such as Giovanni Soro to the work of the Council of Ten as ambassadors, merchants, and commanders generated coded correspondence. Repeated letters, sending contexts, dedicated staff, and secret records turned individual skill into an institution that could compare and accumulate attacks. The deciphering book Soro mentioned in a 1511 petition is lost, so its contents cannot be reconstructed or made the sole origin of European cryptanalysis.

    Language Leaves a Fingerprint inside a Secret — Al-Kindi and Frequency Analysis → Cryptanalysis Becomes an Office and an Archive — Venice’s Diplomatic Ciphers
    Place this segment on the map
  3. 3

    1511–1883

    doctrine change

    VeniceParis

    From Secret Algorithms to a System That May Be Public

    In an age of telegraphy and mass armies, Kerckhoffs argued that a military cipher should remain secure even if the system became known to the enemy, concentrating secrecy in a key that could be changed. Public scrutiny and manageable keys replaced concealment of the whole mechanism as a design ideal. The principle does not prove every compliant implementation secure, and nineteenth-century military requirements are not identical to every modern threat model.

    Cryptanalysis Becomes an Office and an Archive — Venice’s Diplomatic Ciphers → The System May Be Known while the Key Must Endure — Kerckhoffs’s Principle
    Place this segment on the map
  4. 4

    1932–1940

    team network

    WarsawBletchley Park

    Permutation Mathematics and Wartime Organization Met Enigma

    Bletchley Park connected Polish achievements, radio traffic from Y stations, probable plaintext cribs, Bombes designed through work by Turing, Gordon Welchman, and others, and the labour of thousands of operators and translators to reject rotor settings quickly. The timetable from interception through decryption to distribution mattered as much as one machine. Not every message was read, Turing did not break Enigma alone, and an exact number of years by which the war was shortened is a counterfactual rather than a settled fact.

    Writing Rotor Wiring as Permutations — Poland Breaks into Enigma → Finding Today’s Key before Today Ends — Intercepts, Cribs, and the Bombe
    Place this segment on the map
  5. 5

    1949–1976

    theory to protocol

    Bell LabsStanford

    From Measuring Secrecy to Agreeing over a Public Channel

    Whitfield Diffie and Martin Hellman published a key agreement in which exchanged public computations lead both parties to the same secret and framed public-key encryption and digital signatures as an open research program. A computation that is easy in one direction and difficult to reverse changed the role of the secure courier. Unauthenticated Diffie–Hellman does not prevent a man-in-the-middle attack, and Ralph Merkle’s preceding ideas and the then-classified GCHQ work remain part of the history.

    Asking How Much Secrecy Exists — Shannon’s Communication Theory → Making a Shared Secret over a Public Channel — Diffie and Hellman
    Place this segment on the map
  6. 6

    1976–1978

    rapid publication network

    StanfordCambridge, MA

    A Public-Key Idea Became a System for Encryption and Signatures

    At MIT, Ronald Rivest, Adi Shamir, and Leonard Adleman used a composite made from two large primes and modular exponentiation to give a concrete method in which a public exponent encrypts or verifies while a secret exponent decrypts or signs. A key for everyone and a key held by its owner became distinct. Textbook “plain RSA” is not safe for direct modern use: padding, authentication, key generation, and the surrounding protocol all matter.

    Making a Shared Secret over a Public Channel — Diffie and Hellman → Easy to Multiply, Hard to Reverse — RSA Public Keys and Signatures
    Place this segment on the map

How to read the lines

Each line is an editorial route through problems, texts, and practices. It does not imply one book moving in a straight line, a sole invention, or identical adoption everywhere.