Register

Ace Test Series: Computer Networks - RSA Algorithm

• edited by
932 views

1 Answer

0 0 votes
Here p = 61 , q = 53

Φ(n) = Φ(p*q)

        = Φ(p) * Φ(q)

        = (p-1)*(q-1)  = 40

Here Given public key = 7

private key d will be

7*d = 1 mod Φ(n)

7 *d = 1 mod 40

Then d = 23.
Voting & Accepting an answer helps improve the community
← Previous · dbms bookNext → · ACE TEST SERIES QUES...
← Previous in category · #Self DoubtNext in category → · Pure ALOHA
Position:
Show:

Related questions

2 2 votes
0 0 answers
1.3k
1.3k views
Ashish Sharma 3 asked Jan 12, 2018
1,335 views
Cryptography - RSA Algorithm
In RSA Algorithm, we have public key(e,n) and private key(d,n).Sender side we encrypt plain text P as an integer between 0 and n-1 as follows:$P^{e}modn$and send it.At re...
2 2 votes
2 answers 2 answers
2.8k
2.8k views
dragonball asked Jan 4, 2018
2,766 views
RSA Public key Cryptosystem
Plz tell me how to solve this .I am feeling problem o calculate 10 = p^5 mod 35 . How to solve this type of question quickly.
1 1 vote
0 0 answers
621
621 views
charul asked Jan 7, 2018
621 views
MadeEasy Test Series: Computer Networks - Network Security
Please explain
0 0 votes
1 1 answer
885
885 views
Shivi rao asked Dec 12, 2017
885 views
MadeEasy Test Series: Computer Networks - Network Security
s1 onlys1 and s2s2,s3,s4none of these