MATH3925 Public Key Cryptography Public Key Cryptography (PKC) enables two parties to communicate securely over a public communications network, without them having first to exchange a secret key. PKC provides secure communications over the Internet, over mobile phone networks and in many other situations. This course draws on ideas from algebra, number theory and algebraic geometry to provide the student with a thorough grounding in the mathematical basis of the most popular PKCs. Specifically, the unit treats PKCs based on the difficulty of integer factorisation (RSA), the discrete logarithm problem in a finite field (Diffie-Hellman, DSA, ElGamal) and the discrete logarithm problem in the group of rational points of an elliptic curve over a finite field (EC-ElGamal). Attacks on these cryptosystems will be treated in some depth, as a means of understanding the mathematical primitives on which they are based.
	Tutorial exercises and solutions Week Tutorials Solutions Week Tutorials Solutions 1 Exercises & Solutions 8 Exercises & Solutions 2 Exercises & Solutions 9 Exercises & Solutions 3 Exercises & Solutions 10 Exercises & Solutions 5 Exercises & Solutions 11 Exercises & Solutions 6 Exercises & Solutions 12 Exercises & Solutions 7 Exercises & Solutions 13 Exercises & Solutions
	Assignments There will be three assignments, each worth 10 percent of the total mark. The Magma FAQ page responds to student questions on the use of Magma relevant to the assignment. Assignment 1 (sample file only) was due Monday 6 September [Solutions]. Assignment 2 was due Friday 24 September [Solutions]. Assignment 3 (sample file only) was due Wednesday 3 November [Solutions]. Assignment 1 and 3 have individual versions of the form f3lastna.pdf; replace s3sample.pdf with your login of the former form. N.B. The x-coordinate m mod 2^32 encodes some data, but it may be necessary to subtract 2^36 mod p (i.e. (m-(2^36 mod p)) mod 2^32).
	Exam Review Tutorial 13 gives a variety of sample questions covering many of the main topics of the semeser. The tutorial sheets and assignments also provide a good resource for revision. An Exam Review Session will be held 11-12AM Friday 5 November, in Carslaw 373. The exam will be held on Wednesday 10 November at 3:00-5:10PM in 830 Carslaw.
	Magma computational algebra system Tutorial exercises will emphasize both hand computations and computer exercises in Magma. The Introduction to Magma for Cryptography provides a brief overview to the syntax and concepts in Magma. The student version of Magma can be downloaded for home use.