文件名称:diffie_hellman
-
所属分类:
- 标签属性:
- 上传时间:2017-05-01
-
文件大小:676byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Implement Diffie-Hellman Key exchange protocol and demonstrate that at the
end, both person will have a common Key.
Do the following:
1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5).
2. Generate a, a random number mod p. Now generate A, which is g raised to
the a power mod p i.e. A = (ga) mod p .
3. Do the step 2 for b and B.
4. A and B are public keys. Generate a session key with them set s1 to B raised
to the a power mod p so s1 = (Ba) mod p.
5. Do the step 4 with A and b i.e. (Ab) mod p = s2.
6. check the correctness i.e. check whether you came up with the s1 == s2.
(b) Write a program to demonstrate the man in the middle attack is possible using
an example. You can perform set up as described in the above problem.-Implement Diffie-Hellman Key exchange protocol and demonstrate that at the
end, both person will have a common Key.
Do the following:
1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5).
2. Generate a, a random number mod p. Now generate A, which is g raised to
the a power mod p i.e. A = (ga) mod p .
3. Do the step 2 for b and B.
4. A and B are public keys. Generate a session key with them set s1 to B raised
to the a power mod p so s1 = (Ba) mod p.
5. Do the step 4 with A and b i.e. (Ab) mod p = s2.
6. check the correctness i.e. check whether you came up with the s1 == s2.
(b) Write a program to demonstrate the man in the middle attack is possible using
an example. You can perform set up as described in the above problem.
end, both person will have a common Key.
Do the following:
1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5).
2. Generate a, a random number mod p. Now generate A, which is g raised to
the a power mod p i.e. A = (ga) mod p .
3. Do the step 2 for b and B.
4. A and B are public keys. Generate a session key with them set s1 to B raised
to the a power mod p so s1 = (Ba) mod p.
5. Do the step 4 with A and b i.e. (Ab) mod p = s2.
6. check the correctness i.e. check whether you came up with the s1 == s2.
(b) Write a program to demonstrate the man in the middle attack is possible using
an example. You can perform set up as described in the above problem.-Implement Diffie-Hellman Key exchange protocol and demonstrate that at the
end, both person will have a common Key.
Do the following:
1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5).
2. Generate a, a random number mod p. Now generate A, which is g raised to
the a power mod p i.e. A = (ga) mod p .
3. Do the step 2 for b and B.
4. A and B are public keys. Generate a session key with them set s1 to B raised
to the a power mod p so s1 = (Ba) mod p.
5. Do the step 4 with A and b i.e. (Ab) mod p = s2.
6. check the correctness i.e. check whether you came up with the s1 == s2.
(b) Write a program to demonstrate the man in the middle attack is possible using
an example. You can perform set up as described in the above problem.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
diffie_hellman.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.