Mathematical Sciences Department
Colloquium
Speaker: Shuhong Gao, Clemson University
Friday, April 28, 2023
11:00 am - 12:00 pm
Stratton Hall 203
Title: Groebner Bases and Polynomial Systems from Cryptography
Abstract: Solving polynomial systems is a fundamental problem in mathematics, sciences, and engineering, with broad practical applications. While it is generally NP-hard to solve, many polynomials encountered in practice can be solved efficiently. Significant research has been devoted to developing algorithms that are effective for medium-sized systems or those with specific structures. Groebner basis theory is a powerful tool that has been successful in solving large systems. In this talk, we will present recent advances in algorithms for computing Groebner bases and explore several polynomial systems from various cryptosystems, including both symmetric and asymmetric block and stream ciphers.