Post-quantum Cryptography - Multivariate Public Key Cryptosystems
|Affiliation:||University of Cincinnati|
|Room:||Mathematics and Computer Building (MC) 5158|
Public key cryptosystems are an indispensable part of the foundation of our modern communication system. The systems in practical applications are RSA, DSA, ECDSA and similar cryptosystems. Their security depends on assumptions about the hardness of certain number theoretic problems such as the Integer Prime Factorization Problem or the Discrete Logarithm Problem. The work of Peter Shor showed that quantum computers can render all such systems insecure. There is a clear demand to look ahead to a possible future of quantum computers.
Multivariate public key cryptosystems (MPKCs) are systems whose public key is a set of quadratic polynomials. MPKCs are one of the main families of public key cryptosystems that have the potential to resist future quantum computer attacks -- post-quantum cryptosystems. In this talk, we will present an overview of the developments in MPKCs and the main challenges.
200 University Avenue West
Waterloo, ON N2L 3G1