25.10.2017 um 17:15 Uhr in Raum 69/125
Elisa Gorla (Université de Neuchâtel)
Groebner Bases and their Applications to Cryptography
Groebner bases are a fundamental tool for computing with polynomial equations. In this talk I will introduce Groebner bases and discuss how they allow us to solve systems of polynomial equations. I will then discuss some applications of polynomial system solving to cryptography. Being able to efficiently solve a system of polynomial equations over a finite field allows us to crack certain cryptosystems. Therefore, one of the key questions in assessing the robustness of our cryptosystem is estimating how long it takes to compute the Groebner basis of a given system of polynomial equations.