00:01
Hello everyone, let's solve the given question.
00:02
So, as according to the given question, p is equals to 7, q is equals to 11, e is equals to 43, n is equals to 77.
00:14
Now, as according to the part a, 2, encrypt messes m in rsa, c is equals to m power e mod of n.
00:32
Then we are having m is equals to 5, e is equals to 43, n is equals to 77.
00:39
Then we get c is equals to 543 mod 77 is equals to 26.
00:48
Now, moving to the part b of this question, then here de is equals to 1 mod p minus 1, q minus 1.
01:00
Then we get 43 d is equals to 1 mod 7 minus 1, 11 minus 1...