RSA(public key encryption, continued)

• Express message M as a number between 1 and N *

• Compute EncRSAN,e(M) = Me mod N

• Compute DecRSAp,q,d(Me) = (Me)d = M mod N

• Assumed hard: factoring, discrete logs modulo N

Previous slide

Next slide

Back to first slide

View graphic version