Disclaimer:

This is a set of notes, that summarizes the class coverage of material. By no means is this comprehensive or is a substitute for class notes and attendance. Also, updating of this page is not guaranteed to be frequent.

Class 1: Jan 19th

• Introduction to Cryptography
• Needs for Cryptography
• Risks - the Electrical Grid, Credit Card fraud
• Need for open crypto - the DVD and GSM embarrassments
• Needs for authentication without IDs - The Intel ID on Pentium III
• What can we do using Cryptographic Protocols 

Class 2: Jan 24th

• Introduction, continued
• Terminology, Encryption and Protocols
• Class notes are here

Class 3: Jan 31st

• Risks in Computer Systems
• "Breaking" - the security context - attacks with ports, passwords, virus, stack overflow, inside attacks and so on.
• "Breaking" a code (strength of the cipher)
• How long does Brute Force take?
• Introduction to basic encrypted communications

Class 4: Feb 2nd

• Cryptographic Protocols: Arbitrated, Adjudicated and Self Enforcing
• Communication with symmetric encryption
• Key Exchange with Symmetric encryption (using Trent)
• Need for Public Key Systems -> Merkles Puzzle
• Key Exchange with Public Keys
• Man in the Middle Attacks
• Need for better techniques

Class 5: Feb 7th

• The DES encryption system 

Class 6: Feb 14

• Digital Signatures - Symmetric (uses Trent)
• Digital Signatures, public key, self enforcing
• One way Hash Functions (message digest)
• Authentication strategies
• Passwords. Hashed passwords. 
• Dictionary attacks and "Salt"
• One time passwords (SKEY)

Class 7: Feb 16

• Authentication continued
• Challenge response schemes with symmetric encryption
• Message digest revisited and MAC (message authentication codes)
• "Do not encrypt/decrypt anything you do not trust"
• Challenge response with public keys
• The problem with knowing public keys
• Digital Certificates, Certificate Authoritites
• Chain of digital certificates

Class 8: Feb 21

• Authentication continued - symmetric keys
• Wide Mouth Frog
• Yaholam
• Kerberos
• Side Trip: "What is a random number"

Class 9: Feb 23

• The resend attack
• How to authenticate people... smart cards
• Some presentations
    1] Smart Cards - PowerPoint
    2] Secure Credit Card Transactions (SET) - HTML
• Secret Splitting
• Secret Sharing 

Class 10: Feb 28

• HOW SSL WORKS

Class 11: March 1st

• Digital Timestamping Services

Class 12: March 6th

• Payword and Micromint

Class 13: March 8th

• Chafing and Winnowing
• Subliminal Channels
• Types of Digital Signatures

[ Spring Break ]

Class 14: March 20

• Review for Mid Term Exam
• Bit Commitment

Class 15: March 22

• Mid Term Exam

Class 16: March 27

• RSA - how and why does it work (proof) - up to Claim 2

Class 17: March 29

• RSA Proof continued - up to "How to Find a and b"

Class 18: April 3

• Finding Large Prime numbers
• Primality testing - probabilistic algorithms
• Time taken to get 2 prime numbers
• Storing private keys, revisited

Class 19: April 5

• Exams handed out: Average 62, median 65
• On the way to Zero Knowledge Proofs...
• NP Completeness, Hard Problems
• Probabilistic Algorithms
• "Cut and Choose"
• Graph Isomorphism, Satisfiabilty
• .... and finally Zero Knowledge Proofs

Class 20: April 10

• Class merged with CSE 534 
  Advanced Computer Networks  (Dr. A. Sen)  1:40p - 2:30p at SCOB 105 

Class 21: April 12

• Class merged with CSE 534 
  Advanced Computer Networks  (Dr. A. Sen)  1:40p - 2:30p at SCOB 105 

Class 22: April 17

• Zero Knowledge, continued - Graph Isomorphism
• ZKP of identity, authentication
• Bit commitment, coin tossing (on telephone)
•  

Class 23: April 19

• Dining Cryptographers problem (Anonymous Broadcast)
• Fair coin flips with public keys (complex protocol)
• Mental Poker (dealing cards)
• One way accumulators

Class 24: April 24

• Digital Cash

Class 25: April 26

• Secure Elections

Class 26: May 1

• Review class

Class 27: May 3 No Class, reading day

Final Exam: Wed May 10th, 2:40p-4:30p (as per ASU final exam schedule)