Inverting HFE Systems Is Quasi-Polynomial for All Fields

Explore a cryptographic talk from CRYPTO 2011 that delves into the quasi-polynomial nature of inverting HFE systems across all fields. Learn about the groundbreaking work by Jintai Ding and Timothy Hodges as they present their findings on this complex topic. Gain insights into the introduction, basics, implementation, and the attack strategy. Understand key concepts such as degree of regularity, bounded degree of regularity, and global upper bounds. Follow the approach, rank results, and consider future work in this field. Conclude with a question-and-answer session to deepen your understanding of this cryptographic research.