Machine-translated by Google. Questions are authored in English.
Top

Symmetric Key Algorithms Questions and Answers

1.

Advanced Encryption Standard (AES) is based on :

Exam Year(s)

MH SET - 2018, SET Exam - 2018,

Answer: B

AES is based on a Symmetric key algorithm.

The Advanced Encryption Standard (the Rijndael cipher, adopted by NIST in 2001) uses the same secret key to encrypt and to decrypt. It is a block cipher with a 128-bit block and keys of 128, 192 or 256 bits.

Asymmetric (public key) algorithms such as RSA use a pair of different keys, and key exchange protocols such as Diffie-Hellman establish a shared key rather than encrypting data, so neither describes AES.

Please log in or register to report this question.

2.

In symmetric key cryptography, if every person in a group of 10 people needs to communicate with every other person in the group, how many secret keys are required ?

Exam Year(s)

MH SET - 2020, SET Exam - 2020,

Answer: C

The group needs 45 secret keys.

In symmetric cryptography each pair of people shares one secret key. The number of pairs among n people is

\[ \frac{n(n - 1)}{2} = \frac{10 \times 9}{2} = 45 \]

90 counts each pair twice (once for each person), 9 is the number of keys one person needs, and 10 is just the number of people.

Please log in or register to report this question.

3.

In symmetric-key cryptography, if every person in a group of 10 people needs to communicate with every other person in another group of 10 people, how many minimum secret keys are needed ?

Exam Year(s)

MH SET - 2021, SET Exam - 2021,

Answer: C

The number of keys is 100.

In symmetric-key cryptography each communicating pair needs a secret key known only to the two of them; if one key were shared by more people, any holder could read the others' messages. Every one of the 10 people in the first group talks to every one of the 10 in the second:

\[ 10 \times 10 = 100 \]

People in the same group are not said to talk to each other, so the formula n(n − 1)/2 for one group of n does not apply. A figure of 10 would give each person a single key, and 1 a single shared key, neither of which keeps pairs private. 50 matches no counting.

Please log in or register to report this question.

Loading…

Other Subjects

Tags: Symmetric Key Algorithms Questions and Answers || Symmetric Key Algorithms MCQ Questions and Answers || Symmetric Key Algorithms GK Questions and Answers || Symmetric Key Algorithms GK MCQ Questions || Symmetric Key Algorithms Multiple Choice Questions and Answers || Symmetric Key Algorithms GK || GK on Symmetric Key Algorithms || Cyber Security Questions and Answers || Cyber Security MCQ Questions and Answers || Cyber Security GK Questions and Answers || GK on Cyber Security