Question

Question 2 The kid-RSA algorithm is a simplified version of the RSA algorithm. Kid-RSA takes as its input four numbers a, b, a1, b1. The four numbers are converted into four values M, e, d and n, according to the following equations: M = a \* b - 1 e = a1 \* M + a d = b1 \* M + b n = (e \* d) / M A plaintext message P can be encrypted to an encrypted message C with the public key (n,e) using: C = e \* P (mod n). Once encrypted, C can be converted back to P using the private key 'd' as follows: P = C \* d (mod n) (a) If a = 123, b = 456, a1 = 789 and b1 = 1234, calculate M, e, d and n. Show your working. (b) State the public key for these values of a,b,a1 and b1. (c) Encrypt the message 'Caesar++' using the public key. Show your working. (d) Decrypt the message. Show your working. [2] [2] [4] [4]

          Question 2
The kid-RSA algorithm is a simplified version of the RSA algorithm. Kid-RSA
takes as its input four numbers a, b, a1, b1. The four numbers are
converted into four values M, e, d and n, according to the following equations:
M = a \* b - 1
e = a1 \* M + a
d = b1 \* M + b
n = (e \* d) / M
A plaintext message P can be encrypted to an encrypted message C with
the public key (n,e) using:
C = e \* P (mod n).
Once encrypted, C can be converted back to P using the private key 'd'
as follows:
P = C \* d (mod n)
(a) If a = 123, b = 456, a1 = 789 and b1 = 1234, calculate M, e, d and n.
Show your working.
(b) State the public key for these values of a,b,a1 and b1.
(c) Encrypt the message 'Caesar++' using the public key. Show your working.
(d) Decrypt the message. Show your working.
[2]
[2]
[4]
[4]

Question 2
The kid-RSA algorithm is a simplified version of the RSA algorithm. Kid-RSA
takes as its input four numbers a, b, a1, b1. The four numbers are
converted into four values M, e, d and n, according to the following equations:
M = a b - 1
e = a1 M + a
d = b1 M + b
n = (e d) / M
A plaintext message P can be encrypted to an encrypted message C with
the public key (n,e) using:
C = e P (mod n).
Once encrypted, C can be converted back to P using the private key 'd'
as follows:
P = C d (mod n)
(a) If a = 123, b = 456, a1 = 789 and b1 = 1234, calculate M, e, d and n.
Show your working.
(b) State the public key for these values of a,b,a1 and b1.
(c) Encrypt the message 'Caesar++' using the public key. Show your working.
(d) Decrypt the message. Show your working.
[2]
[2]
[4]
[4]

Added by Kelsey B.

Question

Please give Ace some feedback