

Applied Cryptography 
CSCI 531, Spring 2012


General Information


Time 
: 
MW 9:30am  10:50am 
Location 
: 
OHE 100C 
Instructor 
: 
Bill Cheng
(for office hours, please see
instructor's web page),
Email:
<bill.cheng@usc.edu>.
(Please do not send HTMLonly emails. They will not be read.)

TA 
: 
(TBD)

Grader 
: 
Jeswanth Manikonda,
Email:
<manikond@usc.edu>.
(The grader will hold office hours the week after the announcement of each assignment's grades.)

Midterm Exam 
: 
during class, Wed, 3/7/2012 (firm) 
Final Exam 
: 
8am10am, Fri, 5/4/2012 (firm)



Class Resources




News

(in reversed chronological order)
 3/31/2012:
Office hour this coming Monday (4/2/2012) will only be half an hour
long (2:00pm to 2:30pm). Sorry about the inconvenience.
 2/28/2012:
The midterm exam will be closed book,
closed notes, and closed everything (and no "cheat sheet").
Also, no calculators, cell phones, or any electronic gadgets are allowed.
Please bring a photo ID. Your ID will be collected at the beginning
of the exam and will be returned to you when you turn in your
exam. There will be assigned seating.
The midterm exam will cover everything from the beginning of the
semester till the end of DES
(last slide of lecture 13 on 3/27/2012).
Here is a quick summary of the topics (not all topics covered are listed):
 overview
 functions
 bijections and inverses
 oneway functions and trapdoor oneway functions
 permutations
 encryption schemes
 max number of permutations
 model of communication and channels
 types of adversaries
 types of cryptanalysis
 symmetrickey encryption
 model of communication and channels
 block ciphers
 substitution ciphers
 monoalphabetic substitution cipher
 homophonic substitution cipher
 polyalphabetic substitution cipher
 transposition ciphers
 composition of ciphers and product ciphers
 stream ciphers
 Vernam ciphers and onetime pad
 key space issues
 digital signatures
 signing and verification transformations
 authentication and identification
 entity vs. data origina authentication
 publickey cryptography
 necessity of authentication
 digital signature from reversible publickey encryption
 cryptographic hash functions
 onewayness
 weak collisionresistance
 strong collisionresistance
 keyed vs. unkeyed hash functions
 protocols and mechanisms
 key management
 symmetrickey and trusted third party
 publickey and certificate authority
 attacks
 ciphertextonly
 knownplaintext
 chosenplaintext
 chosenciphertext
 security models
 unconditional security
 complexitytheoretic security
 provable security
 computational security
 ad hoc security
 block ciphers
 classical ciphers
 simple transposition ciphers
 monoalphabetic substitution cipher
 polygram substitution cipher
 homophonic substitution cipher
 cryptographic codes
 polyalphabetic substitution cipher
 Vigenere cipher and variants
 Jefferson cylinders and rotors and the Enigma machine
 cryptanalysis of classical ciphers
 language statistics
 method of Kasiski
 index of coincidences
 block cipher analysis
 True Random Cipher
 complexity of attacks
 birthday paradox
 modes of operation
 cascade cipher and multiple encryption
 meetinthemiddle attacks
 knownplaintext unicity distance
 attacks on multiple encryption
 DES
 product ciphers
 Fiestel
 DES algorithm
 DES key scheduling
 DES properties
 DES weak and semiweak keys
 cryptanalysis of DES
 HW1, HW2, HW4
 2/21/2012:
Office hour tomorrow (Wed, 2/22/2012) has been moved to 2:30pm  3:00pm. Sorry about the inconvenience.
 1/4/2012:
 Registering with the class mailinglist
is required for this class. This is not the same as the
class discussion Google Group.
You will be receiving HW and exam scores through this list
via individual emails.
If you have not done so, please visit the
mailinglist page after the
semester starts. (You do not have to be registered for the course to
register with the class mailinglist.)
In the registration confirmation email, you will also get your
user ID and password for accessing protected area of this web site.
 Watch this area for important announcements.


Prerequisites

CS 102L (Data Structures) or graduate standing. It is assumed that
you know how to write programs, and how to debug them and make them
work correctly.


Important
Information about Programming Assignments

All homework assignments are programming assignments to be done in C/C++.
No other programming language will be accepted and your program must
compile and run with a Makefile on nunki.usc.edu.
(Sorry, no Java.)
You must be familiar with the UNIX development environment
(vi/pico/emacs, cc/gcc or g++/CC, make, etc.)
If a student signs up late for this class,
he/she is still required to turn all projects and homeworks
on time or he/she will receive a score of 0 for these assignments.
No exceptions!


