in Computer Networks
2,055 views
2 votes
2 votes
Two gate aspirants talking to each other use the RSA algorithm to encrypt their messages. They encrypt the message character by character. The value of p, q and d are 5, 17 and 13 respectively, where p, q and d are their integers having usual meaning in the RSA algorithm. Assume that corresponding cipher characters are placed in their corresponding plain text character places. Also each character is converted to ASCII value before applying RSA (ASCII value of A, B, C,... and so on are 1, 2, 3,..., respectively).The sum of integers in cipher text for corresponding characters in plain text: “IIT” _________ .
in Computer Networks
2.1k views

1 comment

I am getting 198(I=59,I=59,T=80)
0
0

3 Answers

6 votes
6 votes
Best answer

SUMMARY OF RSA :

  1. Choose two very large prime numbers p and q.
  2. Multiply them n = p X q.
  3. Calculate Θ=(p -1) X (q - 1).
  4. Choose a random integer e. Then calculates d so that d x e= 1 mod Θ
  5.  e and n are public;  Θ and d are private.

In given problem p= 5, q=17 then n= 85

Θ =(5-1)*(17-1)= 4*16 =64

d x e= 1 mod Θ means 13 x e = 1 mod 64

Since 64*1+1 =65 is a multiple of 13 (Since 13 x 5 =65) , e=5


Sender encrypts as: C=Pe (mod n)

Given plain text is IIT, ciphertext is

C( I) = C (9) = 9 ^5 (mod 85) = 59

C(T)= C(20) = 20 ^5 (mod 85) =5

Sum of integers = 59+59+5 =123

edited by
by

8 Comments

I think e should be 5. Right?
1
1
Yes.. Corrected.!!!

Thank u for pointing out ..:)
0
0
yes e will be 5

so 9^5 mod 85 = 59

and 20^5 mod 85 = 5

so answer will be 59+59+5 =123 is answer
1
1
public key is used for encryption?? then how come receiver will decrypt it when secret key is also with sender only?

i mean we should have encrpted I with

C(I) = C(9) = 9^13 mod 85

????
0
0

If sh!va uses RSA he announces e and n to the public; but keeps Θ and d secret.

Anybody can send message to sh!va with encryption as: C=Pe (mod n)

Sh!va  decrypts it  as: P= Cd(mod Θ)

I hope concept is clear now

0
0
yes.. :)
0
0
Is there any trick to solve remainders including higher power?
0
0
inverse multiplication
0
0
0 votes
0 votes
I got 123...
by
0 votes
0 votes
123 is the answer. e=5 as 5*13 mod 64=1  for I = 9^5mod 85=59, for T= 20^5mod 85= 1, sum = 123 (59+59+1)

2 Comments

20^5 mod 85 = 1, then why we are writing it as 5 .. please reply
0
0

$20^{5}=3200000 \text{mod} 85=5$

 

 

 

0
0