recategorized by
11,867 views

2 Answers

Best answer
3 votes
3 votes

Given p=3,q=11. n=(p X q) = (3 X 11)=33
   m=(p-1)X(q-1) = (2 X 10)=20
Find a small odd integer e, that is relatively prime to m.
If e=3, then GCD(3,20)=1. e should be small and prime and so we let e=3.
d is given, d=7.
Public key = (e,n). (Values of e and n are known).
To encrypt a message, we apply the public key to the function 
E(s) = se(mod n)

where s is the given message and e and n represent the public key integer pair. In the above question, the plain text M = 5. Plain text needs to be encrypted using the above formula.
   =53(mod 33)
   = 125 (mod 33)
   = 26
As a result, the encrypted message E(s) = 26. This is what gets transmitted. 

Reference: http://ugcnetsolved-computerscience.blogspot.in/2015/11/rsa-algorithm.html

selected by
1 votes
1 votes

Answer B) 5

p=3

q=11

z=(p-1)⨉(q-1) =20

Now we know e⨉d=1 mod z  [here d=7]

                    e⨉7 = 1 mod 20

           then,         e=3        

M' =Me mod 20

   =53 mod 20

  =5        

Answer:

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Jul 13, 2016
2,561 views
A cryptarithmetic problem of the typeCan be solved efficiently usingdepth first techniquebreadth first techniqueconstraint satisfaction techniquebidirectional technique
0 votes
0 votes
1 answer
2
1 votes
1 votes
1 answer
4
go_editor asked Jul 12, 2016
2,163 views
Which are the classifications of data used in Mobile Applications?Private data, Shared data, User dataPublic data, User data, Virtual dataPrivate data, Public data, Share...