Testing if g is a Primitive Root of Prime p

✨ Please consider supporting my channel! ✨ Every bit helps—whether it’s $15, $10, or even $5. You can make a donation via this site: https://www.patreon.com/sunnyclassroom A primitive root is an important concept used in both Diffie Hellman Key Exchange (DHKE) and the ElGamal encryption algorithm. Today I will demonstrate how to test if a number g is a valid primitive root of p where p is a prime number. Playlists: Basic Cryptography https://www.youtube.com/watch?v=vk3py9M2IfE&list=PLSNNzog5eyduN6o4e6AKFHekbH5-37BdV Advanced Cryptography: https://www.youtube.com/watch?v=TmA2QWSLSPg&list=PLSNNzog5eydtwsdT__t5WtRgvpfMzpTc7 Public Key Infrastructure https://www.youtube.com/watch?v=UbMlPIgzTxc&list=PLSNNzog5eyduzyJ8_6Je-tYOgMHvo344c Privacy Enhanced Technologies https://www.youtube.com/watch?v=QLDsarujVno&list=PLSNNzog5eydt3_DF13S5EhsoqINbPdSZO Business continuity https://www.youtube.com/playlist?list=PLSNNzog5eydsHAqJKbkK8bFQ5B8WadGEY Cyber Attacks and Defense https://www.youtube.com/watch?v=LXd2uP1qKDE&list=PLSNNzog5eyduYEO-6i6B0uShqjusETugo Remote Access & WAN Technologies https://www.youtube.com/watch?v=B1tElYnFqL8&list=PLSNNzog5eyduTVeiVQRV_AM35YKSrFgzr