![]() |
Math 116: General Course Outline |
|||||||||||||||||||||||||||||||||
Catalog Description
116. Mathematical Cryptology.
(4) Lecture, three hours; discussion, one hour. Requisite: course 115A.
Not open for credit to students with credit for Program in Computing 130. Introduction
to mathematical cryptology using methods of number theory, algebra, probability.
Topics include symmetric and public-key cryptosystems, one-way functions, signatures,
key exchange, groups, primes, pseudoprimes, primality tests, quadratic reciprocity,
factoring, rho method, RSA, discrete logs. P/NP or letter grading.
|
|||||||||||||||||||||||||||||||||
Textbook
Trappe, Intro to Cryptography with Coding Theory, Prentice Hall.
|
|||||||||||||||||||||||||||||||||
Reviews & Exams
The course is planned for 28 lectures,
1 midterm exam, and 1 holiday.
|
|||||||||||||||||||||||||||||||||
Schedule of Lectures
|
|||||||||||||||||||||||||||||||||
Comments
Outline update: D. Blasius, 2/02 NOTE: While this outline includes only one midterm, it is strongly recommended that the instructor considers giving two. It is difficult to schedule a second midterm late in the quarter if it was not announced at the beginning of the course. |
|||||||||||||||||||||||||||||||||
For more information, please contact
Student Services, ugrad@math.ucla.edu. |
|||||||||||||||||||||||||||||||||