Choose the Elliptic curve with prime p = 11 , a = 1, b = 3 Generator G = (2, 7) and Message=(3,5), receiver private key is 2 and sender random integer k = 3 Compute the encryption anddecryption processes completely
Question
Choose the Elliptic curve with prime p = 11 , a = 1, b = 3 Generator G = (2, 7) and Message=(3,5), receiver private key is 2 and sender random integer k = 3 Compute the encryption anddecryption processes completely
Solution
Sure, let's start with the encryption process:
-
First, we need to calculate the public key of the receiver. The public key is the result of the multiplication of the private key by the generator point G. In this case, the private key is 2 and G is (2,7). So, we need to perform the operation 2*(2,7) on the elliptic curve. The result is the public key of the receiver.
-
Next, we need to calculate the first part of the ciphertext. This is done by multiplying the random integer k by the generator point G. In this case, k is 3 and G is (2,7). So, we need to perform the operation 3*(2,7) on the elliptic curve. The result is the first part of the ciphertext.
-
The second part of the ciphertext is calculated by adding the message point to the result of the multiplication of the random integer k by the public key of the receiver. In this case, the message point is (3,5), k is 3, and the public key of the receiver is the result from step 1. So, we need to perform the operation (3,5) + 3*(public key) on the elliptic curve. The result is the second part of the ciphertext.
Now, let's move on to the decryption process:
- The receiver can decrypt the message by subtracting the result of the multiplication of their private key by the first part of the ciphertext from the second part of the ciphertext. In this case, the private key is 2, the first part of the ciphertext is the result from step 2 of the encryption process, and the second part of the ciphertext is the result from step 3 of the encryption process. So, we need to perform the operation (second part of the ciphertext) - 2*(first part of the ciphertext) on the elliptic curve. The result is the original message point.
Please note that all the operations on the elliptic curve are performed modulo p, where p is the prime number defining the field of the curve. In this case, p is 11.
Similar Questions
Encrypt and decrypt by means of the RSA algorithm with the following system parameters:1. p = 3, q = 11, d = 7, x = 52. p = 5, q = 11, e = 3, x = 9
(a) Aldebaran wishes to send a message m = 33 to Borealis. i. (2 marks) Confirm whether or not Aldebaran’s public key corresponds to the secret key skA = 7. ii. (5 marks) In the first step, Aldebaran must compute the Elgamal encryption (c1, c2) = Enc(pkB, m). Suppose during encryption, Aldebaran randomly samples a = 33, as in where c1 = g a . What is (c1, c2)? Note: Aldebaran will perform the rest of the steps to convey this message by themselves.
The consortium decide to implement the final approach described in question 1, using Elgamal public key encryption with the following parameters: (p, g) = (103, 5). Aldebaran’s public key is pkA = 51, Borealis’ public key is pkB = 55 and Chandra’s public key is pkC = 38. For each of the following questions, you may use an online tool or python to compute modular exponentiation and reduction, but show your working. (Hint: use the pow(x,y,z) function in python to compute x y (mod z), or using WolframAlpha, query “xˆy mod z ’’.) (a) Aldebaran wishes to send a message m = 33 to Borealis. i. (2 marks) Confirm whether or not Aldebaran’s public key corresponds to the secret key skA = 7. ii. (5 marks) In the first step, Aldebaran must compute the Elgamal encryption (c1, c2) = Enc(pkB, m). Suppose during encryption, Aldebaran randomly samples a = 33, as in where c1 = g a . What is (c1, c2)? Note: Aldebaran will perform the rest of the steps to convey this message by themselves.
Which of the following keys is used by the recipient to decrypt a message encrypted using asymmetric encryption algorithm?Group of answer choicesReceiver’s public keySender’s private keySender’s public keyReceiver’s private key
Which encryption algorithm is classified as symmetric?1 pointA) RSAB) ECCC) AESD) Diffie-Hellman
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.