I231 Mathematical Foundations of Cybersecurity
Yan Huang

Course Goal

The goal of this course is for students to be introduced to the basic mathematical and programming tools used in modern security research and practices. The course covers introductory material from a number of disparate fields including functional programming, probability theory, analysis of algorithms, complexity theory, number theory, and group theory.



Late assignments are NOT accepted!

HW0, due on Wednesday (Sept 7, 11:59pm). hw0.mdk
HW1, due on Wednesday.(Sept 21, 11:59pm) hw1.mdk
HW2, due on Wednesday.(Oct 5, 11:59pm) hw2.mdk
HW3, due on Wednesday.(Oct 20, 11:59pm) hw3.mdk
HW4, due on Friday.(Nov 4, 11:59pm) hw4.mdk
HW5, due on Monday.(Nov 28, 11:59pm) hw5.mdk
HW6, due on Friday.(Dec 9, 11:59pm) hw6.hs

Student Honor Code

Give credit where it’s due and don’t plagiarize. Don’t copy or read others’ solutions. IU’s Honor Code and policies apply to your conduct in this course. Violations of the Honor Code will be treated seriously. Please let me know if you have any questions—better to be safe than sorry!

You may discuss readings, notes, and problems with other students in this course, but each student must independently write and submit their answers to questions on the assignments. You may not read or copy anyone else’s written answers—all submitted work must be your own, based on your own understanding of the content after such discussions.