|Date||Oct 08, 2015|
|Dept.||University of Cincinnati|
09:30 – 11:00 Lecture 1: Basic designs of MPKC
11:00 – 11:30 Q&A
11:30 – 12:30 Lunch
12:30 – 14:00 Lecture 2: Fundamental attacks
14:00 - 14:30 Q&A
Multivariate public key cryptosystems (MPKCs), whose public key is mostly a set of quadratic polynomials over a finite field, are one of the four main families of public key cryptosystems that have the potential to resist future quantum computer attacks. This construction is based on the fact that solving a random multivariate polynomial system over a finite field is an NP-complete problem.
There will be two lectures, where we will present the main constructions of MPKCs in the first lecture and the main security analysis tools, in particular, algebraic attacks using polynomial solving algorithms, in the second lecture. We will also present a discussion on major challenges in the in the area of MPKCs.