The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

Please explain theorem in simplest way and solve example with explanation.

Using RSA algorithm what is the value of cipher test c if the plain text m=5 and P=3, q=11 & d = 7 ( if d not given how to find d ).

Using RSA algorithm what is the value of cipher test c if the plain text m=5 and P=3, q=11 & d = 7 ( if d not given how to find d ).

0 votes

Given Plain text (m)=5, P=3, Q=11

where P and Q are two prime integer

n=P*Q

n=3*11=33

Z=(P-1)*(Q-1)

Z=(3-1)*(11-1)=20

Now selecting the public key(i.e encryption key) E such that it is not a factor of (P-1) and (Q-1)

say E=3

Now selecting the private key (i.e the decryption key) D such that the following equation is true:

(D*E) mod Z =1

Say D=7

(7*3) mod 20 =1

For encryption calculating the cipher text (CT) from the plain text (PT) is as follows:

CT = (PT)^E mod n

CT = 5^3 mod 33

Cipher Text =26

Now Sender will send this cipher text (26) to the receiver

For decryption calculating the plain text PT from the cipher text CT as follows:

PT = (CT)^D mod n

= (26^7) mod 33

= 5

- All categories
- General Aptitude 1.6k
- Engineering Mathematics 7.5k
- Digital Logic 3k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6k
- Compiler Design 2.1k
- Databases 4.2k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 584
- Exam Queries 566
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,108 questions

53,221 answers

184,627 comments

70,462 users