Cryptography

Intermediate

Cryptography is the science and practice of securing communication and data through the use of codes, ciphers, and mathematical algorithms so that only intended recipients can access the information. Rooted in ancient traditions of secret writing, modern cryptography has evolved into a rigorous mathematical discipline that underpins the security of digital communications, financial transactions, and virtually every aspect of online life. At its core, cryptography transforms readable plaintext into unreadable ciphertext using encryption algorithms and keys, ensuring confidentiality, integrity, authentication, and non-repudiation.

The field underwent a revolutionary transformation in the 1970s with the introduction of public-key cryptography by Whitfield Diffie, Martin Hellman, and Ralph Merkle. Unlike symmetric-key systems where both parties must share a secret key, public-key cryptography uses mathematically related key pairs, allowing secure communication between parties who have never met. This breakthrough, along with the RSA algorithm developed by Rivest, Shamir, and Adleman, made secure electronic commerce and digital signatures possible. The development of the Advanced Encryption Standard (AES) further solidified the role of standardized cryptographic algorithms in protecting sensitive data worldwide.

Today, cryptography faces both extraordinary opportunities and challenges. Quantum computing threatens to break many widely used cryptographic systems, spurring urgent research into post-quantum cryptography. Meanwhile, cryptographic innovations like homomorphic encryption, zero-knowledge proofs, and blockchain technology are enabling entirely new paradigms for privacy, trust, and decentralized computation. From securing personal messages and banking transactions to protecting national security communications, cryptography remains one of the most critical and rapidly evolving fields at the intersection of mathematics, computer science, and information security.

Practice a little. See where you stand.

Ready to practice?5 minutes. No pressure.

Take the Quiz Learn First

Quiz

Reveal what you know — and what needs work

Adaptive Learn

Responds to how you reason, with real-time hints

Start here

Flashcards

Build recall through spaced, active review

Cheat Sheet

The essentials at a glance — exam-ready

Glossary

Master the vocabulary that unlocks understanding

Learning Roadmap

A structured path from foundations to mastery

Book

Deep-dive guide with worked examples

Key Concepts

A cryptographic system that uses a pair of mathematically related keys: a public key that can be freely shared for encryption, and a private key kept secret for decryption. It solves the key distribution problem inherent in symmetric cryptography.

Example

When you visit an HTTPS website, your browser uses the server's public key to encrypt a session key. Only the server's private key can decrypt it, establishing a secure connection without prior key exchange.

One-way mathematical functions that take an input of any size and produce a fixed-size output (digest) that is computationally infeasible to reverse. Even a tiny change in input produces a completely different hash, a property called the avalanche effect.

Example

When you create a password on a website, the site stores a SHA-256 hash of your password rather than the password itself. When you log in, it hashes your input and compares the hashes.

A cryptographic mechanism that allows the signer to prove the authenticity and integrity of a message. The sender signs with their private key, and anyone can verify the signature using the sender's public key, providing authentication and non-repudiation.

Example

Software developers digitally sign their applications so your operating system can verify the software hasn't been tampered with and truly comes from the claimed developer.

Methods that allow two parties to establish a shared secret key over an insecure channel without any prior shared secret. The Diffie-Hellman protocol was the first practical solution to this fundamental problem.

Example

When your browser connects to a website, the Diffie-Hellman key exchange allows both parties to agree on a shared encryption key, even though an eavesdropper can see all the exchanged messages.

Block ciphers encrypt fixed-size blocks of plaintext (e.g., 128 bits for AES), while stream ciphers encrypt data one bit or byte at a time using a pseudorandom keystream. Each has different performance characteristics and use cases.

Example

AES (a block cipher) is commonly used for encrypting files and disk storage, while ChaCha20 (a stream cipher) is favored for encrypting real-time communications like video calls due to its speed on mobile devices.

The study of methods for obtaining the meaning of encrypted information without access to the secret key. It encompasses techniques ranging from brute-force attacks to sophisticated mathematical analysis exploiting weaknesses in cryptographic algorithms.

Example

The Enigma machine used by Germany in World War II was broken by Allied cryptanalysts at Bletchley Park, including Alan Turing, by exploiting structural weaknesses and operator errors.

