How to test if g is a primitive root of a prime number p?

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
• Private Key Encryption...
Advanced Cryptography:
• What is digital signat...
Public Key Infrastructure
• Why digital certificate?
Privacy Enhanced Technologies
• Surface net, Deep net...
Business continuity
• Business continuity
Cyber Attacks and Defense
• AAA framework: TACACS+...
Remote Access & WAN Technologies
• Circuit Switching vs. ...

[@Nonchalant2023]

I study in a highly renowned university in Europe and my teachers are incapable of teaching this concept in such a simple way. I am amazed and very thankful of discovering your content. Many thanks from Switzerland.

[@CitizensCommunity]

How is it 5 years later and it still looks like the first video, like it was all recorded on the same day? Amazing.

[@marcosalameh8677]

Perfect!

[@sunshine-cb8rq]

Perfect