Modul:   MAT076  Neuchatel - St.Gallen - Zurich Seminar in Coding Theory and Cryptography

The MinRank Problem: Computational Aspects and Applications to Cryptanalysis

Talk by Prof. Dr. Daniel Cabarcas Jaramillo

Date: 08.03.23  Time: 15.00 - 16.00  Room:

The MinRank problem is the computational problem of finding a low rank linear combination of a set of matrices. There are several cryptographic attacks that can be reduced to MinRank. In this talk I will discuss recent developments in this field. I will focus mainly on the support minors approach to solve the problem, its complexity analysis and its implications to the security of some cryptosystems.

(**This eSeminar will take place over Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact zita.fiquelideabreu@math.uzh.ch **)