SYLLABUS
The course outline is now available. Lecture notes from the 2017 edition of the course are available on OCW. The 2019 edition will be similar but include some new material on isogeny graphs and quaternion algebras relevant to post-quantum elliptic curve cryptography (post-quantum refers to protocols that are not known to be vulnerable to a quantum-polynomial-time attack, the algorithms are intended for a classical computer).
Text Book
There is no required text; lecture notes will be provided. We will make reference to material in the following books, all of which can be accessed electronically from MIT (see the MIT Libraries web page for offisite access).
Elliptic Curves: Number Theory and Cryptography, Second Edition, Lawrence C. Washington. (errata)
Elliptic Curves, J.S. Milne. (errata)
The Arithmetic of Elliptic Curves, Joseph H. Silverman. (errata)
Advanced Topics in the Arithmetic of Elliptic Curves, Joseph H. Silverman. (errata)
Primes of the form x2+ny2: Fermat, Class Field Theory, and Complex Multiplication, David A. Cox. (errata)
The following two books give quite accessible introductions to elliptic curves from different perspectives. You may find them useful as supplemental reading, but we will not use of them in the course.
Elliptic Curves in Cryptography, Blake, Seroussi, and Smart.
Rational Points on Elliptic Curves, Joseph H. Silverman and John Tate.
The following references provide introductions to algebraic number theory and complex analysis; neither of these topics is an official prerequisties for this course, but we will occasionally need to make use of their results.
Algebraic number theory, J.S. Milne.
Complex analysis, Serge Lang.
Software
Some of the theorems and algorithms presented in lecture will be demonstrated using the Sage computer algebra system, which is based on python. Most of the problem sets will contain at least one computationally-focused problem, which you will likely want to use Sage to solve, but you are free to use other packages, or to simply write your own code, if you wish. In any case, you will be graded on your results, not your code.
Problem Sets
There will be weekly problem sets, each of which typically contain three to five multi-part problems. Typically you will not be required to solve all of the problems, you be given the option to choose a subset that sums to 100 points. Some problems are purely theoretical in nature, while others are more computationally focused; those who prefer proofs to programming (or vice versa) can choose problems that appeal to there interests.
Problem sets are to be prepared in typeset form (typically via latex) and submitted electronically via e-mail as pdf-files. Collaboration is permitted/encouraged, but you must write up your own solutions and identify any collaborators, as well as any resources you used that are not listed above; there will be computational problems for which the correct answer will be different for every student, based on a unique identifier derived from your student ID.
Late Policy
Late problem sets will not be accepted; your lowest problem set score is dropped when computing your grade, so you can afford to skip one. Please do not ask for permission to turn in your problem set late; if you cannot complete an assignment on time you should skip it and move on to the next one.
Grading
Your grade will be determined by your average problem set score, after dropping your lowest score. There are no exams and no final.
Disability Accomodations
Please contact Kathleen Monagle, Associate Dean in Student Disability Services as early in the term as possible, if you have not already done so.
If you already have an accommodation letter, please be sure to submit a copy to Mathematics Academic Services in room 2-110.
Even if you do not plan to use any accommodations, if there is anything I can do to facilitate your learning, please let me know.
