Fast Enumeration Algorithm for Multivariate Polynomials Over General Finite Fields - Session II
Offered By: QuICS via YouTube
Course Description
Overview
Explore a conference talk from PQCrypto 2023, the 14th International Conference on Post-Quantum Cryptography, focusing on theoretical aspects of cryptography. Delve into Hiroki Furue and Tsuyoshi Takagi's presentation on "Fast Enumeration Algorithm For Multivariate Polynomials Over General Finite Fields." Learn about advanced techniques in post-quantum cryptography and their implications for secure communication in a quantum computing era. Gain insights into the latest developments in multivariate polynomial algorithms and their applications in cryptographic systems. This 22-minute session, part of the conference's Theory track, offers a concise yet comprehensive look at cutting-edge research in the field of post-quantum cryptography.
Syllabus
PQCrypto 2023: Session II: Fast Enumeration Algorithm For Multivariate Polynomials (Hiroki Furue)
Taught by
QuICS
Related Courses
Introduction to Algebraic Geometry and Commutative AlgebraIndian Institute of Science Bangalore via Swayam Introduction to Algebraic Geometry and Commutative Algebra
NPTEL via YouTube Basic Algebraic Geometry - Varieties, Morphisms, Local Rings, Function Fields and Nonsingularity
NPTEL via YouTube Basic Algebraic Geometry
NIOS via YouTube Affine and Projective Geometry, and the Problem of Lines
Insights into Mathematics via YouTube