I’m supposed to be giving a presentation in a couple of weeks on modern factorization techniques, with a particular emphasis on the number field sieve.
In anticipation of this talk, I’ve decided to write up a description of some of these methods. These are mostly an adaptation of notes I’ve taken from classes and some popular texts, with a particular emphasis on concrete examples.
The notes are motivated by a running example: attacking messages encrypted using the RSA cryptosystem. Thus, to kick the whole thing off, I’ve posted an account on the working of the RSA cryptosystem under my new special section on Factorization.
Please post comments and corrections!