HomeОбразованиеRelated VideosMore From: Sundeep Saradhi Kanthety

# NETWORK SECURITY - DIFFIE HELLMAN KEY EXCHANGE ALGORITHM

865 ratings | 64127 views
This Algorithm is used to exchange the secret /symmetric key between sender and receiver. This exchange of key can be done with the help of public key and private key step 1 Assume prime number p step 2 Select a such that a is primitive root of p and a less than p step 3 Assume XA private key of user A step 4 Calculate YA public key of user A with the help of formula step 5 Assume XB private key of user B step 6 Calculate YB public key of user B with the help of formula step 7 Generate K secret Key using YB and XA with the help of formula at Sender side. step 8 Generate K secret Key using YA and XB with the help of formula at Receiver side.
Html code for embedding videos on your blog
Sundeep Saradhi Kanthety (10 months ago)
HI VIEWERS THERE IS A SMALL MISTAKE WHILE WRITING THE FORMULA AND IN THE EXAMPLE PROBLEM. At THE TIME 9:18 CORRECT ONE : PUBLIC KEY OF USER A WRONG ONE : WRITTEN AS PUBLIC KEY OF USER B AT THE TIME 25:01 CORRECT ONE : POWER IS XB WRONG ONE : WRITTEN POWER AS XA PLEASE MAKE A CORRECTION AND I AM SORRY FOR THE MISTAKE.
Dinesh Munasinghe (2 months ago)
Thanks, and it's beneficial. I have a quick question. Is the meaning of Oneway function similar to trapdoor function?
DrunkenHamster (3 months ago)
Alice and Bob agree to use a modulus p = 23 and base g = 5 (which is a primitive root modulo 23).(wiki)
DrunkenHamster (3 months ago)
+urvashi rai lol mindfk
Erson Rojas (3 months ago)
q can be any of the prime number :D
urvashi rai (10 months ago)
Sundeep Saradhi Kanthety Sir how will both the user come to know the value of q?
t v nagaraju Technical (8 hours ago)
nice sir if any one requires concepts related to number theory(introduction ,fermat's theorem, euler's theorem, chinese remainder theorem with examples ) please refer the link https://www.youtube.com/channel/UCypITyf2qW4tPLYVGpjcyvw/videos?view_as=subscriber
Manik Anand (14 days ago)
Thank you sir,your videos helped me alot.
Archana Reddy (21 days ago)
Sir please upload number theory, format and Euler therom..Ur teaching is good and I shared Ur video with my friends
Arjunvarma Uppalapati (1 month ago)
Well said, i appreciate your efforts 👍
vishnu srivilla (1 month ago)
Good one sir... Your explanation is far better than my lecturer at college...👌
Yokesh K (1 month ago)
Sir if YA is given how to find XA?
DAVID BEN (1 month ago)
Thank u sir.... Very useful
Very very very helpful Thanku very much sir
payal sagar (1 month ago)
thankyou sr!
Arathi Thamban (2 months ago)
Well explained
Ashish Nair (2 months ago)
last min i got this before exam!!! thank u soo much!
Deepraj paul (2 months ago)
Please avoid doing mistakes. Online platform is good but clearing the doubts instantly at that point is not possible. It breaks the flow and concentration.
sai ram (2 months ago)
Fantastic explanation Sandeep...THanks alot..easy method of explaining.
Sandip Deb (3 months ago)
Sir I have watched your video and it is very helpful for me my one query is, by using this calculation any one can get the key and any one can decrypt massage so how it is safe to exchange key
aswin lakshmanan (3 months ago)
please say how to solve elliptic curve problem
Saurabh Rauthan (3 months ago)
Sir at time 24:58 , you mistakenly wrote Yb=alpha's power Xa instead of Xb
Tamizh selvan (3 months ago)
very nice sir...really good...i want to now about Hyper Elliptic Diffe hellam key exchange process ...if possible send me mail to [email protected]
vikas gupta (3 months ago)
In the example problem, how did you find XA=8(private key), or is it like, you have assumed it to be 8?.. please clarify 24:10
Ankit Singh (3 months ago)
Effortless mahn😎
Nidhi Jain (4 months ago)
Sir plz make a video on RC6 Algorithm
super explaination sir
Jerome Antony (4 months ago)
sir , i had a dought , pls check time (9:17) of the video is that public key of user a or b ?..........
Divya Sreekanth (4 months ago)
Thank you very much sir, i like the way of your teaching , u explain very nicely ..
Ritesh Kumar (4 months ago)
How alpha could be shared?? As both users using same alpha??
Vamsi Nelluri (4 months ago)
very nicely explained ...thank you sir
Sabbineedi Veni (5 months ago)
thank you very much Sir... Most useful
HARISH KUMAR Ivaturi (5 months ago)
hello, my doubt is , what if XA and XB values are high, like one is 36 and other is 58. how can we calculate YA and YB?
pavan santhu (5 months ago)
thank you so much sir !! best lecture ever
qaz2625 qaz (5 months ago)
sir, if I choose Xa=7 then Ya=(2^7)mod11=7, i.e Xa=Ya=7; here my public key and private key are same isnt it dangerous to have both public key and private key as same value ?
Sumit Patil (5 months ago)
Thank you for this valuable lecture sir...
Ashwani Sekhar (6 months ago)
example starts at 16:01
Mukesh Goyal (6 months ago)
Sir this is symmetric encryption algorithm but you say beginning of the video this is asymmetric encryption how please explain
ashwini mondukar (6 months ago)
Sir try to upload random number generator
Hema Latha (6 months ago)
sir for modular arithmetic Euclidean algorithm. plz send me the link sir.
Hema Latha (6 months ago)
good day Sir. have u posted video for stream ciphers and RC4 IN CRYPTOGRAPHY. if it is send me the link sir.
Sangeetha Manekar (6 months ago)
U are nt rplying me
Sangeetha Manekar (6 months ago)
Hi Hw can write in exm diz subjct pls tell me
Absolutelypriyansh (6 months ago)
So basically summary is that => 2^8*4 mod 11 (where 8 is private key of A. and 4 is private key of B) => 2^32 mod 11 => 4
vaikuntarao potnuru (6 months ago)
Very good explanation sir..I never seen these detailed and clear explanation by anyone so far
Om sharan Sharma (6 months ago)
very nice explanation sir
honey (7 months ago)
thank youuu sirr..............
amina zubair (7 months ago)
Thanks a lot sir but my question is that in my question paper p and q value are mentioned how to handle it
honey (7 months ago)
thank you sir
Shakthi Aravind Ovisha (7 months ago)
You’re awesome bloke! Some faculties are struggling to explain this but you did it in ease! Thank you!
hi aravind thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Umar Jan Bhat (7 months ago)
Nice try!!
Sundeep Saradhi Kanthety (5 months ago)
Hi umar Thanks for your interest towards our channel and share my sessions with your friends and keep following our channel and don't forget to subscribe to our channel.
If Diffie Hellman is for Symmetric key exchange, then what's for assymetric key exchange. Please help. Thank you Sir.
+Sundeep Saradhi Kanthety Thank you Sir.... I easly wrote my cryptography exam... All that's because of you Sir. This channel is already famous among our friends 🤩😇😇. Every aspect gets clear after viewing your videos. Again Thank you very much Sir.. With Great Respect, Adithyan.
Sundeep Saradhi Kanthety (6 months ago)
hi adithyan In asymmetric we are supposed to use a pair of keys ( public , private ) for every encryption and decryption process, Private key is not shareable Public key must be shared with all the users in the network by different key exchange methods ( publicly available directory or certificate authorities ) Hope your doubt has been clarified and plz let me know if you still had a doubt. thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Hassan Waheed (8 months ago)
DIFFIE HELLMAN is an asymmetric process
Sundeep Saradhi Kanthety (8 months ago)
hi hassan yes and me too explained the same. thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
please make tutorial on elliptic curve cryptography....
thank you sir...... please make more tutorial on Network Security....
Sundeep Saradhi Kanthety (9 months ago)
hi hafeez thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
also..... your methodology is superb as compared to other,s
Jyotirmay pandit (9 months ago)
Nice lecture good concept very helpful...Keep it up sir....
Sundeep Saradhi Kanthety (9 months ago)
hi jyotirmay thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
arka dey (10 months ago)
Thank u sir....!!! loved your graphics lectures also
Sundeep Saradhi Kanthety (9 months ago)
hi Arka thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
thank u
Sundeep Saradhi Kanthety (10 months ago)
hi Benjamin thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
karun redy (10 months ago)
Sir...i am really delighted by your class... your videos are very informative and useful
Sundeep Saradhi Kanthety (10 months ago)
hi karun thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
srinu gorla (10 months ago)
sirr if same key is used by both sender and receiver then how it will be treated as assymentric encryption??
srinu gorla (10 months ago)
+Sundeep Saradhi Kanthety thanks for clarification sir and please make a video on CYBER THREATS AND THEIR DEFENSE...you are the best in teaching I had come across sir.....
Sundeep Saradhi Kanthety (10 months ago)
hi srinu actually this algorithm is for exchanging the secret key with the help of asymmetric encryption. we will use the public and private keys at both sender and receiver side and calculate the secret key which is symmetric. Hope your doubt has been clarified.
BALA IIIT (10 months ago)
Thank you Sir. Easy Steps to find K. K =5^8 mod 11 = (625 x 625) mod 11 = (9 x 9) mod 11 ( Divide 625 by 11, rem=9) = 81 mod 11 K = 4
Saleh Shohag (10 months ago)
Thanks your video in Network security is awesome and very easy to understand. In this video i think Ya is the public key of A not B.(May be a writing mistake of you). please clarify.
Saleh Shohag (10 months ago)
Thanks for quick reply and clarification.
Sundeep Saradhi Kanthety (10 months ago)
hi saleh you are correct and thanks for observation and correction. thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
HIMANSHU SINGH (11 months ago)
Sir, at 9:18 its public key of user A and at 25:01 its xB power not xA :-)
Sundeep Saradhi Kanthety (10 months ago)
hi Himanshu You are absolutely correct and thanks for your correction.
Thanks for the detailed explanation. Much needed one. Could you please explain PBES Encryption too? I need this much.
Sundeep Saradhi Kanthety (11 months ago)
hi Krupal thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Rupesh Bhandari (11 months ago)
9:18 (public key of user A)*
Sundeep Saradhi Kanthety (11 months ago)
hi rupesh nice observation and thanks for correction.
Vijay Uttekar (11 months ago)
Thanks Sir
Sundeep Saradhi Kanthety (11 months ago)
hi vijay thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.
Hello, How 'q' is gonna be same on both sender and receiver side?
Kuldeep Kushwaha (2 months ago)
The necessary public values q and a would need to be known ahead of time.
chamarthi prasanth (3 months ago)
'q' will be equal on both the sides because it is an assymetric key the which is using on one side(SENDER) should be used on another side(RECEIVER) so in that manner we used q on both sides
Aswana lal (1 year ago)
Thank you for your class sir.. But I have a doubt. Both sender and receiver must choose same prime number q and alpha value... How it is possible? Or is it is shared after choosing one?
hi aswana no receiver can choose any prime.
Thanks sir Please up date More videos Network Security
hi kishore definitely i will upload almost all concepts of security.
Lopamudra Prusty (1 year ago)
Sir, is there any other shorter way to find primitive root? Since it is too lengthy and time taking...
hi prusty i think there is no other way to find the primitive root just we have to follow that and i think it was simple and definitely it would be complex for the large numbers.
remya unnikrishnan (1 year ago)
Thank u sir for this video.. can you explain elliptic curve cryptography?
hi remya thanks for your interest towards our channel and i will try to upload it.
Aman Trilok Singh (1 year ago)
Great work and truly helpful. Would you help to take this a step forward to explain with respect to ssl handshake 1. Will the server send the prime number and primitive root along with its private key in server key exchange, for the client to compute it's public key? 2. What is the purpose of DH group parameter in server key exchange? Is it used only when I am not sending the primitive root? 3. How is the generated key is broken down to be used for symmetric encryption and hashing 4 kindly explain perfect forward secrecy (PFS) and ECDH Thanks again for all the hard work. Truly appreciated..
Venkatesh Goud (7 months ago)
excellent..awesome video sir..plz keep it up........update more on operating system also..
Swara Saha (1 year ago)
please complete the course within the month of april
hi swara definitely it will be completed.
DEEPANKAR KUMAR (1 year ago)
In rsa algorithm to find for encryption and decryption value but message will be a letter then how to use a encryption value and decryption value
Mujtaba Hassan (10 months ago)
Use can use alphanumeric to decimal conversion table
hi deepankar thanks for watching my sessions the letter should be converted into numerical and should apply the algorithm for conversion. hope your doubt has been clarified.
Funwithkanak (1 year ago)
sir can you provide an algorithm or a program for detecting malicious object .
Funwithkanak (1 year ago)
ok sir..
hi i will try to upload it.
Baylay Vods (1 year ago)
Your videos are great man! They do not go unappreciated!!!
hi thanks for watching my sessions and giving support to our channel.
night walker (1 year ago)
Thank you sir easy to understand we hope you talk about elgamal cryptosystem and signature for rsa and elgamal best regards❤
Hi night walker thank you and definitely soon I will try to upload them soon. Thanks for watching my sessions and supporting our channel.