CSE539 -- Applied Cryptography, Spring 2005

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.

Dates on this page are for the actual on-campus class may not be applicable to some online students.

 This page will be updated as class progresses....

Class 1: Jan 19

• Introduction
• Encryption -- symmetric and asymmetric
• Vulnerabilities
• Security and Cryptography
• Number theory
• Class Notes (to view this file, download MS Journal Viewer from Microsoft)

Class 2: Jan 24

• Trend in internet crime/hacking
• Vulnerabilities - viruses, spam, id theft, buffer overflow
• Trust and software, Ken Thompson lecture
• Class Notes

Class 3: Jan 26

• Coin tossing on Telephone (hashing)
• Cryptography Basics (encryption, XOR)
• Brute Force breaking
• Hashing, Random Numbers
• Cryptographic Functions (authentication, access control, signatures, certificates, secret sharing, zero knowledge proofs, secure elections, digital cash)
• Class Notes

Class 4: Jan 31

• RFID and weak challenge response in DST cards (see)
• DES brute force cracking
• Ceaser cipher, Affine Cipher, Vigenere Cipher
• KASISKI Attack
• Cryptananalysis (several approaches)
• Class Notes

Class 5: Feb 2:

• CIA Kryptos, and MS Word vulnerability
• Coin tossing with hash functions and the Birthday Attack vulnerability
• Privacy-Integrity-Authentication-Non Repudiation-Certification-Signatures
•  Identities, Message Authentication Codes, Challenge response (symmetric and public keys)
• Class Notes

Class 6: Feb 7

• Crypto protocols
• Attacks against protocols
• Merkles Puzzles
• Class Notes

Class 7: Feb 9

• Merkles Puzzles, cont.
• Diffie Helman Key exchange
• Hash functions (slides) (web site)
• Class Notes

Class 8: Feb 14

• Hash Functions
• Large number -- properties
• Random numbers
• CSPRNG - how to?
• Authentication (shared secret)
• Class Notes

Class 9: Feb 16

• Symmetric Encryption Algorithms
• Lucifer, DES, 3DES, IDEA, AES, Skipjack, Clipper
• Backdoor in Clipper
• The inside details of DES (P-boxes, S-boxes and all that)
• Class Notes

Class 10: Feb 21

• Authentication - public keys
• Messaging - public keys
• Key Exchange - symmetric keys
• Key Exchange - public Keys
• Integrating authenticationa nd message integrity - public and symmetric keys
• MITM attacks
• Class Notes

Class 11: Feb 23

• MITM Attacks
• Digital Signatures
• Digital Certificates
• Class Notes

Class 12: Feb 28

• Digital signatures and certificates
• SSL protocol
• How SSL works
• Specifications of SSL
• Class Notes

Class 13: Mar 2

• Project preliminaries (get a certificate from cacert.org or trustcenter.de and verify the correctness of the certificate).
• SSL
• Class Notes

Class 14: Mar 7

• Signatures and Certificatres
• Resend Attacks - various kinds
• Birthday Attack
• Hierarchical certificates (certificate chains)
• Quick 0verview of RSA
• Class Notes

Class 15: Mar 9

• RSA - why it works
• Class Notes

Mar 14 and Mar 16, no class (spring break)

Class 16: Mar 21

• Computing public and private keys from p and q (RSA)
• Prime Number Density
• Finding Prime numbers/Primality testing
• Fast Exponentiation
• Class Review
• Class Notes

_________________________

Mid Term Exam: Mar 23.

________________________

Class 17: Mar 28

• Multiple Key Cryptography (group communication)
• Private databases
• Computing private maxima
• Randomized Response Technique for surveys
• Secret splitting
• Secret sharing (threshold schemes)
• Intro to Zero Knowledge proofs
• Class Notes

Class 18: Mar 30

• Timestamping (with Trent, Linking Protocol, Distributed Protocol)
• Subliminal Channels
• Proxy Signatures
• Class Notes

Class 19: Apr 4

• Undeniable Signatures
• Group Signatures
• Mental Poker
• One way accumulator
•  Bit Commitment
• Class Notes

Class 20: Apr 6

• Fail Stop Signatures
• Secure Multiparty Computatations
• Computing with Encrypted Data
• Computing with Encrypted Functions
• Protecting programs against tampering
• Ensuring secure computing environments
  •  secure coprocessors
  • sandboxes, reverse sandboxes
  • DRM schemes
• Class Notes

Class 21: Apr 11

• project discussion
• additional project programs:
  • server.java
  • client.java
  • CertOperations.java
  • A ZIP file containing all the certificates
• RSA algorithm documentation @ bouncy-castle
• Sensor Networks (and project) by Smitha Satish

Class 22: Apr 13

• Tutorial on ZKP by Oded Goldrich
• Zero Knowledge Proofs
• ZKP of graph isomorphism (and discussion of P=NP)
• Feige Fiat Shamir proof of identity
• Parallel ZKP
• Non-Interactive ZKP
• Class Notes

Class 23: Apr 18

• Oblivious Transfer
• Simultaneous Contract Signing
• Digital Certified Mail
• ANDOS (all or nothing disclosure of secrets)
• Secure Elections (intro)
• Class Notes

Class 24: Apr 20

• For project: the CA certificate
• Secure Elections
• Digital Cash
• Class Notes

Class 25: Apr 25

• Slides: Security and Secure Group Communication by Dijiang Huang

Class 26: Apr 27

• Exam results
• Chaffing and Winnowing [paper]
• Payword and Micromint [slides] [paper]
• Class Notes

Class 27: May 2 (last class)

• **REVIEW CLASS**, come prepared to ask questions

Project Demos: May 10th and 11th [Schedule]

______________________

Final Exam: May 11, 4:40p-6:30p