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

Isogeny-Based Cryptography

Research Depth 102 in the knowledge graph ☐ I know this ☆ Set as goal
542prerequisites beneath it
See this on the map →
Elliptic Curve Cryptography BasicsPost-Quantum Cryptography→
isogeny post-quantum elliptic-curves cryptography

Core Idea

Isogeny-based cryptography uses the structure of isogenies (maps) between elliptic curves to build post-quantum public-key cryptosystems. Unlike lattice or code-based cryptography, isogeny schemes are based on algebraic geometry. The most developed scheme is SIKE/CSIDH, which constructs encryption by finding a path of isogenies through a graph of elliptic curves. Security relies on the hardness of the endomorphism ring computation problem, which has no known polynomial-time classical OR quantum algorithms. Isogeny schemes offer small keys and ciphertexts (advantages over lattices/codes), though key generation is slow. NIST selected SIKE as a finalist in the post-quantum cryptography standardization process.

Explainer

Isogeny-based cryptography is a geometric approach to post-quantum cryptography, leveraging the deep structure of elliptic curves and isogenies. Unlike lattice-based cryptography (linear algebra) or code-based (coding theory), isogeny schemes use algebraic geometry.

CSIDH/SIKE: The main constructions. Both work in a graph of elliptic curves, where vertices are curves and edges are isogenies. A secret path through the graph encodes a private key; the public key is the destination curve. To compute the private key from the public key requires finding the secret path, equivalent to the endomorphism ring computation problem.

Hardness: The hardness of isogeny-based schemes rests on:

1. Endomorphism Ring Computation: Given an elliptic curve, compute its endomorphism ring (hard).

2. Path Finding: Given start and end vertices in the isogeny graph, find the path (hard on random graphs).

Both are believed hard for classical and quantum computers.

Advantages:

Disadvantages:

NIST Standardization: SIKE was selected as a finalist in the NIST post-quantum cryptography competition, though later withdrawn due to new attacks. CSIDH remains active, with improvements addressing prior vulnerabilities.

Isogeny-based cryptography remains a promising post-quantum avenue, combining mathematical elegance with practical efficiency, though standardization and real-world deployment are still maturing.

Practice Questions 2 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 → Computational Hardness Assumptions → Lattice-Based Cryptography → Learning with Errors (LWE) → Post-Quantum Cryptography → Isogeny-Based Cryptography

Longest path: 103 steps · 542 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.