Applied Cryptography

Applied cryptography is the branch of cybersecurity concerned with building and using mathematical techniques to keep information secret, to prove who sent it, and to detect when it has been altered.

11 frameworks, from 1500 to today · Cybersecurity · Computer Science

still a working view ended · each leads to its entry below

Overview

Applied cryptography is the branch of cybersecurity concerned with building and using mathematical techniques to keep information secret, to prove who sent it, and to detect when it has been altered1. Its practitioners design ciphers, hash functions, and protocols, then try to break them1. What is at stake is concrete: whether a bank transfer cannot be forged, whether a message cannot be read by an eavesdropper, whether a software update genuinely came from its vendor. The field's history is a long argument between makers and breakers, in which every confident claim of security has eventually been tested by someone with a better idea.

Classical Cipher Craft: Secrets by Hand

For most of recorded history, cryptography was a craft of pen, paper, and substitution2. A cipher replaces each letter or symbol of a message according to a rule, so that only someone who knows the rule can reverse it3. Julius Caesar reportedly shifted each letter three places down the alphabet—the Caesar cipher—a method so weak that a modern child can break it by trying all 25 shifts. The medieval and Renaissance periods produced more elaborate schemes: the Vigenère cipher, described in the sixteenth century, used a repeating keyword to vary the shift letter by letter, defeating simple frequency analysis for a time4. The nomenclator, a codebook mixing substituted letters with symbols for common words and names, served European chanceries for centuries.

The recurring problem was that hand ciphers leaked structure. Letter frequencies, repeated patterns, and predictable openings gave the breaker a foothold. The craft advanced through a cycle of stronger schemes and cleverer attacks, but it remained an art practiced by diplomats and generals, with security resting on the secrecy of the method and the diligence of the clerk2.

Machine Cryptanalysis: The Cipher Machine and Its Defeat

The early twentieth century mechanized both sides. Rotor machines—most famously the German Enigma, adopted by the German military in the late 1920s—used spinning wheels to encrypt each letter differently on every keystroke, producing a vast number of possible settings. The machine's designers believed the settings space was too large to search. They were wrong, and the reason matters: the machine's own structure created regularities. A letter could never encrypt to itself, and the rotors advanced in a predictable pattern.

Polish mathematicians, notably Marian Rejewski, broke early Enigma traffic in the 1930s by exploiting these regularities and reconstructing the machine's wiring from intercepted messages56. Their work passed to British codebreakers at Bletchley Park, where Alan Turing and colleagues developed the Bombe, an electromechanical device that tested rotor settings against known plaintext6. The lesson that carried forward was that security depends not on the size of a key space alone but on whether the cipher's structure leaves exploitable traces. Cryptanalysis became an industrial, team-based discipline, and the idea took hold that a cipher should be judged by how it withstands a determined, well-resourced attacker.

Information-Theoretic Secrecy: The First Proof of Security

In 1949 Claude Shannon asked a question no one had answered rigorously: what does it mean for a cipher to be unbreakable7? His answer, perfect secrecy, required that the ciphertext reveal nothing about the plaintext—formally, that the two be statistically independent8. He showed that this is achievable only with a one-time pad: a key as long as the message, truly random, used once and never again9. The pad is provably secure, and it is also impractical for most uses, because distributing and safeguarding that much key material is as hard as the problem it solves9.

Shannon's contribution was conceptual as much as practical. He separated the key from the algorithm, arguing that security should rest on the secrecy of the key alone, so that the method could be published and scrutinized10. This principle—Kerckhoffs's principle, named for the nineteenth-century Dutch cryptographer Auguste Kerckhoffs, who stated it earlier—became the foundation of modern practice10. It also set the field's central tension: provable security tends to demand impractical resources, while practical systems must settle for security that no one has yet broken.

Public-Key Cryptography: Breaking the Key-Distribution Deadlock

Every cipher so far shared a fatal logistical flaw: sender and receiver had to share a secret key in advance. For two strangers on opposite sides of the world, this was the hard part. In 1976 Whitfield Diffie and Martin Hellman published a scheme in which two parties could agree on a shared secret over an open channel, using arithmetic in which computing a discrete logarithm—reversing exponentiation in a finite group—is believed to be hard. Neither party ever transmits the secret. The following year, Rivest, Shamir, and Adleman introduced RSA, which used the difficulty of factoring large numbers to provide both encryption and digital signatures. (British intelligence had developed related ideas earlier at GCHQ, but they were classified and did not influence the public field1112.)

Public-key cryptography made possible a world of mutually distrusting parties: secure web traffic, signed software, encrypted email. It also introduced a new vulnerability class, because its security rests on computational assumptions—beliefs that certain mathematical problems are hard—rather than on information-theoretic proof1. If factoring becomes easy, RSA falls. This distinction between computational and information-theoretic security became a permanent feature of the field's reasoning13.

