Diffie-Hellman Key Exchange - Assignment Example

The attacker always tries to find a way to prevent the users from communicating, therefore the system administrators need to implement methods that are secure and that prevent the entry of unauthorized persons into the network.
Outsider Attacks
The outside attacker tries to obtain the shared key to make attacks. This attack can be prevented by using robust authentication methods such as strong passwords. It is important also to test whether the server is broken to keep maximum protection for the system.
Inside Attacker
Inside attackers are operators within the system who sniff passwords and receive the shared key. An insider attacker should be prevented from attacks by using antispyware software and malware software (Kate, et al., 2004). Attackers ordinarily use Trojans, malware, and spyware to sniff passwords that they use to receive the shared key (Mahalanobis, 2005). The network must be clean of such applications.

Question 2

What is the value of symmetric key g=11, p=29, x=5, and y=7?
K = gxy mod p
=〖(11〗^(5×7))/29
=9.6×1034
Mod = 69 × 1034

Value of R1 and R2?
R1 = 9
R2 = 23

In the Diffie-Helman protocol, if x is equal to y

Answer
If x and y have the same value then the DHp will the key will be generated as a multiple of the new key factor x. DHP has key multiple resistance and therefore it will calculate the key value by first finding out the number of the first user who selected the key. DHP has key resistance properties, it also is key independent and also processes the security for the same key multiple times.
Key Freshness: fresh keys can be used without needing the CA re-certify for the public keys.
Question 3
p=23, q=31, d=457
D = e-1 = p (mod q(N))
457=23(mod 31 (N))
457mod23 = N
= 87
Question (HW3b)
M1=100
Fred can use m1 to get the value of the key by getting the exponential values of 100 against 23 (Holmes, 2006).
100¬¬31 – m223 =457
N = 457 = (23)(31) Read More