Suppose that everyone in a group of $N$ people wants to communicate secretly with the $N-1$ others using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is
Every pair of people needs its own secret key, shared only by the two of them. The number of pairs among $N$ people is $\binom{N}{2} = \frac{N(N-1)}{2}$.
More Application Layer: DNS and HTTP questions
GATE 2015 CS (CS1) Q25– Which of the following statements is/are FALSE? I. XML overcomes the limitations in HTML…
GATE 2015 CS (CS1) Q27– In one of the pairs of protocols given below, both the protocols can use multiple TCP…
GATE 2016 CS (CS1) Q35– Which of the following is/are example(s) of stateful application layer protocols? (i) HTTP…
GATE 2016 CS (CS1) Q62– Consider that B wants to send a message m that is digitally signed to A. Let the pair of…
GATE 2017 CS (CS1) Q25– A sender S sends a message m to receiver R, which is digitally signed by S with its…
GATE 2017 CS (CS1) Q54– In a RSA cryptosystem, a participant A uses two prime numbers p = 13 and q = 17 to…