* Multivariate cryptography and the complexity of polynomial
system solving, John Conway Spirited Mathematics Seminar
Series, LUMS (Pakistan), September 2021, the video may be
found here
* Multivariate
cryptography and the complexity of polynomial system
solving,
Seminar on Applied Geometry and Algebra (SIAM SAGA), September
2021
* Complexity of Grobner bases computations and applications
to cryptography, Journées Nationales de Calcul Formel, CIRM,
Luminy (France), March 2021
day 1 and day
2
* Ideals with a radical generic initial ideal, Fellowship of the Ring - A worldwide commutative algebra seminar, hosted by MSRI (CA, USA), February 2021
* Blowup
algebras of sparse determinantal varieties, UMN
Combinatorics & Commutative Algebra Seminar (MN, USA),
December 2020
* Multivariate cryptography and the complexity of solving random polynomial systems, International Workshop on the Arithmetic of Finite Fields - WAIFI 2020, held virtually in Rennes (France), July 2020
* Lecture
series at Clemson University (SC, USA), Oct. 2018:
* Multivariate
cryptography and Groebner bases
* Rank-metric
codes and q-polymatroids
* Universal
Groebner bases and Cartwright-Sturmfels ideals
* Rank distribution of Delsarte codes, Mathematical Coding Theory in Multimedia Streaming, Banff International Research Station, Banff (Canada), Oct. 2015
* Computational challenges arising in torus-based cryptography, Workshop on Computational Challenges Arising in Algorithmic Number Theory and Cryptography, Fields Institute, Toronto (Canada), Nov. 2006