RSA

• pK = (N,p), sK = (N,s) all integers

  • M is a number less than N (break message)
  • e(pK,M) = Mp mod N
  • d(sK,M’) = M’s mod N

• d(sK,e(pK,M)) = Mps mod N

• use 3 large (100 bits) primes: s > x, y

N= xy & ps mod (x-1)(y-1) =1

Mps mod N = M

Previous slide

Next slide

Back to first slide

View graphic version