Notes

Explanations of the mathematics our measurements rest on, a reference to the attacks, and a catalogue of the schemes they apply to. The worked examples run on groups small enough to follow by hand. They are computed by the code that builds this site, and every number on them is checked again each time it is built.

Reference

Cryptanalysis reference
How public-key hardness assumptions are attacked: what each attack needs, what it costs, the largest computation on record, and where it stops applying.
Schemes
The schemes in use and the ones replacing them, from RSA and elliptic curves to ML-KEM, ML-DSA, SLH-DSA and SQIsign: what each rests on, its sizes, and its status against quantum computers.

Elliptic curves

What an elliptic curve is, why its points form a group, and why recovering a secret multiple of a point is hard enough to build cryptography on.

Lattices

The mathematics under ML-KEM and ML-DSA: lattices, short vectors, learning with errors, and the reduction algorithms used to attack them.

Worked examples

Attacks run end to end on small instances, with every intermediate value shown. At these sizes the point is the mechanism, not the speed; each page says what changes at cryptographic sizes.

Explainers

Longer pieces that compare approaches rather than walking through one.