Topic: |
Codes and Cryptography |
---|---|
Room: |
311 Adams Hall (may be changed) |
Time: |
M W F at
12:00-12:50 (Jan
14-May 2, except
Jan 21 and Mar 24-28). |
Call |
26355
(undergraduates) |
Credit hours: |
3
(undergraduate) |
Instructor: |
|
Instructor's office: |
535 SEO |
Office |
M 2:00-2:50, W 9:00-9:50, F 1:05-1:50 in 535 SEO.
In addition, normally I can stay after class for 10--15 minutes to
answer questions. |
Phone: |
(312) 996-3054
(office) |
E-mail: |
|
Home page: |
The MCS
425 home page is at
http://www.math.uic.edu/~leon/mcs425-s08. |
Prereq-uisites: |
The following courses with grade C or better:
(i) MCS 261 or CS 202. Some background in discrete mathematics, in linear algebra, and (to a lesser extent) in probability is needed. |
Textbook: |
Wade Trappe and Lawrence C. Washington, Introduction to Cryptography with Coding Theory, Second Edition, Prentice-Hall, 2006, ISBN 0-13-186239-1 (available at UIC Bookstore). |
Handouts: |
In addition to the textbook, a number of handouts will be placed on the web site. Many of these handouts are copies of transparencies that I will go over in class. You should print out these handouts and bring them to class (at least until they have been discussed in class). |
Grading policy: |
Based on total points, with some consideration of undergraduate/graduate status. 100 points are possible:
Homework:
10 points (approx) TOTAL POINTS POSSIBLE 100 points |
Midterm exam: |
Weds, Mar 12, in class, room to be announced. This date can be shifted a few days if it is inconvenient for students. |
Final exam: |
Fri, May 9, 8:00-10:00, room to be announced. This date is fixed by the timetable and cannot be changed. |
Quizzes |
Three short quizzes (15-20 minutes each), will be given. Tentative dates are Feb 11, Feb 27, and Apr 16. Each quiz have 1-3 questions (most likely, 2 questions) and be worth 12 points. The quiz total will be the sum of the highest two quiz grades and one-half the lowest quiz grade (30 points possible). |
Homework exercises: |
A number of homework exercise sets will be assigned. Unless announced otherwise, these should be written up neatly and turned in (no need to type them), Selected exercises will be graded. Solutions will be posted for many of the homework exercises. |
MCS 425 Syllabus
Fall Semester, 2006
Chap 1: Overview of cryptography and its applications
Sec 1.1 Secure communications, attacks on encryption algorithms, Kerckhoffs's principle, symmetric-key (private-key) vs public key algorithms.
Sec 1.2 Cryptographic applications
Chap 2: Classical cryptosystems
Chap 3: Basic number theory for cryptography and coding theory
Chap 4: Feistel ciphers and the The Data Encryption Standard (DES)
Chap 5: The Advanced Encryption Standard (AES)
Sec 5.1 The basic algorithm (brief discussion, time permitting)
Sec 5.2 The layers of the algorithm (brief discussion, time permitting)
Chap 6: The RSA Algorithm
Chap 7: Discrete Logarithms
Chap 8: Hash Functions
Chap 9: Digital Signatures
Chaps 10--14
If time permits, a few selected topics from these sections will be covered
Chap 18: Error Correcting Codes