CSC 440 (701 & 710)
Assignments will be available
through this webpage. Written homeworks are due at the beginning of class.
Late homeworks will not be accepted, but the lowest homework score will be
Questions and Answers
There is a page with links
for further information.
Classes and office hours
The in-class section meets Th 5:45pm-9:00pm, CS&T 218. This course is
Office hours are Tu 3:15-4:45 and Th 4-5:30.
During that time you can find me in the CS&TC building,
If you want to set up an appointment at another time, or
simply ask a question,
send email to email@example.com.
Required text (new edition): Trappe, Washington: Introduction to Cryptography, Prentice Hall, ISBN:
0131862391 ; 2nd edition (July 15,
There are several cryptography texts available as
e-books at the library
web-page for free (you need your campusconnect information to log into the proxy
The following is a very rough schedule, and we might depart from it.
Classical Ciphers (Caesar, Substitution, Transposition, Vigenere, Hill
Cryptanalysis, Statistics, Mathematical Foundations
Week 4- 6
Modern Block Ciphers (DES, AES), and attacks (differential cryptanalysis)
Public Key Cryptography (DH Key exchange, RSA, ElGamal) and attacks
Advanced topics (Secret Sharing, Zero-Knowledge Proofs, Quantum Cryptography)
Homework, quizzes: 40%, Midterm: 30%, Final: 30%. I will use the following
Throughout the quarter there will be extra credit problems; extra credit does
not directly make up for points lost on homeworks or exams; instead it is added
in with a weight at the end to adjust grades upwards.
The midterm and final exams for the in-class section will take place during class. No make-up exams.
- The course adheres to the university guideline on
- Cheating is any action that violates university norms or
instructor's guidelines for the preparation and submission of
assignments. This includes but is not limited to unauthorized access to
examination materials prior to the examination itself; use or possession
of unauthorized materials during the examination or quiz; having someone
take an examination in one's place; copying from another student;
unauthorized assistance to another student; or acceptance of such
- Plagiarism is a major form of academic dishonesty involving the
presentation of the work of another as one's own. Plagiarism includes,
but is not limited to the following:
- The direct copying of any source, such as written and verbal
material, computer files, audio disks, video programs or musical
scores, whether published or unpublished, in whole or part, without
proper acknowledgment that it is someone else's.
- Copying of any source in whole or part with only minor changes in
wording or syntax, even with acknowledgment.
- Submitting as one's own work a report, examination paper, computer
file, lab report or other assignment that has been prepared by
someone else. This includes research papers purchased from any other
person or agency.
- The paraphrasing of another's work or ideas without proper
- A charge of cheating and/or plagiarism is always a serious matter.
If proven, it can result in an automatic F in the course and possible
- The use of others' web/publication content (text, graphics, codes) is
regarded as plagiarism without giving credit (see the above description of
- When you directly quote someone's work, you must put it in quotation
marks. Without such quotations and reference, it is regarded as an act of
plagiarism (see the above description of plagiarism).
- Using materials that the student prepared for other purposes (e.g.,
another course or for his/her work) needs the course instructor's prior
An incomplete grade is given only for an exceptional reason such as a death in
the family, a serious illness, etc. Any such reason must be documented. Any
incomplete request must be made at least two weeks before the final, and
approved by the Dean of the School of Computer Science, Telecommunications and
Information Systems. Any consequences resulting from a poor grade for the
course will not be considered as valid reasons for such a request.
Last updated: August 22nd, 2007.