A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Public Key Infrastructure

Graduate Depth 99 in the knowledge graph ☐ I know this ☆ Set as goal
536prerequisites beneath it
See this on the map →
Diffie-Hellman Key ExchangeDigital Signatures→
pki certificate-authority x509 certificate-revocation trust-model

Core Idea

PKI solves the key distribution problem for public-key cryptography: how do you know that a public key actually belongs to the claimed entity? Certificate Authorities (CAs) sign X.509 certificates binding identities to public keys. Trust flows hierarchically from root CAs (pre-installed in browsers/OSes) through intermediate CAs to end-entity certificates. Revocation (CRL, OCSP) handles key compromise. Certificate Transparency logs provide public auditability. PKI is the trust backbone of HTTPS, code signing, and email encryption, but its security depends on every CA in the chain being trustworthy — a single compromised CA can forge certificates for any domain.

Explainer

Public-key cryptography solves the key distribution problem — anyone can encrypt to you using your public key without a pre-shared secret. But this introduces a new problem: how do you know a public key belongs to who it claims? If an attacker substitutes their own public key for your bank's, they can intercept all your encrypted communications. Public Key Infrastructure (PKI) solves this through a hierarchy of trust anchored in Certificate Authorities (CAs).

A CA is a trusted entity that verifies identities and issues X.509 certificates — digitally signed documents binding a public key to an identity (typically a domain name). Your browser or operating system ships with a set of root CA certificates pre-installed in its trust store. When you visit https://example.com, the server presents a certificate chain: the site's certificate (signed by an intermediate CA) and the intermediate CA's certificate (signed by a root CA). Your browser verifies each signature up the chain. If the root CA is in the trust store and all signatures are valid, the browser trusts the site's public key and proceeds with the TLS handshake. This chain of trust is what puts the padlock icon in your address bar.

The system has important fragilities. Any trusted root CA can issue a certificate for any domain. Since browsers trust hundreds of root CAs operated by organizations in dozens of countries, a single compromised or coerced CA can forge certificates for any website, enabling man-in-the-middle attacks. The DigiNotar breach (2011) demonstrated this: attackers obtained fraudulent certificates for google.com and used them to intercept Iranian users' Gmail. Certificate Transparency (CT) mitigates this by requiring CAs to log all issued certificates in public, cryptographically verifiable logs. Domain owners can monitor these logs and detect unauthorized certificates. Chrome now requires CT for all certificates, making secret certificate issuance detectable.

Certificate revocation handles key compromise after issuance. Two mechanisms exist: CRLs (Certificate Revocation Lists) are periodically published lists of revoked certificates (bulky, often stale), and OCSP (Online Certificate Status Protocol) allows real-time status checks (but adds latency and leaks browsing data). OCSP stapling improves this by having the server fetch and include a CA-signed OCSP response in the TLS handshake, eliminating the client's need to contact the CA. Despite these mechanisms, revocation remains PKI's weakest link — many browsers soft-fail (accept the certificate if revocation status cannot be checked), and revocation information propagates slowly. Short certificate lifetimes (Let's Encrypt's 90-day certificates) partially compensate by limiting the window during which a compromised certificate can be misused.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Finite State Machines (FSMs) → Deterministic Finite Automata (DFA) → Nondeterministic Finite Automata (NFA) → Two-Way Finite Automata → NFA to DFA Conversion (Subset Construction) → DFA Properties and Minimization Algorithms → Regular Languages: Definition and Characterization → Context-Free Grammars (CFGs) → Pushdown Automata (PDA) → Equivalence of CFGs and Pushdown Automata → Closure Properties of Context-Free Languages → Limitations of Context-Free Languages → Pumping Lemma for Context-Free Languages → Turing Machines → Variants of Turing Machines and Equivalence → Nondeterministic Time Complexity and NP → The P vs. NP Problem → Complexity Class P: Polynomial Time → Hash Functions and Collision Resistance → The RSA Cryptosystem → Digital Signatures → Public Key Infrastructure

Longest path: 100 steps · 536 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.