The complexity of solving a system of equations of the same degree
The episode discusses "The complexity of solving a system of equations of the same degree," a paper by Gaggero and Gorla. The hosts explain how this work provides proven upper bounds on the difficulty (degree of regularity) of solving such systems, improving upon unreliable cryptographic heuristics for multivariate cryptography.