Multivariate Cryptography and MinRank Attacks
Linear Algebra seminar by Ryann Cartor, Clemson University
Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Tuesday 10:45 New York (GMT-4)
Recording available
Providence, RI, USA · In person
Abstract
Ryann Cartor introduces multivariate public-key cryptography, whose fast and compact post-quantum schemes use polynomial systems over finite fields. The tutorial surveys past and current multivariate cryptosystems before examining MinRank as a central cryptanalytic problem. MinRank attacks have broken prominent schemes in both multivariate and code-based cryptography. The material assumes basic algebra and connects these foundations to current research directions.
Topics
MinRankmultivariate cryptographypost-quantum cryptography