26.01.2014 Views

MODERN CRYPTOGRAPHY

MODERN CRYPTOGRAPHY

MODERN CRYPTOGRAPHY

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

RSA: The Theory (1)<br />

n = pq where p,q are large primes<br />

Public key: (n,e) where (e,(p − 1)(q − 1)) = 1<br />

Encryption: for 0 ≤ m ≤ n − 1 c = m e modn<br />

Secret key: d where ed = 1 mod(p − 1)(q − 1))<br />

Decryption: m = c d modn<br />

IMA 2009 35

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!