This talk was about some extensions of recent results on the complexity of computing Gröbner bases of comaximal determinantal systems and the implications of these results for some multivariate post-quantum cryptography schemes.

This talk was about the joint work in ‘Refined $F_5$ algorithms for ideals of minors of square matrices.’

This talk was about applications of my work to the analysis of multivariate post-quantum cryptography schemes which rely on the hardness of the MinRank problem.

This talk was about some recent work on computing Gröbner bases of determinantal ideals of square matrices.