Khoa Khoa hc & K thut my tnh

Trng H Bch Khoa TP.HCM

Cryptography and Network Security

Tm tt gii thut RSA

Hieu Nguyen
Ngy 24 thng 9 nm 2014

Thut ton RSA c xut bi Rivest, Shamir v Adleman.

Gi p v q l hai s nguyn t ln ngu nhin phn bit.
Modun n l tch ca hai s nguyn t ny:
n = pq
Hm phi Euler (Eulers totient function) ca n cho bi:
(n) = (p 1)(q 1)
Chn mt s 1<e<(n) sao cho:
gcd(e, (n)) = 1
v tnh d vi cng thc:
d = e1 mod (n)
Vic m ha c thc hin bng cch tnh:
C = M e (mod n)

vi M l plaintext, C l ciphertext tng ng ca M.

T C, M c tnh bng cng thc:
M = C d (mod n)
V d:
Chng ta xy dng mt h thng m ha RSA nh sau: Cho p = 11, q = 13, v tnh
n = pq = 11.13 = 143
(n) = (p 1)(q 1) = 10.12 = 120
S m cng khai e c chn tha 1 < e < (n) v gcd(e, (n)) = 1
Chn e = 17 tha rng buc. Tnh d s dng cng thc:
d = e1 mod (n) = 171 mod 120 = 113
(S dng thut ton Euclid m rng hay bt c thut ton no khc tnh phn t
nghch o modun)
Ngi dng cng b s m cng khai e v modun n: (e,n) = (13,143), v gi b mt cc
gi tr sau: d = 113, p = 11, q = 13.
Tin trnh m ha/gii m tiu biu c thc hin nh sau:
M ha: M = 50
C = M e (mod n)
C = 5017 (mod 143) = 85
Gii m: C = 85
M = C d (mod n)
M = 85113 (mod 143) = 50