in Computer Networks
9 views
0 votes
0 votes

Suppose that everyone in a group on $N$ people wants to communicate secretly with
the $(\text{N - 1})$ others using symmetric Key cryptographic system.
The communication between any two person should not be decodable by the others
in the group. The numbers of keys required in the system as a whole to satisfy
the confidentiality requirement is

  1. $2N$
  2. $N(N-1)$
  3. $\dfrac{N(N-1)}{2}$
  4. $(N-1)^{2}$
in Computer Networks
by
585 points
9 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.