Office: 568 McBryde
Office Phone: 231-6950
Home Phone: 552-9563 (before 9 PM)
Tue, Wed, Thu: 3:00-4:00 pm
and by appointment
Time and Place: 1:25 -- 2:15 p.m. Mondays, Wednesdays and Fridays, Randolph 110
Text and Topics: Cryptography: Theory and Practice (3rd edition) by D. R. Stinson. Topics include classical cryptography from simple substitution ciphers up through stream ciphers as well as cryptanalysis of these systems, Shannon's information theory, block ciphers, substitution-permutation networks, linear cryptanalysis, differential cryptanalysis, and the Advanced Encryption System. These correspond to material from Chapters 1, 2 and 3 of the text. In addition, we will study the ENIGMA cipher, its historical importance, and how a team of Polish cryptanalysts made their amazing initial breakthrough. There will be handouts that cover all topics not treated in the text.
Prerequisites: At least one mathematics course at or beyond the 3000 level, as well as knowledge of either a high-level programming language (e.g. C, C++, Java, python) or a computer algebra system (e.g. Mathematica, Maple, or Sage).
What This Course Is About: The development and emergence of those twin miracles of communication and connection we all know as the internet and the web has transformed the world. It has also enriched our vocabulary with virus, Trojan horse, worm, hacker, cyper piracy, identity theft, firewall breach ... the list goes on and on. But it's no longer merely stray bad guys trying to get into our machines and ruin our lives. Cybercrime is now Big Business.
The art/science/study of secure information is called cryptology, which encompasses both cryptography (building security systems that thwart attempts by adversaries to gain unauthorized access to sensitive information and communication systems) and cryptanalysis (gaining unauthorized access to sensitive information and communication systems by overcoming adversaries' security systems).
This course will provide an introduction to the theory and practice of both cryptography and cryptanalysis. The main emphasis will be on developing the mathematics required to understand the protocols occurring in the field, but we will also treat such topics as the design, complexity and implementation of cryptographic and cryptanalytic algorithms.
What This Course Is NOT About: Whfkqltxhvirueuhdnlqjlqwrfrpsxwhuvdqgfrpsxwhuqhwzrunv.
Students with Special Needs: Any student with disabilities or similar circumstances should meet with the instructor during the first week of class to discuss accomodations.
Evaluation: There will be two tests, each worth 20% of your grade. These tests are tentatively scheduled for Monday, Sept 30 and Wednesday, November 13; these tests may include a take-home portion.
There will be regular problem sets, worth 40% of your grade. A problem set is late after the end of class on the day it is due. Late problem sets count zero.
The final exam is comprehensive; it is worth 20% of your grade and is scheduled for Friday, December 13, 2013 from 1:05 to 3:05 p.m. Giving or receiving assistance on the tests or final exam (except that specified by the instructor) is a violation of the honor code.
Last Drop Date: Friday, October 4, 2013
Problem Sets Policy: Problem sets are to be typed, either in LaTeX or using a word processor that has mathematical symbols. Include the statement of each problem before giving your solution. Hand your problem set in flat, stapled in the upper left-hand corner, and with your name, the date, and the problem set number in the upper right-hand corner. Once again, forty percent of your grade is based on the problem sets. You are free to use your textbook and notes and you may consult the instructor. You may discuss problems with your classmates, but the work you hand in must reflect your own understanding of a particular problem. For the most part, this policy works very well, since much of what you learn about cryptography and cryptanalysis will come from conversations with your fellow students. However, I will change this policy -- reluctantly -- if it is being abused.
Late Work and Test Policy: A problem set is late after the end of class on the day it is due. As previously mentioned, late problem sets count zero. I do not give make-up tests; however, I will substitute your final exam grade for at most one of your in-class tests, if such a substitution is to your advantage. You may not make up a missed final exam.
Letter frequencies in English
Vigenere cipher information
ENIGMA encryption information
Hadamard code information
Tutorial on linear and differential cryptanalysis
Information about the Advanced Encryption System
Grading: A percentage grade of 90, 80, 70 or 60 on any piece of work guarantees you a grade of A-, B-, C- or D-, respectively. Plusses and minuses are judgment calls and not subject to debate. Graduate students should note that the Graduate School converts any grade below C- to an F.
Honor System: The University Honor System is in effect for the in-class tests, the final exam and -- except for as noted above -- the graded problem sets.
IMPORTANT MESSAGE!! If you are not on the class roll that comes out after the last add date, immediately check your schedule at a terminal and start attending the proper section. For no forseeable reason (computer and registrar personnel mistakes included) will you be allowed to stay in the wrong section or to drop a section for which you are actually enrolled after the last drop date. By simply attending a section you will not be placed on its roll.