Diffie Hellman Key Exchange Algorithm | Diffie Hellman key exchange algorithm example and solution

preview_player
Показать описание
Diffie Hellman Key Exchange Algorithm | Diffie Hellman key exchange algorithm example and solution

In this video, I have covered Diffie-Hellman key exchange algorithm explanation with example. How to find out secret value in Diffie-Hellman key exchange algorithm? Some exercises given in video, you should find out solution and write your answer in comment section.

#Diifie_Hellman_Key_exchange_Algorithm
#Example_of_Diffie_Hellman_key_exchange_algirhtm
#Find_secret_key_using_Diffie_Hellman_key_Exchange_Algorithm
#chiragbhalodia
#chirag_bhalodia
Рекомендации по теме
Комментарии
Автор

Solution of all exercise is posted in blog.

ChiragBhalodia
Автор

Chirag you explanation is awesome.
I clearly understood the concepts.

JKA-sfll
Автор

Its will be good if u prepared soft copy (docx / pdf . .. ) of your every single videos topic. it will help others too.

caveranzjohn
Автор

Sir I have a doubt i.e; is primitive root always less than the given number?
In the given example alpha is greater than the prime (7, 17)so I am asking?

harshinichinta
Автор

Sir i'm not understanding the concept of finding the primitive root and the method of solving is too big, can you please suggest a short trick for that

yashikasaxena
Автор

Hello sir, could you turn on subtitles? My listening skill not good but I really want to understand this video. Thanks

caoxuanthienkdn
Автор

for who are confused by 17 as primitive roots of 7,
the primitive roots of 7 is indeed 3, 5. the 17mod7=3, so if 3 is primitive root of 7 then all xmod7=3 is also act as primitive roots.
yes, the primitive root of N should be less then n, else there will be infinite roots.

yes i have verified the question answers by taking primitive roots as 3 not 17, and it if giving same results.
i don't know why sir you didn't able to solve this query of people from past 3 years.
pls pin this comments so that next gen can understand this without wasting time like me.

kartikforwork
Автор

Is there any prime no. which will give unequal keys at the end

subhadeeppaul
Автор

Chirag sir how to take out mode of 3^97 mod 353 in first exercise?

mrnobody-vzup
Автор

Sir u didn't explain wat is primitive root and how to find it ??😭

monishlal
Автор

Content and explanation is very good 👍

hasiichavda
Автор

😐u solved with simplest digits but for us giving largest how? Can u calculate with highest value

sureshs
Автор

Ya=40 Yb=248 Ka=160 Kb=160

sana__bajwa_
Автор

FOR EXAMPLE 2
Ya = 18
Yb = 1
K = 1
K = 1

shehlaRASHID-nt
Автор

How can primitive root be larger than q

majidk
Автор

Alpha is primitive root of q so alpha should be less than q but in exercise 3
q=11 alpha=17

aswathrajesh
Автор

How do we calculate the primitive root of a number?

oopsandcheers
join shbcf.ru