In the RSA system, the receiver does as follows:1. Randomly select two large prime numbers p and q, which always must bekept secret. 2. Select an integer number E, known as the public exponent, such that (p 1) and E have no common divisors, and (q 1) and E have no commondivisors. 3. Determine the private exponent, D, such that (ED 1) is exactly divisible byboth (p 1) and (q 1). In other words, given E, we choose D such that theinteger remainder when ED is divided by (p 1) (q 1) is 1.4. Determine the product n = pq, known as public modulus. 5. Release publicly the public key, which is the pair of numbers n and E, K = (n, E). Keep secret the private key, K = (n, D). The above events are mentioned in the correct order as they are performed whilewriting the algorithm. Select one:TrueFalse

Question

Computers & Technology

Guest

16 August, 07:22

In the RSA system, the receiver does as follows:1. Randomly select two large prime numbers p and q, which always must bekept secret. 2. Select an integer number E, known as the public exponent, such that (p 1) and E have no common divisors, and (q 1) and E have no commondivisors. 3. Determine the private exponent, D, such that (ED 1) is exactly divisible byboth (p 1) and (q 1). In other words, given E, we choose D such that theinteger remainder when ED is divided by (p 1) (q 1) is 1.4. Determine the product n = pq, known as public modulus. 5. Release publicly the public key, which is the pair of numbers n and E, K = (n, E). Keep secret the private key, K = (n, D). The above events are mentioned in the correct order as they are performed whilewriting the algorithm. Select one:TrueFalse

+5

Answers (1)

Know the Answer?

Dillon · Answer 1

False.

Explanation:

The correct option is false that is to say the arrangement is not true. So, let us check one or two things about the RSA System.

The RSA system simply refer to as a cryptosystem that was first established in the year 1973 but was later developed in the year 1977 by Ron Rivest, Adi Shamir and Leonard Adleman.

The main use of the RSA system is for encryption of messages. It is known as a public key cryptography algorithm.

The way the algorithm should have been arranged is;

(1). Randomly select two large prime numbers p and q, which always must bekept secret.

(2). Determine the product n = pq, known as public modulus.

(3). Select an integer number E, known as the public exponent, such that (p 1) and E have no common divisors, and (q 1) and E have no commondivisors.

(4). Determine the private exponent, D, such that (ED 1) is exactly divisible by both (p 1) and (q 1). In other words, given E, we choose D such that the integer remainder when ED is divided by (p1) (q 1) is 1.

(5). Release publicly the public key, which is the pair of numbers n and E, K = (n, E). Keep secret the private key, K = (n, D).

Therefore, The way it should have been arranged in the question should have been;

(1), (4), (2), (3) and (5).