Document Actions
20 CS 736: Computer Security II
Syllabus:
Learning Objectives:
| Course Number | 20 CS 736 |
| Credit Hours | 3 Graduate |
| Prerequisites |
20 CS 735 |
| Catalog Data | Conventional and public key cryptography. Elementary theory of numbers. Digital signatures. Voting schemes. Provably secure cryptosystems based on computationally hard problems. Multiparty protocols and zero-knowledge proofs. Multiprescision arithmetic using Prof. D. Schmidt?s implementation of the Arbint class in C++. Cryptology: The analysis and cracking of cryptosystems and protocols. Some famous, some infamous and some not so well known examples of cracked systems and protocols. Quantum computers that crack uncrackable codes. Quantum cryptography: using quantum mechanics to guarantee secrecy. |
| Textbooks |
Class Notes |
| References | 1. D.R. Stinson, Cryptography Theory and Practice, CRC Press. 2. B. Schneier, Applied Cryptography, John Wiley |
| Prerequisites by Topic | Graduate standing in the Dept. of ECE. |
| Goals | The course will cover the theoretical background of cryptography and its relation to mathematics and computer science. |
| Topics | To Be Announced. |
| Computer Usage | None |
| Labs | None |
| Estimated ABET | Engineering Science: 3 credits or 100% |
| Prepared By | George Purdy, Ph.D. on 2002/09/01 |
UC's PlanetLab Contribution Upgraded Thanks to Major Equipment Donation from HP