There is an issue, what if 'Tom' supposes z=7 then he'll be able to calculate the correct final key i.e. "10" like others do. So if someone chooses/assumes a prime number on his side as well then the game is over LOL ? What's your comment on this CBTVid?
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?
The concept and algorithm is clear. But I have a doubt as every one knows that we will choose a prime number as a private key. So by using hit and trial methods if an attacker tries each prime number then this algorithm is also cracked and the attacker can easily understand the key. As prime numbers are limited so the attacker has to come only a certain number of attempts. I know the computational time is high but by using a high performance system this can be cracked.
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
The value of k is absolutely right just thr thing is T didnt get shared both this works when both of them exchange their value to one another , here only tom got value from them didnt give his number orelse it would be correct
Bro just explained them better than my professor did in two lectures
very simple, free from burdensome difficult terminologies, straight to the point, and no time wasting. amazing
Beautifully condensed a dreary 1 hour lecture into 8 minutes. Fantastic!
I know right!!!!
Colossal explanation!! I wish UA-cam could let me give this video a "like" infinitely!
Incredible. Best explanation of DH I have ever heard.
came searching to understand for tomorrow's exam and this video has helped me 💯
Thank you. This is very clear and to the point explaination. Very helpful.
This is so simple and amazing, thank you, you are amazing!!!!
Amazing video. Great explanation!
Awesome thanks I was lost forever on this
Great video, great explanation, thanks a lot!
Best video explanation ever!!!
Thank you so much for such clean explaination!!!
very very helpful explination, I love it.
I'm not sure you need 2 prime numbers to start. A prime number and a generator is normally needed if not mistaken.
Great explanation !
Just fell in love with it!
only x, y and n need to be very large for this to be secure. g can be small.
There is an issue, what if 'Tom' supposes z=7 then he'll be able to calculate the correct final key i.e. "10" like others do. So if someone chooses/assumes a prime number on his side as well then the game is over LOL ? What's your comment on this CBTVid?
The eavesdrop can just send his own keys to Alice and Bob when they first exchange keys, so it does not solve MITM attack, is that right?
Simple. Direct. Thank you.
Than you very much, may god bless you and guide you.
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 ?
It is also a good thing to know that g is a primitive root modulo of n
Very good explanation
Thank You so much for this tutorial ❤❤❤
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?
Thank Youu ❤ 🎉 its very clear sir
The concept and algorithm is clear. But I have a doubt as every one knows that we will choose a prime number as a private key. So by using hit and trial methods if an attacker tries each prime number then this algorithm is also cracked and the attacker can easily understand the key. As prime numbers are limited so the attacker has to come only a certain number of attempts. I know the computational time is high but by using a high performance system this can be cracked.
Only makes sense and clear if you have a bit of background.
Excellent explanation.
Awesome explanation
Tom's number ( z=4 ) is not prime. Should it not be?
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
Amazing , on point!
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
The value of k is absolutely right just thr thing is T didnt get shared both this works when both of them exchange their value to one another , here only tom got value from them didnt give his number orelse it would be correct
Tom needs to mind his own business
With the four public numbers and some algebra the key can be uncovered 😈
How to find the remainder
But g must be primitive root of n isn't it?
I'll remember that
Mantap bos
Thanks man!
Thank you dude
Ah it's understandable but my Lectrual made it hard 😢
Thanks
Hlo
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🫡