Multivariate Cryptography and Polynomial System Solving Complexity
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore multivariate cryptography and the complexity of polynomial system solving in this 47-minute seminar from the Society for Industrial and Applied Mathematics. Delve into the security of multivariate cryptographic primitives, focusing on the challenges of computing solutions for multivariate polynomial systems over finite fields. Learn about Gröbner bases computations and their impact on cryptographic security. Examine linear-algebra-based methods for computing Gröbner bases, considered the most efficient algorithms available. Investigate key invariants controlling complexity and explore the difficulty of solving "random" polynomial systems. Gain insights into post-quantum cryptography, the multivariate quadratic problem, and practical applications such as the MinRank problem and the ABC cryptosystem.