Mon, Sep 20 2021 to Mon, Sep 20 2021
The security of multivariate cryptographic primitives relies on the hardness of computing the solutions of multivariate polynomial systems over finite fields. Since we can compute the solutions of a polynomial system from its Groebner basis, bounds on the complexity of Groebner bases computations provide bounds on the security of the corresponding multivariate cryptographic primitives. After introducing multivariate cryptography, the discussion will move to the introduction of Groebner bases, and how they can be computed. There will also be an introduction to some invariants which are used to estimate the complexity of computing a Groebner basis.
Date: September 20, 2021
Time: 4:00 pm (PKT)
Meeting ID: 973 7985 5766