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 and is not applicable to online students.

 1. Jan 21

• Introduction to the class -- topics to be covered 
• Cryptography vs. applied cryptography
• relationship to number theory (for proof of infinite possibilities of prime numbers -- see http://www.utm.edu/research/primes/notes/proofs/infinite/euclids.html)
• vulnerabilities in complex system, e.g. telephone systems
• "shared secret" authentication
• "public key" cryptosystems
• open algorithms vs. proprietary algorithms

 2. Jan 26

• Security problems -- without cryptographic solutions
• Hacking, breaking into computers, using SPAM
• Uses of computer compromises - to send more spam, to launch DDOS attacks, to steal identities
• Vulnerabilities -- buffer overflow, trojans, downloaded code
• The details of Buffer Overflow
• The Ken Thompson lecture (cannot trust software).

 3. Jan 28

• All students should be able to access the discussion board on my.asu.edu 
• Cryptography -- history
• Tools, applications, protocols
• Encryption - symmetric/asymmetric
• Substitution ciphers (ceasear, affine, vignere)
• Breaking simple ciphers -- statistics, letter frequency, kasiski attack
• Brute force breaking of ciphers

 4. Feb 2

• Issues in Information Security (Privacy, Integrity, Authentication, Non repudiation, Access Control, Availability, Timestamping, Certification, Signatures)
• Cryptographic Protocols - arbitrated/adjudicated/self enforcing)
• Attacks on Protocols -- Passive Attacks (brute force, algebraic), Active Attacks (Modification, Man in the middle, Dictionary, Masquerade, Replay, Denial of Service)

 5. Feb 4

• The Unix Password (Crypt) protocol and the dictionary attack (salt)
• Functions for cryptography (one way, one way trapdoor)
• Symmetric encryption (DES, 3DES, IDEA, Clipper)

 6. Feb 9

• Steganography
• One way (cryptographic) hash functions
• The Birthday attack
• CSPRNG -- Cryptographically Secure Pseudo Random Number Generator

 7. Feb 11

• Random Numbers (Statistical Tests and Next Bit Test)
• Random numbers from Crypto functions
• Cryptanalysis -- approaches, techniques
• Cryptographic protocols
• Secure Communications - Key Exchange
• Merkles Puzzles

 8. Feb 16

• Secure Communications - symmetric keys, public keys
• Diffie Helman key exchange
  Note: The discussion on the complexity of Diffie Helman stated in class is WRONG. I will fix it next class.
• Public Key communications
• Man in the Middle Attacks
• Interlock Protocol
• Key Exchange with Public Keys
• Hybrid cryptosystems
• Digital certificates (not explained)

 9. Feb 18

• Diffie Hellmann revisited and previous errors corrected
• Primitive Root (generator)
• Brute force Complexity is exponential in number of bits (but it looks linear, as it is order N, where N is the prime number used as the modulo)
• Authentication -- shared secret challenge response, SKEY, public key challenge response.
• The resend attack -- do not encrypt anything that is given to you.
• Digital signatures (introduction)

 10. Feb 23

• Digital Signatures -- properties and how they are achieved
• Hash based signatures, Birthday Attacks
• Digital Checks (same risks as normal checks)
• Digital Certificates (intro)

 11. Feb 25

• Digital Certificates
• Certificate Authorities
• Hierarchical Certificate Authorities
• Practical implications
• Offline verification
• Digital "Credit Cards"

 12. March 1

• Digital Certificates -- offline verification vs. revocation
• Secure Sockets Layer
• Authentication in SSL
• Key exchange in SSL

 13. March 3

• Secure Messaging in SSL
• The DES encryption system

14. March 8

• Introduction to RSA
• Choosing p, q, computing a and b.
• Encryption and Decryption for RSA
• Number theory -- sets, closure -- preliminaries to proving RSA

15. March 10

• The proof of RSA
• Generating private and public keys (computing a and b)
• Fast exponentiation
• Testing numbers for primality

No class on March 15 and March 17 due to Spring Break.

16. March 22

• Homework discussions
• Recap for Exam
• Number of bits RSA should have
• Key Management

--. March 24

• No class - exam in class (for campus students)

17. March 29

• Multiple Key Cryptography (group communication)
• Dining Cryptographers problem
• Secret Splitting
• Secret Sharing
• Class Slides (you need Microsoft Journal Viewer to see the file)

18. March 31

• Timestamping (with Cryptography)
  • Linked Protocol
  • Distributed Protocol
• Hashing databases
• Subliminal Channels
• class slides

19. April 5

• Reading assignment: Variants of Secret Sharing (page 72, text book)
• Proxy Signatures - certificates
• Group signatures (with Trent)
• Fail Stop signatures
• Undeniable signatures
• Computing with encrypted data
• class slides

20. April 7

• Secret sharing revisited, with example
• Zero knowledge proofs
• Ali Baba's cave
• Cut and choose
• Blind signatures (blinding in RSA signatures)
• Cut and choose -- anonymous money orders
• class notes

21. April 12

• Zero Knowledge Proof of Graph Isomorphism
• Zero Knowledge Proof of Identity: Feige-Fiat-Shamir
• Parallel Zero Knowledge Proofs
• Intro to Non-Interactive Proofs
• Class Notes

22. April 14

• Non Interactive ZKP
• Bit Commitment
• Mental Poker
• Secure Multiparty Computation
• Secure Elections
• class notes

23. April 19

• Secure Elections (using Blind Signatures)
• Passing mention of ANDOS
• Digital Cash, the double spending prevention protocol.
• Class Notes

24. April 21

• Malware, by Prashant Dewan

25. April 26

• Detour from Digital Cash - to be covered later
• Oblivious Transfer
• Simultaneous Contract Signing
• Chaffing and Winnowing (Ronald Rivest)
• Class Notes

26. April 28

• Homework #3 assigned
• Simultaneous Contract Signing Revisited
• Digital Cash Revisited
• Payword and Micromint (Ronald Rivest)
• Class Notes

27. May 3

• Last Class, Recap/Review of the material covered this semester.