Каталог

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

    QuICS0.0
    22 minutes
    English
    0/1 уроков (0%)
    – из 1

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

    YouTube·Post-Quantum Cryptography

    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.

    FreeCourses

    Бесплатные курсы университетов и независимых авторов.

    Каталог на основе данных Class Central. © 2026 Free Courses