# How to encrypt the number one using RSA?

for example: if we have public key : (5,221) and private key : (77,221) and we want to encrypt 1:

c(m) = (m)^p mod n
c(m)=(1)^77 mod 21 =1


so how to deal with that? is there some work around ?

• How to deal with what? The encryption of 1 is 1, so what? – fkraiem Aug 21 '17 at 1:29