January 13: 
introduction and notes on RSA

January 14:
updated RSA prerequisites for graduate students

January 23:
New Section 2.1.2: hard and easy things for RSA
In Section 2.1.2, spelled out what is private and public for RSA
notes on DLP (Section 2.2)

January 25:
Added computing the gcd to the list of "easy" computations in Section 2.1.2

February 9:
Added beginning of section on discrete Fourier transform

February 10:
v1
Updated Proposition 3.2.2; this works for any nth root of unity that isn't 1!
Updated Examples 3.2.6 and 3.2.7 so we only required z_j neq 1
Put in Example 3.2.8

v2
Added in Section 3.2.5, two examples when the frequency is not an integer

February 24:
Added Section 3.3 on continued fractions
Added Section 3.4 on Shor's algorithm

March 28:
Added Section 4.1 on LWE

March 29:
Added Sections 4.1.1 containing Sage instructions and 4.1.2 on BV variant of LWE

April 3:
v1
Added Sections 4.2 and 4.3 (this one is unfinished)

v2
Finished up Section 4.3 on FHE