The basics of cryptography, with emphasis on attaining well-defined and practical notations of security. Symmetric and public key cryptosystems; one-way and trapdoor functions; mechanisms for data integrity; digital signatures; key management; applications to the design of cryptographic systems. In addition to written homework, assessment will involve application programming; additional mathematical theory and proof-oriented exercises will be available for extra credit.
This course may not be repeated for credit.
Notes
- Students who have credit for Computer Science 319 instead of Computer Science 331 should contact the department for instructions on how to enrol in this course.
Prerequisite(s)
- Computer Science 331 and 3 units from Computer Science 351, Mathematics 271, 273, 315 or Pure Mathematics 315.
Antirequisite(s)
- Credit for Computer Science 418 and any of Computer Science 429, 557, Mathematics 318, Pure Mathematics 329 or 418 will not be allowed.
Sections
| LEC 1 | MWF 15:00 - 15:50
| | Renate Scheidler | | |
| TUT 1 | M 14:00 - 14:50 W 18:00 - 18:50
| | | | |
| Notes: Wednesday nights tutorial at 18:00 is held in ST 135 |
| TUT 2 | W 18:00 - 18:50 W 14:00 - 14:50
| | | | |
| Notes: Wednesday nights tutorial at 18:00 is held in ST 135 |
| TUT 3 | W 18:00 - 18:50 F 14:00 - 14:50
| | | | |
| Notes: Wednesday nights tutorial at 18:00 is held in ST 135 |
| TUT 4 | W 18:00 - 18:50 M 16:00 - 16:50
| | | | |
| Notes: Wednesday nights tutorial at 18:00 is held in ST 135 |
| TUT 5 | W 18:00 - 18:50 M 17:00 - 17:50
| | | | |
| Notes: Wednesday nights tutorial at 18:00 is held in ST 135 |