Separate HTML for Basic Foil 42 Some Math behind RSA Algorithm -I

Basic HTML version of Foils prepared May 19 99

Foil 42 Some Math behind RSA Algorithm -I

From Remarks on Internet and Java Security Basic Information Track Computational Science Course CPS616 -- Spring Semester 1999. by Geoffrey Fox, Mehmet Sen

RSA stands for inventors: Rivest Shamir and Adleman

Take a number n = p * q where p and q are primes

Choose a "suitable" number e

Public key is <e,n> and basic encryption algorithm takes message m to be encrypted and forms

c = me mod(n)

Decryption involves private key d which is found so that

d * e = 1 mod((p-1)(q-1))

Then m = cd mod(n)

As factorization is computationally infeasible (for n of 512 bits in length or more), this encryption cannot be broken.

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Wed May 19 1999