The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
248 views

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?

asked in Computer Networks by (353 points)
edited by | 248 views

Please log in or register to answer this question.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

40,976 questions
47,609 answers
146,779 comments
62,342 users