RSA algorithm

(Rivest-Shamir-Adleman)

Submitted by:
Cauan, Gerry Boy
Canceran, Gean Rose
Constantino, Sharmane
Callueng, Dave
Guingab, Arlene Mae
 Guiyab,Asley Gale

Submitted to:
Dr. Allen M. Paz

RSA algorithm (Rivest-Shamir-Adleman)

RSA is a cryptosystem for public-key encryption, and is widely used for s ecuring
sensitive data, particularly when being sent over an insecure network such
as the Internet.

RSA was first described in 1977 by Ron Rivest, Adi Shamir and Leonard
Adleman of the Massachusetts Institute of Technology. Public-key cryptography,
also known as asymmetric cryptography, uses two different but mathematically
linked keys, one public and one private. The public key can be shared with
everyone, whereas the private key must be kept secret.

The RSA cryptosystem

First published:
Scientific American, Aug. 1977.
(after some censorship entanglements)
Currently the work horse of Internet security:
Most Public Key Infrastructure (PKI) products.
SSL/TLS: Certificates and key-exchange.
Secure e-mail: PGP, Outlook,

The RSA trapdoor permutation

Parameters: N=pq. N 1024 bits. p,q 512 bits.

e encryption exponent. gcd(e, j(N) ) = 1 .
Permutation: RSA(M) = Me (mod N) where MZN
Trapdoor: d decryption exponent.
Where ed = 1 (mod j(N) )
Inversion: RSA(M)d = M (mod N)
Assumption:
no efficient alg. can invert RSA without trapdoor.

Textbook RSA is insecure

Textbook RSA encryption:

public key: (N,e) Encrypt: C = Me (mod N)
private key: d Decrypt: Cd = M (mod N)
(M ZN )
Completely insecure cryptosystem:
Does not satisfy basic definitions of security.
Many attacks exist.
A simple attack on textbook RSA

Session-key K is 64 bits. View K {0,,264}

Eavesdropper sees: C = Ke (mod N) .
Suppose K = K1K2 where K1, K2 < 234 . (prob. 20%)
Then: C/K1
e = K2
e (mod N)
Build table: C/1e, C/2e, C/3e, , C/234e . time: 234
For K2 = 0,, 234 test if K2
e is in table. time: 23434
Attack time: 240 << 264

Common RSA encryption

Never use textbook RSA.

RSA in practice:
Explaining RSA's popularity

RSA derives its security from the difficulty of factoring large integers that are the
product of two large prime numbers. Multiplying these two numbers is easy, but
determining the original prime numbers from the total -- factoring -- is considered
infeasible due to the time it would take even using todays super computers.