search
Log In
0 votes
127 views

in Computer Networks 127 views
0
$3599=59*61$

$\phi(n)=(59-1)*(61-1)=3480$

$d*e\equiv (1)mod(3480)$

After solving a lot

$d = 3031$
0
i got d=449. after that how did we get 3031 i need to understand that?
0
(449*31)3480 is not 1
0
its d= -449 so it will be 3480-449= 3031
0

multiplicative inverse

Please log in or register to answer this question.

Related questions

1 vote
4 answers
1
252 views
DH key exchange algorithm is used to establish a session between sender and receiver with n=23 and g=5. The sender's secret key is 6 and the receiver's secret key is 15. What is the secret key between the receiver and sender? Please explain with solution P.S: Answer is given as 2
asked Aug 18, 2018 in Computer Networks Kalpataru Bose 252 views
0 votes
2 answers
2
328 views
Consider the following services in network security: 1. Authentication of message 2. Integrity 3. Privacy 4. Non repudiation Which of the security services is/are not provided by digital signature?
asked Apr 30, 2018 in Computer Networks Kartavya Kothari 328 views
0 votes
0 answers
3
200 views
If p is any prime number such that a p-1 =r (mod p) and p=3 , a=6 then value of r is ________________
asked Jan 30, 2018 in Computer Networks Agam 200 views
...