Optional, free |
CNIT 141: Cryptography for Computer NetworksSpring 2025 Sam BowneSchedule · Lectures · Projects · Links · Home Page
|
Required, $34 Optional, free |
||
Course JustificationIndividuals, companies, and governments all have private data on their computer systems that must be protected. However, the encryption techniques required to protect them are difficult to apply, and often fail in practice. There is a serious shortage of information technology professionals who are qualified to install, repair, and maintain cryptographic security measures. This class helps students prepare to meet those needs. Catalog DescriptionMathematical underpinnings and practical applications of modern cryptographic systems, including the Advanced Encryption Standard (AES), the Secure Hash Algorithms (SHA), and Rivest-Shamir-Adleman (RSA). The class focuses on practical applications: selecting, implementing, testing, and maintaining systems to protect data on modern computer networks. Student Learning OutcomesUpon successful completion of this course, the student will be able to: Textbooks"Serious Cryptography: A Practical Introduction to Modern Encryption", by Jean-Philippe Aumasson, No Starch Press (November 6, 2017), ISBN-10: 1593278268 ISBN-13: 978-1593278267 QuizzesThe quizzes are multiple-choice, online, and open-book. However, you may not ask other people to help you during the quizzes. You will need to study the textbook chapter before the lecture covering it, and take the quiz before that class. Each quiz is due 30 min. before class. Each quiz has 5 questions, you have ten minutes to take it, and you can make two attempts. If you take the quiz twice, the higher score counts. Discussion BoardEach CCSF student must contribute to the Discussion Board in Canvas. There are dates listed in the schedule with Discussion assignment due. |
Schedule (may be revised) | |||||
---|---|---|---|---|---|
Date | Quiz & Proj Due | Topic | |||
Wed 1-15 | 1. Encryption Demos: C 101, 102, 103 | ||||
Wed 1-22 | Quiz Ch 1 & 2 * Proj C 101 due * Discussion 1 due * | 2. Randomness Demo: C 105 | |||
Fri 9-2 | Last Day to Add Classes | ||||
Wed 1-29 | Holiday: No Class | ||||
Wed 2-5 | Quiz Ch 3 * Proj C 102 & C 103 due * Discussion 2 due * | 3. Cryptographic Security Demo: C 106 | |||
Wed 2-12 | Quiz Ch 4 Proj C 105 due Discussion 3 due | 4. Block Ciphers Demos: C 201, C 202 | |||
Wed 2-19 | Quiz Ch 5 Proj C 106 due Discussion 4 due | 5. Stream Ciphers Demo: C 501 | |||
Wed 2-26 | Quiz Ch 6 Proj C 201 due Discussion 5 due | 6. Hash Functions Demo: C 202 | |||
Wed 3-5 | Quiz Ch 7 Proj C 202 due Discussion 6 due | 7. Keyed Hashing Demo: C 401 | |||
Wed 3-12 | Quiz Ch 8 Proj C 401 due Discussion 7 due | 8. Authenticated Encryption Demo: C 402 | |||
Wed 3-19 | Quiz Ch 9 Proj C 402 due Discussion 8 due | 9. Hard Problems | |||
Wed 3-26 | Quiz Ch 10 No Proj due Discussion 9 due | 10. RSA Demo: C 403 | |||
Wed 4-2 | Holiday: No Class | ||||
Wed 4-9 | No Quiz Proj C 403 due |
Quantum Computing Demos: C 510, C 502 | |||
Wed 4-16 | Quiz Ch 11 Proj C 501 & 502 due Discussion 10 due |
| |||
Wed 4-23 | Quiz Ch 12 Proj C 503 due | 12. Elliptic Curves Demo: C 800 | |||
Wed 4-30 | Quiz Ch 13 Proj C 504 due | 13. TLS | |||
Wed 5-7 | No Quiz All Extra Credit Proj due | Last class: No New Material | |||
Wed 5-14 through Wed 5-21 | Final Exam available online throughout the week. You can only take it once. | ||||
All quizzes due 30 min. before class * No late penalty until 9-14 |
Lecture Slides | |
---|---|
Grading Policy
Bitcoin and Blockchains
· Keynote
· PDF
Beyond the doomsday economics of
2. Randomness
· Keynote
· PDF
|