D. J. Bernstein
Integer factorization

Circuits for integer factorization


Background: RSA and the number field sieve

Large integers

Background: What o(1) means
The cost of NFS for very large integers
The balance between sieving and linear algebra
Calculating the cost exponents
Historical notes on the cost-effectiveness of circuit NFS
Historical notes on circuits for linear algebra
3 versus 1.17

Small integers

Figuring out the exact cost of NFS
The most serious Lenstra-Shamir-Tomlinson-Tromer error
Historical notes on mesh routing in NFS

General concepts

The notion of computation cost
Cost versus operations