• edited by
1,891 views

2 Answers

4 4 votes

RSA

step 1 : n = p*q = 5*17 = 85

step 2: $\Phi (n)$ = (p-1)(q-1) = 4*16= 64

step3 : e*d mod $\Phi (n)$ = 1  [ use extended Euclidian Algorithm to find value of e ]
            e*13 mod 64 = 1 => e=5

Encryption

  1. Obtains the recipient B's public key (n, e).
  2. Represents the plaintext message as a positive integer m, 1 < m < n
  3. Computes the ciphertext c = me mod n.
  4. Sends the ciphertext c to RECEIVER

Deryption

  1. Uses his private key (n, d) to compute m = cd mod n.
  2. Extracts the plaintext from the message representative m.

[  given Encoding  : A-1 , B-2 , C- 3....Z-26 ]

I -> 9 => 95 mod 85 = 59 => (59-52 = 7) =>G
I -> 9 => 95 mod 85 = 59 => (59-52 = 7) =>G
T->20 =>205 mod 85 = 5 => E

Sum Of Integers In cipher Text  = 7+7+5 = 19

Good Read : https://gateoverflow.in/70939/ugcnet-aug2016-iii-30

0 0 votes

e=5 
encrypt key = pe mod phi(n)
phi(n) = 4*16=64
I is number 9
95mod64 = 41
T= 20
205mod64 = 0
IIT= 41 41 0 = 41+41+0 = 82
 

Position:
Show:

Related questions

1 1 vote
4 4 answers
1.4k
1.4k views
Kalpataru Bose asked Aug 18, 2018
1,351 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. ...
0 0 votes
2 2 answers
9.2k
9.2k views
Kartavya Kothari asked Apr 30, 2018
9,233 views
Consider the following services in network security:1. Authentication of message2. Integrity3. Privacy4. Non repudiationWhich of the security services is/are not provided...
1 1 vote
0 0 answers
624
624 views
0 0 votes
1 1 answer
893
893 views