




General Information


Time 
: 
TuTh 2:00pm  3:20pm

Location 
: 
OHE 100C

Instructor 
: 
Bill Cheng,
Office Hours: TuTh 12:45pm  1:45pm in SAL 228,
Email:
<bill.cheng@usc.edu> or
<william@bourbon.usc.edu>
(Please do not send HTML emails. They will not be read.)

TA 
: 
Alix L.H. Chow,
Email: <lhchow@cs.usc.edu>,
Office Hours: Wed, 2:00pm  4:00pm in SAL 339

Grader 
: 
(none)

Midterm Exam 
: 
in class, Tue, 10/24/2006 (firm)

Final Exam 
: 
2pm4pm, Thu, 12/7/2006
(firm)

Msg Archives 
: 
messages from Bill,
messages from Alix



Class Resources


Description 
: 
textbooks, topics covered, grading policies, additional resources, etc.

Papers 
: 
required technical papers

Lectures 
: 
slides from lectures in HTML and PDF formats

Homeworks 
: 
homework assignments
(please also see important information about programming assignments
at the bottom of this page.)



News

(in reversed chronological order)
 10/17/2006:
The midterm exam will be held in OHE 100C. It is 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 cryptanalysis of classical ciphers
([BC: Fixed 10/22/2006]
last slide is
slide 21 of lecture on 10/10/2006).
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
 pseudorandom bit generators
 linear congruential generator
 polynomialtime statistical tests
 statistics background
 normal distribution
 chisquare distribution
 five basic tests
 frequency (monobit) test
 serial (twobit) test
 poker test
 runs test
 autocorrelation test
 cryptographically secure PRBG
 RSA pseudorandom bit generator
 BlumBlumShub pseudorandom bit generator
 stream ciphers
 synchronous vs. selfsynchronizing stream ciphers
 LFSR
 connection polynomial
 math background
 number theory
 abstract algebra
 group
 ring
 field
 polynomial ring
 finite field
 linear complexity
 BerlekampMassey algorithm
 Nonlinear FSR
 Stream ciphers based on LFSRs
 Geffe generator
 correlation attacks and correlation immunity
 summation generator
 nonlinear filter generator and knapsack generator
 clock controlled generators
 alternating step generator
 shrinking generator
 Stream ciphers not based on LFSRs
 block ciphers
 attacks
 modes of operation
 cascade cipher and multiple encryption
 meetinthemiddle attacks
 knownplaintext unicity distance
 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
 unicity distance
 language statistics
 method of Kasiski
 index of coincidences
 HW1, HW2, HW3, HW4
 8/7/2006: Watch this area for important announcements.


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!


