Computer Network


Q91.

Consider that B wants to send a message m that is digitally signed to A. Let the pair of private and public keys for A and B be denoted by K_{x}^{-} and K_{x}^{+} for x = A,B, respectively. Let K_{x}(m) represent the operation of encrypting m with a key K_{x} and H(m) represent the message digest. Which one of the following indicates the CORRECT way of sending the message m along with the digital signature to A?
GateOverflow

Q92.

In a RSA cryptosystem a participant A uses two prime numbers p=13 and q=17 to generate her public and private keys. If the public key of A is 35. Then the private key of A is __________.
GateOverflow

Q93.

Advanced Encryption Standard (AES) is based on
GateOverflow

Q94.

An example of poly-alphabetic substitution is
GateOverflow

Q95.

Use of IPSEC in tunnel mode results in
GateOverflow

Q96.

The total number of keys required for a set of n individuals to be able to communicate with each other using secret key and public key cryptosystems, respectively are:
GateOverflow

Q97.

Hashed message is signed by a sender using his
GateOverflow

Q99.

In the RSA public key cryptosystem, the private and public keys are (e,n) and (d,n) respectively, where n=p*q and p and q are large primes. Besides, n is public and p and q are private. Let M be an integer such that 0 \lt M \lt n and \phi (n)= (p-1)(q-1). Now consider the following equations. I. M'=M^{e} mod \; n M=(M')^{d}mod \; n II. ed=1 mod n III. ed=1 mod \phi (n) IV. M'=M^{e}mod \; \phi (n) M=(M')^{d}mod \; \phi (n) Which of the above equations correctly represent RSA cryptosystem?
GateOverflow

Q100.

A public key encryption system
GateOverflow