Unlocking the Future of Security: Multivariate Public Key Cryptography Explained 🔐
Join Zhijun Yin from Florida Atlantic University as he delves into the transformative potential of Multivariate Public Key Cryptography (MPKC) and its impact on digital security. Discover how this innovative approach is shaping the future of cryptography.

FAU Charles E. Schmidt College of Science
65 views • Sep 29, 2023

About this video
Speaker: Yin, Zhijun, Instructor, Florida Atlantic University
Title: Exploring the Power of Multivariate Public Key Cryptography (MPKC)
Abstract: Multivariate Public Key Cryptography (MPKC) leverages multivariate quadratic polynomial mappings over finite fields as the foundation for its trapdoor one-way functions. This innovative approach offers remarkable efficiency in both encryption and decryption processes, making it a compelling choice for secure communications.
In contrast to traditional cryptographic methods, attacking MPKC involves solving a system of nonlinear equations over the finite field, a significantly more complex challenge than NP-hard problems like Boolean satisfiability, which is equivalent to solving equations over the finite field GF(2).
In this presentation, we will delve into MPKC through a simplified example featuring three variables within the finite field of GF(2). This illustrative toy example will demystify key concepts such as public and secret keys, encryption, decryption, and cryptanalysis. Join us as we unravel the intriguing world of MPKC and its potential impact on modern cryptography.
Title: Exploring the Power of Multivariate Public Key Cryptography (MPKC)
Abstract: Multivariate Public Key Cryptography (MPKC) leverages multivariate quadratic polynomial mappings over finite fields as the foundation for its trapdoor one-way functions. This innovative approach offers remarkable efficiency in both encryption and decryption processes, making it a compelling choice for secure communications.
In contrast to traditional cryptographic methods, attacking MPKC involves solving a system of nonlinear equations over the finite field, a significantly more complex challenge than NP-hard problems like Boolean satisfiability, which is equivalent to solving equations over the finite field GF(2).
In this presentation, we will delve into MPKC through a simplified example featuring three variables within the finite field of GF(2). This illustrative toy example will demystify key concepts such as public and secret keys, encryption, decryption, and cryptanalysis. Join us as we unravel the intriguing world of MPKC and its potential impact on modern cryptography.
Video Information
Views
65
Duration
48:41
Published
Sep 29, 2023
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now