Great explanation. Now, if Bob wants to send a message to Alice, how does he encrypt it? This may be a dumb question, but I'm not sure where the message fits in here. What am I missing?
An example of an even higher prime number would be more useful to see and the anology on it. something like n = 101 or something like that and g be like 27
I think the hacker needs to get the larger exchanged result in this case 10, 2 are obtained and the hacker going to select 10 and can find the secrete key by having his/her own key starting from 7 like 7,11,13,17..... just use the formula as bob and alliance 10pow7,11,13,...., mod 11 is always 10! so, the exchanged key also keep as a secret. the tutorial is so amazing and wonderful!
Bro just explained them better than my professor did in two lectures
Colossal explanation!! I wish CZcams could let me give this video a "like" infinitely!
Beautifully condensed a dreary 1 hour lecture into 8 minutes. Fantastic!
I know right!!!!
very simple, free from burdensome difficult terminologies, straight to the point, and no time wasting. amazing
Incredible. Best explanation of DH I have ever heard.
Thank you. This is very clear and to the point explaination. Very helpful.
came searching to understand for tomorrow's exam and this video has helped me 💯
Amazing video. Great explanation!
Thank you so much for such clean explaination!!!
Great video, great explanation, thanks a lot!
Great explanation !
Just fell in love with it!
Simple. Direct. Thank you.
very very helpful explination, I love it.
Best video explanation ever!!!
Awesome thanks I was lost forever on this
Amazing , on point!
Thank You so much for this tutorial ❤❤❤
Excellent explanation.
Very good explanation
Awesome explanation
Than you very much, may god bless you and guide you.
Thank you dude
Thank Youu ❤ 🎉 its very clear sir
Thanks man!
I'm not sure you need 2 prime numbers to start. A prime number and a generator is normally needed if not mistaken.
only x, y and n need to be very large for this to be secure. g can be small.
Practicly impossible for supercomputers yet invented by human creative mind by applying logic and imagination. Amazing!
Great explanation. Now, if Bob wants to send a message to Alice, how does he encrypt it? This may be a dumb question, but I'm not sure where the message fits in here. What am I missing?
Mantap bos
It is also a good thing to know that g is a primitive root modulo of n
Only makes sense and clear if you have a bit of background.
An example of an even higher prime number would be more useful to see and the anology on it. something like n = 101 or something like that and g be like 27
Thanks
How to find the remainder
Tom's number ( z=4 ) is not prime. Should it not be?
But g must be primitive root of n isn't it?
But what's the point of getting uncrypting k = 10 on the receiving end ? When and who decided that the uncrypted message would be 10 ?
I had a doubt....why was Tom not able to get the value of K right....he used the same g and n right??
Because he used a different Z... He'd get the value right if he could guess the X and Y Alice and Bob were using. but they're private.
He was fuckin drunk bruh
Becoz in the equations to calculate K, TOM has no idea about x & y as these were never shared on the network
With the four public numbers and some algebra the key can be uncovered 😈
Hlo
I think the hacker needs to get the larger exchanged result in this case 10, 2 are obtained and the hacker going to select 10 and can find the secrete key by having his/her own key starting from 7 like 7,11,13,17..... just use the formula as bob and alliance 10pow7,11,13,...., mod 11 is always 10! so, the exchanged key also keep as a secret. the tutorial is so amazing and wonderful!
U want your video views are more people seen then u can speak with me and i will grow your view on channel
thanx .you really saved my day🫡