00:01
Hello student here, ciphertext 3 .10 is given, public key e equal to 5 and n equal to 35 all are given and we have to apply the rsa algorithm and with the help of this algorithm we have to find the plaintext m.
00:14
Here the private key is d so i have the formula d to e modulus operator phi n equal to 1.
00:22
Phi n is a euler's totient function which is euler's totient function.
00:29
Now, prime vector of n 35 equal to which are p phi n p phi cube 7.
00:36
So, here phi n equal to p minus 1 into q minus 1.
00:41
So, here i will use p minus 1 phi minus 1 into 7 minus 1 which comes 24.
00:46
So, phi n equal to 24.
00:48
So, i can put the value here in d into e modulus operator phi n equal to 1 in this.
00:56
So, here phi n i put here 24.
00:59
So, here my equation becomes d into 5 modulus operator 25 equal to 1 and now my d is here 5.
01:09
D is here 5 after this calculation how d equal to 5 i put the value one by one d equal to 1 d equal to 2 d equal to 3...