M 343 L Applied Number Theory Fall 14


INSTRUCTOR: Felipe Voloch (RLM 9.122, ph.471-2674, )

CLASS HOURS: TTh 9:30 -- 11:00



OFFICE HOURS: Wed 9:30 -- 11:00 or by appointment.

TEXTBOOK: An Introduction to Mathematical Cryptography by Jill Pipher, Jeffrey Hoffstein, Joseph H. Silverman.

NOTE ON PREREQUISITES: The university's course schedule has listed the prerequisites for this class as being 343K or 328K, but the prerequisites are flexible. If you are not sure whether you have the right prerequisites, please contact me.

EXAMS AND GRADE POLICY: The grade will be determined from homework, a midterm (on Tue, 10/28, in class) and a final (on Wed, 12/10, 9:00-12:00, RLM 5.126) The two best grades from among these three will count 50% each for the course grade. Makeups will not be given.

HOMEWORK: Homework will be assigned every other week. Part of the homework will consist of computer projects.

COURSE DESCRIPTION:The purpose of this course is to introduce students to applications of Number Theory to Cryptography. This topic addresses the problem of preserving data integrity during transmission or storage against malicious attacks. Security on the Internet is a hot topic and it is all based on interesting mathematics. The main emphasis will be on how to perform efficiently (usually with a computer) the number theoretic calculations that come up in cryptography. The prerequisites will be kept to a minimum, but previous exposure to elementary number theory or algebraic structures would be helpful. This course has a quantitative reasoning flag.

Topics to be covered:

Basic properties of integers. Prime numbers and unique factorization. Congruences, Theorems of Fermat and Euler, primitive roots.

Basic Number Theoretic Algorithms. Euclidean Algorithm, Modular Exponentiation. Primality testing and factorization methods.

Cryptography, basic notions. Public key cryptosystems. RSA. Implementation and attacks.

Discrete log cryptosystems. Diffie-Hellman and the Digital Signature Standard. Elliptic curve cryptosystems.



Some links:

  1. PARI/GP homepage.
  2. Precompiled Mac PARI/GP binary and Precompiled Windows PARI/GP binary.
  3. Log file of pari/gp class on 9/18.
  4. Log file of class on 10/16.
  5. Log file of pari/gp session on elliptic curves on 11/20.
  6. Log file of pari/gp session on elliptic curve baby-step giant-step on 11/25.
  7. Sage Math cloud. How to use Pari/GP in it.
  8. Small subgroup attack on Java's Diffie-Hellman implementation.
  9. Digital Signature Standard.
  10. Presentation on advances in discrete logs. Discusses consequences for cryptography in a somewhat hysterical tone.
  11. Factoring RSA keys by gcds.
  12. An intuitive explanation of asymmetric cryptography.
  13. Elliptic curve java applet Link seems dead.
  14. Elliptic curve plotter.
  15. Breaking ECC2K-130 Also here.
  16. RSA-210 factored.
  17. Akamai, Heartbleed and RSA.
  18. UT public key.

The University of Texas at Austin provides upon request appropriate academic accommodations for qualified students with disabilities. For more information, contact the Office of the Dean of Students at 471- 6259, 471-6441 TTY. If you need special accomodation for an exam, please bring me a letter from SSD at least three weeks before the exam.