Computer-Networks
August 29, 2024Computer-Networks
August 29, 2024Computer-Networks
|
Question 393
|
In RSA
1. P and Q are chosen as very large prime number
2. Compute n = p*q and Φ(n) = (n-1)*(q-1)
Letter e encryption key chosen. How is this encryption key selected?
|
e is chosen as a relative prime to q
|
|
|
e is chosen as a relative prime to p
|
|
|
e is chosen as a relative prime to Φ(n)
|
|
|
e is chosen as a relative prime to n
|
Question 393 Explanation:
e or encryption key is chosen which is relatively prime to Φ(n), to satisfy the equation
e*d = 1 mod Φ(n), where e is encryption key and d is decryption key.
e*d = 1 mod Φ(n), where e is encryption key and d is decryption key.
Correct Answer: C
Question 393 Explanation:
e or encryption key is chosen which is relatively prime to Φ(n), to satisfy the equation
e*d = 1 mod Φ(n), where e is encryption key and d is decryption key.
e*d = 1 mod Φ(n), where e is encryption key and d is decryption key.