TIU LUN: An Ninh Mng Vin Thng

TI: Mt M ng cong elliptic (ECC) & DH Giang vin: V Trng Thnh

Sinh vin thc hin: Bi xun Trng Trng vn Tun Mai Vn Ho Thnh i Nguyn Thnh ng H Tun Quang H Ngc c Nguyn Tun Anh Nguyn Mnh Ton

Lp

: D10VT5

H Ni 3- 2014

Gii thiu chung

Trong hu ht lch s mt m hc, kha dng trong cc qu trnh m ha v gii m phi c gi b mt v cn c trao i bng mt phng php an ton khc (khng dng mt m) nh gp nhau trc tip hay thng qua mt ngi a th tin cy. V vy qu trnh phn phi kha trong thc t gp rt nhiu kh khn, c bit l khi s lng ngi s dng rt ln. Mt m ha kha cng khai gii quyt c vn ny v n cho php ngi dng gi thng tin mt trn ng truyn khng an ton m khng cn tha thun kha t trc. Hin nay, h mt RSA l gii thut kho cng khai c s dng nhiu nht, nhng h mt da trn ng cong Elliptic (ECC) c th thay th cho RSA bi mc an ton v tc x l cao hn. u im ca ECC l h mt m ny s dng kho c di nh hn so vi RSA. T lm tng tc x l mt cch ng k, do s php ton dng m ho v gii m t hn v yu cu cc thit b c kh nng tnh ton thp hn, nn gip tng tc v lm gim nng lng cn s dng trong qu trnh m ho v gii m.

Ni dung
Mt M ng cong elliptic (ECC) Trao i kha DiffieHellman
M ng cong Elip thc ng cong Elip hu hn M ng cong Elip(ECC) ECC Diffie Hellman ECC m v gii m An ton ECC

Khi to Diffie Hellman Trao i kho

I. M ng cong ellptic (Elliptic Curve Cryptography)

a s m cng khai s dng s hc s nguyn hoc a

thc rt ln bc cao Buc phi ti phn quan trng vo kho nh v x l kha v mu tin C cch khc l dng ng cong Elip C cng an ton, nhng vi kch thc bit nh hn

I. M ng cong Ellip

I. M ng cong ellptic
a). M ng cong Elip thc

I. M ng cong Ellip

I. M ng cong ellptic.
c. M ng cong Elip (ECC)
Php cng ECC ging php nhn modulo ECC lp php cng ( php nhn h s ) ging nh php

ly tha modulo Cn gii bi ton tng ng vi bi ton logarit ri rc Q=k.P , trong P, Q l 2 im ca ng cong Elip D dng tnh Q, nu cho trc P, k Rt kh tm k, nu cho trc P, Q. c bit n nh bi ton logarit ng cong Elip ECC php tnh cng tng t ca modulo nhn

I. M ng cong ellptic.
Xt v d : E11(1,6):

Cc php cng sau y thc hin trong Modulo 11.

I. M ng cong ellptic.
d) ECC Diffie Hellman

Chng hn da trn c s kh ca bi ton tm h s lin h gia hai im nh trn, ngi ta a ra s trao i kho ECC Diffie Hellman ging nh trao i kho Diffie Helman thng thng. y php ly tha trong Modulo thng thng c thay bng php nhn mt im vi h s trong ECC v php logarit ri rc c thay bng php ton cho 2 im tm h s lin h gia chng. Bi ton sau l bi ton kh xc nh an ton ca s trao i cng khai kho chung.

I. M ng cong ellptic.
d) ECC Diffie Hellman

- Nhm ngi dng chn chung mt ng cong Elip ph hp Ep(a,b) - Chn im c s G=(x1,y1) vi bc ln, tc l n ln sao cho nG = O - Hai ngi s dng A v B chn kho ring ca mnh: nA< n, nB< n - Sau h tnh cc kho cng khai ca A v B: PA=nAG,PB=nBG. V cho cng b cng khai PA v PB. - Hai ngi s dng dng chung kho mt: K=nAnBG. - Mi ngi u c cch tnh kho chung bng cch ly kho ring ca mnh nhn vi kho cng khai ca i tc: K=nAPB, K=nBPA

I. M ng cong ellptic
e) ECC m v gii m

