Discrete Logarithm -Finding Primitive Roots - Cryptography - CSE4003

[@boyinamallika3592]

Worth spending my time watching this really good sir

[@husamalardah890]

Really nice explanation , only video out there properly explaining discrete logarithms for primitive roots. Good stuff.

[@jeevarukesh5023]

excellent teaching and explanation😇

[@SatishCJ]

Glad you liked it. Thanks for the nice feedback.

[@KaatibAcademy]

Thank you very much, I liked the way you explained the primitive root, I should thank you.

[@SatishCJ]

You are very welcome

[@utsavseth7116]

great lecture. Very well explained

[@sathviksrikanth7362]

Thanks a lot sir!!!

[@SatishCJ]

Most welcome!

[@naodtesfalem6758]

Great explanation clap 👏

[@SatishCJ]

Thanks for the nice feedback

[@HarpreetSingh-kr5yu]

Excellent explanation sir

[@nitikamahtolia]

Thankyou sir very well explained!

[@AB-np6qu]

Thank you so much 👍

[@fuzail9277]

isn't there any other method for getting i other than trial and error method?

[@mauryasharma4530]

Yes 5 is a primitive root of 7.

[@pavansakala7800]

Please also add elliptical curve cryptography concepts

[@SatishCJ]

Hello Pavan.. the concepts on elliptic curve cryptography is also added . Kindly check the playlist

[@codywohlers2059]

why does discrete log always use mod and regular log does not?

[@learnandroiddev2927]

5 is a primitive root of mod 7
You can try verifying with this python code
# check if 5 is a primitive root of mod 7
num = 5
mod = 7
results = []
for i in range(1, mod):
result = (num**i) % mod
if result in results:
print(f'{num} is a NOT primitive root')
break
results.append(result)
if i == mod - 1:
print(f'{results} == {num} is a primitive root')