Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Fast Enumeration Algorithm for Multivariate Polynomials Over General Finite Fields - Session II

QuICS via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Reviews

Start your review of Fast Enumeration Algorithm for Multivariate Polynomials Over General Finite Fields - Session II

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.