A framework of policies, hardware, software, and procedures used to create, manage, distribute, store, and revoke digital certificates. PKI establishes a chain of trust that binds public keys to the identities of their owners.

Example

When your browser shows a padlock icon on a website, it has verified the site's SSL/TLS certificate through a chain of trust back to a trusted Certificate Authority like Let's Encrypt or DigiCert.

A cryptographic method by which one party (the prover) can prove to another party (the verifier) that a given statement is true without revealing any information beyond the validity of the statement itself.

Example

A user could prove they are over 18 to access a service without revealing their actual date of birth or any other personal information, using a zero-knowledge proof based on their digital identity credentials.

Cryptographic algorithms designed to be secure against attacks by both classical and quantum computers. These algorithms rely on mathematical problems believed to be hard even for quantum computers, such as lattice-based and hash-based problems.

Example

NIST selected CRYSTALS-Kyber as a post-quantum key encapsulation standard and CRYSTALS-Dilithium as a digital signature standard to replace RSA and ECC before large-scale quantum computers become a reality.

One concept at a time.

Explore your way

Choose a different way to engage with this topic — no grading, just richer thinking.

Explore your way — choose one:

Explore with AI →

Curriculum alignment— Standards-aligned

Grade level

Grades 9-12College+

Learning objectives

•Compare symmetric-key and public-key cryptographic systems by analyzing their mathematical foundations, performance characteristics, and appropriate use cases
•Apply hash functions, digital signatures, and message authentication codes to implement data integrity, authentication, and non-repudiation in secure systems
•Evaluate the security properties of cryptographic protocols including TLS, Diffie-Hellman key exchange, and PKI certificate chains against known attack models
•Analyze the threat quantum computing poses to current cryptographic standards and assess post-quantum algorithms proposed as replacements

Recommended Resources

This page contains affiliate links. We may earn a commission at no extra cost to you.

Books

Serious Cryptography: A Practical Introduction to Modern Encryption

by Jean-Philippe Aumasson

Cryptography and Network Security: Principles and Practice

by William Stallings

Understanding Cryptography

by Christof Paar and Jan Pelzl

The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography

by Simon Singh

Introduction to Modern Cryptography

by Jonathan Katz and Yehuda Lindell

Courses

Cryptography I

CourseraEnroll

Applied Cryptography

UdacityEnroll

Introduction to Cryptography

MIT OpenCourseWareEnroll

My Progress Focus Mode

Interdisciplinary

Number Theory

The branch of pure mathematics concerned with the properties of integers, including primes, divisibility, and congruences, with deep applications in cryptography and computer science.

Intermediate

Tech & Computing

Computer Science

The study of computation, algorithms, data structures, and the design of software systems, encompassing everything from theoretical foundations to artificial intelligence and software engineering.

Intermediate

Tech & Computing

Cybersecurity

The practice of protecting systems, networks, and data from digital attacks, covering threat analysis, defense strategies, encryption, and incident response.

Intermediate

Interdisciplinary

Information Theory

The mathematical study of quantifying, storing, and transmitting information, founded by Claude Shannon, providing the theoretical basis for data compression, error-correcting codes, and modern digital communications.

Intermediate

STEM & Engineering

Discrete Mathematics

The study of mathematical structures that are fundamentally discrete rather than continuous, forming the theoretical foundation of computer science and algorithm design.

Intermediate

Cryptography

Quiz

Adaptive Learn

Flashcards

Cheat Sheet

Glossary

Learning Roadmap

Book

Key Concepts

Symmetric-Key Encryption

Public-Key (Asymmetric) Cryptography

Hash Functions

Digital Signatures

Key Exchange Protocols

Block Ciphers vs. Stream Ciphers

Cryptanalysis

Public Key Infrastructure (PKI)

Zero-Knowledge Proofs

Post-Quantum Cryptography

Explore your way

Grade level

Learning objectives

Recommended Resources

Books

Serious Cryptography: A Practical Introduction to Modern Encryption

Cryptography and Network Security: Principles and Practice

Understanding Cryptography

The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography

Introduction to Modern Cryptography

Courses

Cryptography I

Applied Cryptography

Introduction to Cryptography

Related Topics

Number Theory

Computer Science

Cybersecurity

Information Theory

Discrete Mathematics