MATH221-10S1 (C)
Algebra and Cryptography
This is a first semester course worth 11 points.
Course Information
Cryptography (the construction and analysis of ciphers) has become of vital importance over the past years since it is the only practical way of keeping confidential information secret. It is based largely on modern algebraic ideas, as well as classical number theory. We will look at a number of cipher schemes, building up the algebra required to understand them. This will give you a good introduction to many areas of modern algebra. The course should be of particular interest to computer science students. This course is recommended for students intending to enrol in the Postgraduate Diploma in Security and Forensics, offered in the Department of Computer Science and Software Engineering.
Topics
Basic ideas of cryptography. Introductory number theory. Simple ciphers based on modular arithmetic. The RSA cipher and public key ciphers. Diffie Hellman key exchange. Groups. Cyclic groups and generators. Rings and fields. Boolean algebras. Polynomial rings. Constructing finite fields. Linear shift registers. One time pads and pseudo random number generators.
Class Representative
Text
J. Buchmann, Introduction to Cryptography, Springer-Verlag, 2nd edition.
Enquiries
Dr Peter Renaud
Room 503 Erskine Building
Phone Extension 7685