Orientation
Learning Pathways Through Computational Number Theory
Four routes through this 182-page collection, chosen by what you need to build rather than by chapter order.
Engineering / MathematicsOrientation2 min readKV-MATH-0503
This collection covers 21 topic streams. Reading them in order works, but most people arrive with a specific goal. These four pathways get you to a working understanding of a particular task with the least detour.
Pathway A — Implementing a factoring or primality suite
The shortest route to working code. Skips number field theory almost entirely.
- FoundationMultiprecision representation, binary powering, Montgomery reduction
- CompositenessStrong pseudoprime tests, Baillie-PSW
- Easy factorsTrial division, Pollard rho, ECM
- Hard factorsQS factor base, MPQS, NFS
- ProofJacobi sum test, ECPP
Pathway B — Number field arithmetic
The core of the subject. Requires the linear algebra and polynomial layers first; skipping them is the most common cause of getting stuck.
- PrerequisitesHermite normal form, LLL, Berlekamp
- RepresentationNumber fields, standard representation
- OrdersOrders, Round 2
- IdealsModule representation, ideal arithmetic
- DecompositionSimple case, Buchmann-Lenstra
- InvariantsClass groups, relation matrices
Pathway C — Quadratic fields only
A genuinely self-contained route. Quadratic fields admit concrete algorithms via binary quadratic forms that avoid most of the general machinery, which makes this the best entry point for building intuition.
Start at quadratic field discriminants and read the Quadratic Fields stream straight through. Only continued fractions is needed from elsewhere.
Pathway D — Elliptic curves
Elliptic curves appear here in three distinct roles, and it helps to keep them separate.
| Role | Where it appears | What matters |
|---|---|---|
| Object of study | Definitions, L-functions | Rank, torsion, conjectures |
| Factoring engine | ECM | Group order varies with the curve — retry on failure |
| Primality engine | Goldwasser-Kilian, Atkin-Morain | Point counting and complex multiplication |
Prerequisite map
If a page assumes something you have not met, this table names the page that supplies it.
| If you are reading | You will need |
|---|---|
| Anything on ideals | Hermite normal form |
| Prime decomposition | Polynomial factorisation mod p |
| Class group algorithms | Elimination over F_p and Smith normal form |
| Maximal order computation | Discriminants |
| Any sieving method | Smoothness |
Frequently Asked Questions
Can I read the streams in any order?
Which pathway should a complete beginner take?
Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — collection orientation material. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.