A lattice-based public key cryptosystem (PKS) makes use of the computationally hard problem of solving the shortest/closest vector problem in an integer lattice. NTRU is a lattice-based PKS presented at Crypto ’96, published in ANTS in 1998. With NTRU, we (Hoffstein, Pipher, Silverman) introduced the concept of ideal (cyclic) lattices, enabling a fast and efficient encryption scheme which is also resistant to speed ups afforded by quantum computing. In this talk, I’ll explain the algorithm, and discuss some associated mathematical developments up to the present time. No previous knowledge of public key cryptography is assumed.