Multivariate Cryptography and the Complexity of Polynomial Systems Solving
Prof. Elisa Gorla will be our next guest in the "John Conway Spirited Mathematics Seminar Series" where she will be giving a presentation on "Multivariate Cryptography and the Complexity of Polynomial Systems Solving" on Monday, September 20, 2021 at 4:00 PM - 5:00 PM. She will talk about multivariate cryptography, introduce Groebner bases and discuss how to compute them. She will also introduce some invariants, which are used to estimate the complexity of computing a Groebner basis.
About the speaker:
Elisa Gorla is a well-known expert of "Non-Linear Algebras". She did her PhD from University of Notre Dame, IN (USA), in 2004. During her professional career, she got affiliated with Max Planck Institut fuer Mathematik - Bonn (Germany), Fields Institute, Toronto (Canada), University of Zuerich (Switzerland) under various role. Currently, she is working as a Professor of Mathematics at the University of Neuchatel, Switzerland. She is an Associate Editor in the SIAM Journal of Applied Algebra and Geometry. During the period 2013-2019 she was a member of the management team of CIMPA (International Centre for Pure and Applied Mathematics), a non-profit international organization whose aim is promoting international cooperation in higher education and research in mathematics for the benefit of developing countries.
Please join us virtually via zoom:
Zoom Meeting link: https://zoom.us/j/97379855766
Meeting ID: 973 7985 5766; Passcode: 146928