Provable Security: Making "Secure" a Claim You Can Check

Public-key schemes invited a sharper question: what exactly are we assuming, and what follows from it? Beginning in the 1980s, researchers developed provable security, a style of argument in which a scheme is shown to be secure if some underlying problem is hard14. The method is reduction: prove that any attacker who breaks the scheme could be converted into a solver for the hard problem, so that breaking the scheme implies solving something believed impossible15. Goldwasser and Micali's work on probabilistic encryption in the early 1980s established semantic security—ciphertexts should reveal nothing about plaintexts even to an attacker who chooses which messages to encrypt—and gave the field a vocabulary of formal security definitions and adversarial games.

Provable security did not make systems unbreakable; it made the assumptions explicit and the reasoning auditable. Its limits became clear when proofs were found to model the wrong threat or to rely on idealized models, such as treating a hash function as a truly random oracle. The field learned to distinguish a proof of security under stated assumptions from a guarantee in the real world.

Standardization and the Block Cipher Era

Practical cryptography needs agreement on algorithms, and agreement needs a process. In 1977 the U.S. National Bureau of Standards adopted the Data Encryption Standard (DES), a symmetric block cipher—one that encrypts fixed-size blocks of data under a shared key—designed with IBM and vetted by the NSA16. DES's 56-bit key was controversial from the start, and by the late 1990s exhaustive search had become feasible; a distributed effort publicly broke a DES challenge in 1998. The replacement process, an open international competition run by NIST, selected the Advanced Encryption Standard (AES) in 2000, designed by Daemen and Rijmen as Rijndael. AES's open, public competition became a model for how to build trust in a standard.

The block cipher era also produced modes of operation—ways of using a block cipher on messages longer than one block—and the realization that a cipher alone is not a system. How you chain blocks, how you handle the last partial block, and how you combine encryption with integrity all matter, and getting them wrong has broken real systems.

Protocol Design and Key Management

A cipher protects a message; a protocol protects a conversation. From the 1980s onward, the field turned to the design of multi-step exchanges—authenticating parties, negotiating keys, confirming freshness—and to the problem of key management: generating, distributing, storing, rotating, and revoking keys over a system's lifetime. The failures here were often not mathematical but logical. The Needham–Schroeder protocol, an early and influential authentication scheme, was found vulnerable to replay attacks in which an attacker reuses old messages; later work by Lowe in the 1990s found further flaws using formal methods. These episodes taught that protocols must be analyzed as adversarial games, and that intuition about "obvious" security is unreliable.

Public-Key Infrastructure: Trust at Scale

Public-key cryptography raised a new question: how does a party know that a public key belongs to the person it claims? The answer was the certificate—a public key signed by a trusted authority—and the public-key infrastructure (PKI), the system of authorities, policies, and revocation mechanisms that issues and validates them1117. The web's certificate authorities became the backbone of secure browsing. PKI's history is a study in the gap between cryptographic ideal and operational reality: compromised authorities, misissued certificates, and the difficulty of revocation repeatedly showed that the trust model, not the mathematics, was the weak point. Later designs, such as certificate transparency (logging every issued certificate publicly), tried to make the authorities accountable.

Side-Channel-Resistant Implementation

A proof says nothing about the machine that runs the code. Side channels are leaks through physical or timing behavior: the time an operation takes, the power it draws, the electromagnetic radiation it emits18. In 1996 Paul Kocher showed that timing variations in modular exponentiation could reveal RSA private keys, and subsequent work extended the attack to power analysis and fault injection. The response was a discipline of constant-time and masked implementation—writing code whose observable behavior does not depend on secret data—and a recognition that the same algorithm can be secure on paper and broken in silicon. This made implementation a first-class part of applied cryptography rather than an afterthought.

Authenticated Encryption: Getting Confidentiality and Integrity Together

For years, practitioners combined encryption with a separate message authentication code, and the combinations were frequently wrong—encrypting without authenticating allowed padding-oracle attacks that recovered plaintext from error messages. The field's answer was authenticated encryption, a single construction that provides both confidentiality and integrity, so that tampered ciphertext is rejected rather than decrypted19. The Galois/Counter Mode (GCM), standardized in the mid-2000s, became widely used, and later a competition selected ChaCha20-Poly1305 for settings where AES hardware is unavailable. The shift reflected a broader principle: cryptographic interfaces should make the safe choice the easy one, because users will take the easy path regardless.

Post-Quantum Migration: The Present Frontier

