Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
6Activity
0 of .
Results for:
No results containing your search query
P. 1
RSA

RSA

Ratings: (0)|Views: 83 |Likes:
Published by mahahussien_874778

More info:

Published by: mahahussien_874778 on Jun 23, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

01/26/2011

pdf

text

original

 
+ +
RSA Security
RSA was invented by Rivest, Shamir andAldleman in 1978 (the 2003 winners oTurning award).
RSA is the
best known
public-key cryp-tosystem.
RSA is the first practical realisation of therevolutionary notion of public-key cryptog-raphy invented by Diffie and Hellman in1976.
+ 1
 
+ +
RSA Cryptosystem
Problems Used:
Factorisation. The mod-ulus
=
p
×
q
is public, the primes
p,q
aresecret.
Message Space:
M
=
.
Cryptogram Space:
C
=
.
Public Key:
A random integer
e
;gcd(
e,ϕ
(
)) = 1.
Secret Key:
An integer
d
such that
d
·
e
1 (mod (
 p
1)(
q
1)).
Encryption:
c
=
e
(
m
)
m
e
(mod
).
Decryption:
m
=
D
d
(
c
)
c
d
(mod
).
+ 2
 
+ +
Factorisation
=
breaking RSA
If you can factor
, how can you breakRSA?
Attack:
Find
p
and
q
such that
=
pq
Compute
ϕ
(
) = (
 p
1)(
q
1)
Compute the secret key
d
from the pub-lic key
e
and
ϕ
(
). That is, the at-tacker computes
d
=
e
1
(mod
ϕ
(
))using the Euclidean algorithm.
It has been
conjectured
that breaking RSAis polynomially equivalent to factoring
,but this remains unproved (note:
two prob-lems are said to be
polynomially equivalent 
if theexistence of a polynomial-time algorithm for eitherproblem implies the existence of a polynomial-timealgorithm for the other problem
).
+ 3

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->