Encryption-Decryption
September 26, 2024Database-Management-System
September 27, 2024Encryption-Decryption
Question 3 |
If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be:
N | |
(N – 1) | |
N(N – 1) / 2 | |
N(N + 1) / 2 |
Question 3 Explanation:
→ If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be N(N-1) / 2.
→ To communicate using symmetric cryptography, both parties have to agree on a secret key. After that, each message is encrypted with that key, transmitted, and decrypted with the same key. Key distribution must be secret. If it is compromised, messages can be decrypted and users can be impersonated. However, if a separate key is used for each pair of users, the total number of keys increases rapidly as the number of users increases. With n users, we would need [n(n-1)]/2 keys.
→ To communicate using symmetric cryptography, both parties have to agree on a secret key. After that, each message is encrypted with that key, transmitted, and decrypted with the same key. Key distribution must be secret. If it is compromised, messages can be decrypted and users can be impersonated. However, if a separate key is used for each pair of users, the total number of keys increases rapidly as the number of users increases. With n users, we would need [n(n-1)]/2 keys.
Correct Answer: C
Question 3 Explanation:
→ If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be N(N-1) / 2.
→ To communicate using symmetric cryptography, both parties have to agree on a secret key. After that, each message is encrypted with that key, transmitted, and decrypted with the same key. Key distribution must be secret. If it is compromised, messages can be decrypted and users can be impersonated. However, if a separate key is used for each pair of users, the total number of keys increases rapidly as the number of users increases. With n users, we would need [n(n-1)]/2 keys.
→ To communicate using symmetric cryptography, both parties have to agree on a secret key. After that, each message is encrypted with that key, transmitted, and decrypted with the same key. Key distribution must be secret. If it is compromised, messages can be decrypted and users can be impersonated. However, if a separate key is used for each pair of users, the total number of keys increases rapidly as the number of users increases. With n users, we would need [n(n-1)]/2 keys.
Subscribe
Login
0 Comments