The newest turning point is the quantum computer. In 1994 Peter Shor showed that a sufficiently large quantum computer could factor integers and compute discrete logarithms efficiently, which would break RSA and Diffie–Hellman2021. Whether such a machine will be built is uncertain, but the threat is taken seriously because encrypted data can be recorded now and decrypted later. Since 2016 NIST has run a process to standardize post-quantum algorithms—schemes based on problems believed hard for quantum computers, such as lattice problems—and in 2022 announced the first selections, including CRYSTALS-Kyber for key establishment and CRYSTALS-Dilithium for signatures. Migration is slow and fraught: new algorithms are less battle-tested, key and signature sizes differ, and systems built on decades-old assumptions must be re-engineered.

Where the Field Stands

Applied cryptography today runs on the same division of labor its history produced: symmetric ciphers like AES for bulk data, public-key methods for key exchange and signatures, hash functions for integrity, and protocols that compose them122. Provable security supplies the vocabulary of definitions and reductions; standardization bodies supply the algorithms; implementation research supplies the constant-time code; and cryptanalysis supplies the pressure that keeps all of it honest14. The open questions are the ones the history keeps returning to—how to make security proofs match real threats, how to build trust infrastructures that survive operational failure, and how to migrate the world's encrypted traffic to algorithms whose hardness assumptions have not yet been tested by decades of attack.

References

  1. Cryptography (introduction, History), Wikipedia
  2. History of cryptography, Wikipedia
  3. Substitution cipher, Wikipedia
  4. Vigenère cipher (introduction, History), Wikipedia
  5. Bibliography of cryptography (History of cryptography), Wikipedia
  6. Bombe, Wikipedia
  7. Communication Theory of Secrecy Systems, Wikipedia
  8. Semantic security, Wikipedia
  9. One-time pad, Wikipedia
  10. Kerckhoffs's principle, Wikipedia
  11. Public key infrastructure (History, introduction), Wikipedia
  12. RSA cryptosystem (introduction, History), Wikipedia
  13. Information-theoretic security, Wikipedia
  14. Provable security, Wikipedia
  15. Reduction (complexity), Wikipedia
  16. Data Encryption Standard, Wikipedia
  17. Certificate authority, Wikipedia
  18. Side-channel attack, Wikipedia
  19. Authenticated encryption, Wikipedia
  20. Post-quantum cryptography, Wikipedia
  21. Quantum threat (introduction, Background), Wikipedia
  22. Public-key cryptography, Wikipedia

The frameworks of Applied Cryptography

Each framework is a way of working the field has used: when it held, and the question it answers.

  1. 1500-1900

    Classical cipher

    How can a message be hidden by hand?

    Fly to its tower in Nousfarer

  2. 1930-1960

    Machine Cryptanalysis

    How can cipher machines be broken?

    Fly to its tower in Nousfarer

  3. 1949-Present

    Information-theoretic security

    What does it mean for a cipher to be unbreakable?

    Fly to its tower in Nousfarer

  4. 1976-Present

    Public-Key Cryptography

    How can strangers share secrets without meeting?

    Fly to its tower in Nousfarer

  5. 1977-Present

    Standardization and the Block Cipher Era

    Which algorithms should everyone agree to use?

    Fly to its tower in Nousfarer

  6. 1978-Present

    Cryptographic protocol

    How can parties conduct a secure conversation?

    Fly to its tower in Nousfarer

  7. 1982-Present

    Provable Security

    What assumptions make a security claim checkable?

    Fly to its tower in Nousfarer

  8. 1990-Present

    Public-Key Infrastructure

    How does one know a public key is genuine?

    Fly to its tower in Nousfarer

  9. 1996-Present

    Side-channel attack

    What can an attacker learn from a system's physical behavior?

    Fly to its tower in Nousfarer

  10. 2004-Present

    Authenticated Encryption

    How can a message be both secret and tamper-proof?

    Fly to its tower in Nousfarer

  11. 2016-Present

    Post-quantum cryptography

    Which ciphers will survive quantum computers?

    Fly to its tower in Nousfarer

How the ideas connect

Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.

Classical cipherMachine CryptanalysisInformation-theoretic securityPublic-Key CryptographyStandardization and the Block Cipher …Cryptographic protocolProvable SecurityPublic-Key InfrastructureSide-channel attackAuthenticated EncryptionPost-quantum cryptography

Beyond the field

Where Applied Cryptography's ideas came from in other fields, and what they led to there: the strongest 12 of 44 links.

A city in Nousfarer: a red-carpeted stair climbing terraces to a crowned tower on an acropolis, more towers round it, forest and snowy mountains beyond.
A city in Nousfarer, the game played in the browser.

Applied Cryptography is a planet in Nousfarer

Its city has a tower for each of these 11 frameworks. Land, walk in, and climb one concept at a time.

Land on Applied Cryptography

Related fields

Fields its ideas are linked to

More in Cybersecurity

See where Applied Cryptography sits on the Map of Human Knowledge