CS463 Cryptography and Data Security

Course Description

Specialized study of cryptography and its application in securing data systems, with an emphasis on applied cryptography. Major topics include history of cryptography (such as the Ceaser and Vigenère ciphers) and cryptanalysis (such as frequency analysis or man in the middle attack), and the big three classes of work: symmetric ciphers, asymmetric ciphers, and hashing algorithms. Secret-key symmetric encryption schemes covered include RC5 or AES, private and public key asymmetric cryptography systems include RSA and the signature algorithms DSA and ECDSA, cryptographic hashes include MD5 and SHA-256. We will see how these are used for message authentication, key distribution and management, digital currencies, and cryptographically securing network protocols. The discrete math prerequisite, Math 307, is needed because cryptographic systems typically operate on large integer values, and a robust mathematical background is required to follow the proofs of why the systems work. No background in group theory is required, but we will cover work in prime fields such as RSA encryption, and elliptic curve theory and practice. The programming prerequisite, CS 311, is needed because we will be examining these systems by writing real code for real machines. Any programming language is acceptable, although most examples will be in C++ or Python.

Tentative Schedule

1. Fri, Jan 16

   Data Security and Keeping Secrets

2. Mon, Jan 19

   Alaska Civil Rights Day (no classes, most offices closed)

3. Wed, Jan 21

   RC5: Rivest Cipher 5

4. Fri, Jan 23

   Histograms, probability & statistics

5. Mon, Jan 26

   Measuring Entropy: Information Theory

6. Wed, Jan 28

   Random number generation in theory & practice

7. Fri, Jan 30

   Feistel Structured Ciphers and the Data Encryption Standard (DES) of 1977 (Last day to pay or drop)

8. Mon, Feb 02

   Secure Hash Algorithm SHA-256

9. Wed, Feb 04

   How To Hash Passwords (de-identification)

10. Fri, Feb 06

    Practical uses for Cryptographic Hashing & Merkle Trees

11. Mon, Feb 09

    Math: Galois fields of prime order

12. Wed, Feb 11

    Exchanging Secret Keys with Diffie-Hellman

13. Fri, Feb 13

    Fast Binary Multiplication/Exponentiation Algorithm

14. Sun, Feb 15

    Deadline to apply for spring 2015 graduation

15. Mon, Feb 16

    Math: (extended) Euclidean Algorithm and prime field inverses

16. Wed, Feb 18

    Public Key Encryption: RSA

17. Fri, Feb 20

    Known Flaws in RSA, and How to Fix Them

18. Mon, Feb 23

    Digital signature algorithm: DSA

19. Wed, Feb 25

    HTTPS Certificate Formats & Key Signing Requests

20. Fri, Feb 27

    Certificate Generation & Checking with OpenSSL

21. Mon, Mar 02

    A step backward: crypto in real life

22. Wed, Mar 04

    Physical Security: Locks, Armor, and Thermite

23. Fri, Mar 06

    Midterm exam due

24. Mon, Mar 09

    Project 1 presentations

25. Wed, Mar 11

    Project 1 presentations

26. Fri, Mar 13

    Project 1 presentations (Last day to Withdraw)

27. Mon, Mar 16

    Spring break (no classes this week)

28. Mon, Mar 23

    Groups, Binary Galois Fields, and AES

29. Wed, Mar 25

    AES in practice: tables

30. Fri, Mar 27

    AES side-channel attacks and countermeasures

31. Mon, Mar 30

    Elliptic Curve Cryptography: Curve Points and Generators

32. Wed, Apr 01

    Elliptic Curve Diffie-Hellman-Merkle key exchange

33. Fri, Apr 03

    Elliptic Curve Digital Signature Algorithm

34. Mon, Apr 06

    Cryptocurrency theory: technology meets morality

35. Wed, Apr 08

    ECDSA and BitCoin addresses

36. Fri, Apr 10

    Alternative cryptocurrencies & the battle for miners

37. Mon, Apr 13

    Steganography: the side-channel strikes back

38. Wed, Apr 15

    Whole-Disk Encryption

39. Fri, Apr 17

    Holomorphic encryption: computing in ciphertext

40. Mon, Apr 20

    High-performance crypto: SIMD, Multicore, and GPU

41. Wed, Apr 22

    Futureproofing crypto: quantum computers

42. Fri, Apr 24

    SpringFest (no classes)

43. Mon, Apr 27

    Project 2 presentations

44. Wed, Apr 29

    Project 2 presentations

45. Fri, May 01

    Project 2 presentations

46. Mon, May 04

    Course review (Last regular class)

47. Thu, May 07

    Final exam, 3:15-5:15pm

Grading Policies

Grades will be assigned based on the following percentage intervals:

A+

[99%, 100%)

A

[93%, 99%)

A-

[90%, 93%)

B+

[87%, 90%)

B

[83%, 87%)

B-

[80%, 83%)

C+

[77%, 80%)

C

[73%, 77%)

C-

[70%, 73%)

D+

[67%, 70%)

D

[63%, 67%)

D-

[60%, 63%)

F

[0%, 60%)

Late Work Policy

Late work will not be graded, unless it is due to circumstances beyond your control, or if you turn it in before I begin grading.  I may begin grading at any time after the due date, even 12:01am the next day (grading is an effective treatment for insomnia!).  You are encouraged to inquire if I have begun grading yet, since this acts as a reminder for me to do so.

Policies

Students are expected to be at every class meeting on time, and are responsible for all class content, whether present or not. If absence from class is necessary, in-class work (other than quizzes) and homework may be made up only if the instructor is notified as soon as possible; in particular, absences due to scheduled events must be arranged ahead of time. Academic dishonesty will not be tolerated, and will be dealt with according to UAF procedures. Students in this class must pay the CS lab fee.

UAF academic policies http://www.uaf.edu/catalog/current/academics

CS Department policies http://www.cs.uaf.edu/departmental-policies/

Disabilities Services:

The UAF Office of Disability Services implements the Americans with Disabilities Act (ADA), and ensures that UAF students have equal access to the campus and course materials. I will work with the UAF Office of Disability Services (208 WHITAKER BLDG, 474-5655) to provide reasonable accommodation to students with disabilities.