C mt s cch dng ng cong Elip to m cng khai, ta xt cch n gin nht sau: Trc ht nhm ngi s dng cn phi thng nht chn mt ng cong Elip ph hp v mt im G ging nh trong trao i kho ECC Diffie Hellman. Mi bn tin M c coi nh mt im PM trn ng cong Elip .

I. M ng cong ellptic

I. M ng cong ellptic
f) An ton ECC

Da trn bi ton tm h s lin h gia hai im trn ng cong Elip gi l bi ton logarit trn ng cong Elip. Phng php nhanh nht gii bi ton trn bit l Pollard rho method. Bi ton ny tng ng vi bi ton phn tch ra tha s, nhng c th s dng kch thc kho nh hn nhiu, chng hn so vi RSA. Ngi ta chng minh c rng vi di kho bng nhau cc tnh ton ni chung l tung ng. Vy vi an ton nh nhau ECC c nhiu u im v khng gian lu tr v tnh an ton i km.

I. M ng cong ellptic
f) An ton ECC

Da trn bi ton tm h s lin h gia hai im trn ng cong Elip gi l bi ton logarit trn ng cong Elip. Phng php nhanh nht gii bi ton trn bit l Pollard rho method. Bi ton ny tng ng vi bi ton phn tch ra tha s, nhng c th s dng kch thc kho nh hn nhiu, chng hn so vi RSA. Ngi ta chng minh c rng vi di kho bng nhau cc tnh ton ni chung l tung ng. Vy vi an ton nh nhau ECC c nhiu u im v khng gian lu tr v tnh an ton i km.

I. M ng cong ellptic
Bng so snh ECC & RSA
ECC 160 RSA 1024 ECC-192 RSA-1536 ECC-224 RSA-2048

Thi gian (ms) S lnh thc hin/s So snh thi gian thc hin So sanh di kha

3.69 271.3

8.75 114.3

3.87 258.1

27.47 36.4

5.12 195.5

56.18 17.8

2.4:1

7.1:1

11:1

1: 6.4

1:8

1:9.1

II. Trao i kho Diffie Hellman

y l phng php thc t trao i cng khai cc kho mt N thc y vic nghin cu xut cc m kho cng khai. S

c s dng trong nhiu sn phm thng mi. L s trao i kho mt dng kho cng khai: + Khng th dng trao i mu tin bt k. + Tuy nhin n c th thit lp kho chung. + Ch c hai i tc bit n. + Gi tr kho ph thuc vo cc i tc + Da trn php ton ly tha trong trng hu hn + an ton da trn kh ca bi ton tnh logarit ri rc

II. Trao i kho Diffie Hellman

L s trao i dng kha cng khai

Khng th dng trao i mu tin bt k

Tuy nhin n c th hit lp kha chung Ch c hai i tc bit n

Gi tr kha ph thuc vo cc i tc ( v cc thng tin

v kha cng khai v kha ring ca h) Da trn php ton ly tha trong trng hu hn ( modulo theo s nguyn t hoc a thc ) an ton da trn kh ca bi ton tnh logarit ri rc (ging bi ton phn tch ra tha s )

II. Trao i kho Diffie Hellman

II. Trao i kho Diffie Hellman

II. Trao i kho Diffie Hellman

b) Trao i kho Diffie Hellman

II. Trao i kho Diffie Hellman

II. Trao i kho Diffie Hellman

ngi s dng c th to ra kha DH ring / cng khai

ngu nhin mi khi h giao tip. ngi s dng c th to ra mt kha ring / cng khai DH no c bit n v cng b trong mt th mc, sau tham kho kin v c s dng giao tip vi h mt cch an ton. C hai u rt d b tn cng Xc thc nhng cha kha l cn thit.

Kt lun

Vic s dng ECC mang li nhng hiu qu sau: tng tc , yu cu kh nng tnh ton thp hn, tit kim di thng ng truyn, tng hiu qu lu tr, gim di cc chng nhn...Cc u im trn ca h mt ECC c th pht huy hiu qu trong cc ng dng m ng truyn, kh nng tnh ton, tc v lu tr b hn ch. V cc ng dng c th hin rt hiu qu trong thng mi in t, web servers