CS 655 Class

Syllabus for CS 655.

Instructor: Samuel S. Wagstaff, Jr.

Phone: 49-46022; E-mail: ssw@cs.purdue.edu

In the event of a major campus emergency such as a tornado or flu epidemic, course requirements, deadlines and grading percentages are subject to changes that may be necessitated by a revised semester calendar or other circumstances beyond the instructor's control. Any such changes will be recorded on this web page.

Prerequisite: CS 555.

Texts: (Don't buy any books until the first class meeting.)

The top schools for information security.

The overall course policies are similar to Spaf's.

Location and Time: LWSN B134, TuTh 1:30 PM - 2:45 PM.

Office: LWSN 1167; Office hours: Tuesday 3-4 PM, Wednesday 10:30 - 11:30 AM.

Grading: Homework: 25%; Midterm exam 25%; Final exam 50%.

Day-by-day list of topics covered.

All regrading of homework and midterm exams must be done within two weeks after the work is returned to the class.

Please use a word processor to format your homework solution. Print it on paper and turn in the paper copy at the beginning of class.

Homework # 0, due Tuesday, September 5, 2017, 1:30 PM. Text of the questions.

Homework # 1, due Tuesday, September 19, 2017, 1:30 PM. Text of the questions.
First S-box table needed for Question 1.
The table in Question 1 helps you in the other questions.

Homework # 2, due Thursday, October 12, 2017, 1:30 PM. Text of the questions.

Homework # 3, due Tuesday, November 28, 2017, 1:30 PM. Text of the questions.

Solution to homework and the midterm. (Works only from domain .purdue.edu .)

Review 1: Basic probability and hash.

Review 2: Remainders, arithmetic, divisibility, gcd, primes.

Review 3: primes, congruences, Caesar cipher.

Review 4: Fermat, Euler, fast exponentiation, public-key ciphers.

Review 5: CRT, solving quadratic congruences, oblivious transfer.

Paper by Biham and Shamir on differential cryptanalysis.

Groups, discrete logs, etc.

Factoring algorithms.

CS 555 Week 11 factoring algorithms.

Millionaire's problem.

Euler's Criterion for evaluating a Legendre symbol.

CRT, QR, Oblivious, 0Kprf.

Elliptic curves.

Advanced Encryption Standard.

Mathematical Details of Advanced Encryption Standard.

Hash functions.

Paper by Chabaud and Joux.

Paper by Biham and Chen.

Discrete Logarithms.

Lattices.

Lenstra-Lenstra-Lovasz algorithm.

Attacks on RSA.

More attacks on RSA.

Generating large random primes.

Mid-Term Exam, Tuesday, October 24, in class, Lawson B134. Do not bring cell phones, computers, or any other device that communicates to the exam.

Final Exam, Monday, December 11, 8-10 AM, Lawson 1106. Do not bring cell phones, laptop computers, or any other device that communicates to the exam.

This page last modified November 30, 2017.