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 < M < n and (n) = (p 1) (q 1). Now consider the following equations.

In the RSA public key cryptosystem, the private and public keys are (e

1.	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 < M < n and (n) = (p 1) (q 1). Now consider the following equations.
A.	1 and 2
B.	1 and 3
C.	2 and 4
D.	3 and 4
Answer» C. 2 and 4

Discussion

No Comment Found

Related MCQs

A sender S sends a message m to receiver R. which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place. (I) S can launch a birthday attack to replace m with a fraudulent message. (II) A third party attacker can launch a birthday attack to replace m with a fraudulent message. (III) R can launch a birthday attack to replace m with a fraudulent message. Which of the following are possible security violations?
Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is 500 106 bits per second. The propagation speed of the media is 4 106 meters per second. It is needed to design a Go Back N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. Then, the minimum size in bits of the sequence number field has to be _________.
Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (108 bits per second) over a 1 km (kilometer) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed (km/ sec) in the cable?
Consider a LAN with four nodes S1 S2 , S3 and S4. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than one node transmit in the same slot. The probability of generation of a frame in a time slot by S1, S2, S3 and S4 are 0.1, 0.2, 0.3 and 0.4, respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is ________.
A network has a data transmission bandwidth of 20 106 bits per second. It uses CSMA/CD in the MAC layer. The maximum signal propagation time from one node to another node is 40 micro seconds. The minimum size of a frame in the network is ________ bytes.
For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements is/are TRUE? I. At least three non-overlapping channels are available for transmissions. II. The RTS-CTS mechanism is used for collision detection. III. Unicast frames are ACKed.
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 < M < n and (n) = (p 1) (q 1). Now consider the following equations. 1. M = Me mod n M = (M )d mod n 2. ed 1 mod n 3. ed = 1 mod n 4. M = Me mod n M = (M )d mod n Which of the above equations correctly represent RSA cryptosystem?
Which of the following are used to generate a message digest by the network security protocols? (P) RSA (Q) SHA-1 (R) DES (S) MD5
A 2 km long broadcast LAN has 107 bps bandwidth and uses CSMA/CD. The signal travels along the wire at 2 108 m/s. What is the minimum packet size that can be used on this network?
The message 11001001 is to be transmitted using the CRC polynomial x3 + 1 to protect it from errors. The message that should be transmitted is

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 < M < n and (n) = (p 1) (q 1). Now consider the following equations.

Discussion

No Comment Found

Related MCQs

Reply to Comment