This course is designed to be a gentle introduction the the theory of mathematical cryptography. This is a beautiful and very concrete application of some more abstract and theoretical mathematics. The main goal will be to get an understanding of public key cryptography and RSA. If we have any time left we may explore the geometric enhancement using elliptic curves.
Along the way we will introduce some modern number theory, abstract algebra, and a bit linear algebra of probability theory. We will also spend some time warming up to a theorem-proof style of abstract mathematics. The pace will be relatively gentle, and the goal is to explore some modern mathematics with a very concrete application to guide us.
We will also be using mathematical software to implement some algorithms of our own. I'd reccommend sage, wich is a free add on to python, and can also be run in your browser at cocalc.com.
Instructor: Gabriel Dorfsman-Hopkins
Email: gdh2[_at_]math.washington.edu
Office: PDL C-008-G
Class Hours:MWF 2:30-3:50
Classroom: THO 335
Office Hours:Wednesday and Friday, 1:30-2:20 in my office
Textbook: An Introduction to Mathematical Cryptography, available online through the UW Library
Final Date: Wednesday, May 15, 2:30-3:50
Syllabus: Can be found here
Homework: Due weekly on Modays class.
Finan Project Assignment Sheet.
HW4: 2.3, 2.4, 2.5, 2.6, 2.8, 2.10
HW3: 1.15, 1.16, 1.17, 1.20, 1.22(a), 1.26, 1.32, 1.34, 1.36, 1.38(no proof). Bonus: 1.18, 1.19, 1.23, 1.24, 1.27, 1.29, 1.31, 1.33, 1.37
HW 1: 1.4(a), 1.6, 1.9, 1.10. Choose 1: 1.11, 1.13, 1.14
Here I will post announcements, homework assignments, and solutions to quizzes.
Homework: 30%br>
Quizzes: 30%
Final Exam: 30%
Participation: 10%
Cocalc. Here you can make a free account and use sageworksheets to code in real time.
Syllabus