CMSC/Math 456, Cryptology, Fall 2006, MWF
10:00AM-10:50AM
Instructor:
Aravind
Srinivasan
Office: AVW 3227, Phone: 301-405-2695
Instructor's office Hours: Mon, Wed 2-3PM, in AVW 3227
TA: Martin Paraskevov (martin AT cs.umd.edu),
Office Hours Tue, Thu 2-3 PM, in AVW 1112
Course Time and Location: 10-10:50 AM, CSI 2117
Book:
Introduction to Cryptography with Coding Theory,
Second Edition (ISBN: 0-13-186239-1) by Wade Trappe and Lawrence C.
Washington.
Course Webpage:
http://www.cs.umd.edu/class/fall2006/cmsc456/index.html
Course Description:
Cryptology is the study of the design and analysis of various
encryption schemes, and related topics. The plan is to study the
basics of the subject and then touch on several recent developments.
Grading: Homework 30%, Midterm: 30%, Final: 40%.
Homework should be stapled and submitted on time; late homework will not
be accepted. Your lowest homework score will be dropped. Graduate students
will be given additional problems in the homeworks and exams.
Approximate syllabus
(Subject to adjustment): We will cover some (not all) material from
Chapters 2, 4, 6, 7, 8, 9, 12, 14 and 16 from the textbook. We may also touch
upon the Advanced Encryption Standard, protocols such as SSL, and other
such topics if time permits. The required mathematics will be
developed as we go along.
Mid-Term and Final Exam
The mid-term and final exam will be closed-book and closed-notes;
calculators and
other computing equipment will not be permitted.
The final exam is scheduled by the University to be on
Wednesday, December 20, 2006, from 8-10 AM in the classroom.
The mid-term will also be in class at the usual class time (10 - 10:50 AM),
on Wednesday, October 18, 2006.
The Mid-Term will cover the following topics:
- Section 1.1 (up to the end of Section 1.1.1)
- Chapter 2 (the initial part up to the end of Section 2.3; for the
Vigenere cipher, you only need to know how to encode using it, and are
not required to know the attacks on it)
- Section 2.9
- Chapter 3 (the initial part up to the end of Section 3.7)
- Section 4.2
- Section 4.5 (only the ECB and CBC modes)
- Section 4.7
- Section 4.8 (just the basic idea -- you don't need to know about "salt")
- Section 6.1,
- Section 6.2.2 (just the initial part, where we see an efficient
attack -- you don't need to know how to prevent this attack)
- Section 6.3 (all the material up to the beginning of the
Solvay-Strassen Test -- you don't need to know the Solvay-Strassen Test)
- Section 6.4 (only the initial part -- Fermat Factorization and the
p - 1 Factoring Algorithm)
- Section 6.6
- Section 6.7
- Section 7.1
- The initial part of Section 7.2, up to the end of Section 7.2.1
The final exam will cover the following sections from the
textbook:
- Section 1.1 (up to the end of Section 1.1.1),
- Chapter 2 (the initial part up to the end of Section 2.3),
- Section 2.9,
- Chapter 3 (the initial part up to the end of Section 3.7),
- Section 3.9,
- Section 4.2,
- Section 4.5 (only the ECB and CBC modes),
- Section 4.7,
- Section 4.8 (just the basic idea -- you don't need to know about
"salt"),
- Section 6.1,
- Section 6.2.2 (just the initial part, where we see an efficient
attack -- you don't need to know how to prevent this attack),
- Section 6.3 (all the material up to the beginning of the
Solvay-Strassen Test -- you don't need to know the Solvay-Strassen Test),
- Section 6.4 (only the initial part -- Fermat Factorization and the
p - 1 Factoring Algorithm),
- Section 6.6 and Section 6.7,
- All of Chapter 7, EXCEPT FOR Section 7.2.3,
- Section 8.1, Section 8.2, and Section 8.4,
- Section 8.6 (you DO NOT need to know the PROOF of the main theorem of
this section, which shows that one-way functions and the random oracle
model yield ciphertext-indistinguishability; all else in this section is
included),
- Chapter 9,
- Chapter 12,
- Chapter 14,
- Chapter 16 (the initial part up to the end of Section 16.2), and
- Section 16.5.
Midterm solutions
Mid term stats:
Undergrad Max Score: 30/30
Undergrad Median Score: 23/30
Grad Max Score: 38/38
Grad Median Score: 38/38
Homework Assignments
Excused Absences
Students claiming a excused absence must apply in writing and furnish
documentary support (such as from a health-care professional who treated
the student) for any assertion that the absence qualifies as an excused
absence. The support should explicitly indicate the dates or times the
student was incapacitated due to illness. Self-documentation of illness
is not itself sufficient support to excuse the absence. An instructor
is not under obligation to offer a substitute assignment or to give a
student a make-up assessment unless the failure to perform was due to
an excused absence.
Academic Accommodations for Disabilities
Any student eligible for and requesting reasonable academic accommodations
due to a disability is requested to provide, to the instructor in office
hours, a letter of accommodation from the Office of Disability Support
Services (DSS) within the first two weeks of the semester.
Academic Integrity
The University of Maryland, College Park has a nationally recognized
Code of Academic Integrity, administered by the Student Honor Council.
This Code sets standards for academic integrity at Maryland for all
undergraduate and graduate students. As a student you are responsible
for upholding these standards for this course. It is very important for
you to be aware of the consequences of cheating, fabrication,
facilitation, and plagiarism. For more information on the Code of
Academic Integrity or the Student Honor Council, please visit
http://www.shc.umd.edu.
To further exhibit your commitment to academic integrity, remember to
sign the Honor Pledge on all examinations and assignments: "I pledge on
my honor that I have not given or received any unauthorized assistance
on this examination (assignment)."
Some Cryptology Links
Quadralay Cryptography Archive
This page is a very useful list of things associated with cryptography.
The National Security Agency