Talk
Modul: MAT076 Arbeitsgemeinschaft in Codierungstheorie und Kryptographie
eSeminar: From Minrank Attack to generic Bilinear
Talk by Prof. Dr. Daniel Cabarcas Jaramillo
Date: 03.06.20 Time: 16.00 - 17.00 Room:
(**This eSeminar will take place on Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact karan.khathuria@math.uzh.ch **)
The Minrank (MR) problem is a computational problem closely related to attacks on code- and multivariate-based schemes. MR can be reduced to a bilinear system of polynomial equations. In the quest to better estimate the complexity of this approach, we developed a more general theory for generic bilinear systems. In this presentation, we show some of the latest results for the complexity of MR and then, we present some general results about bilinear systems.