The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+2 votes

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 receiver side**, we do the following:

$(P^{e}modn)^{d}modn = P^{ed}modn$

$P^{ed}modn= P$

But according to Euler's Theorem:

The following equation holds if 'a' and 'n' are coprimes:

$a^{\phi (n)t+1)}modn= a$

So, what I am confused about is that while encrypting the message P we are taking it as as integer between 0 and n-1. So, the P may not be coprime to n. Then how does the algorithm work?

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 6k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 16

40,976 questions

47,609 answers

146,779 comments

62,342 users