Public Key Cryptography

Details

Details

nEncryption: C = M^e ( modulo n )

Decryption: M = C^d ( modulo n )

Decryption: M = C^d ( modulo n )

nwhere:

M = the plain-text message expressed
as an integer number.

C = the encrypted message expressed
as an integer number.

n = the product of two randomly
selected, large primes p and q.

d = a large, random integer
relatively prime to (p-1)*(q-1).

e = the multiplicative
inverse of d, that is:

( e * d )__=__ 1 ( modulo ( p - 1 ) * ( q - 1 ) )

( e * d )

nThe public key is the pair of numbers ( n, e ).

The private key is the pair of numbers ( n, d ).

The private key is the pair of numbers ( n, d ).