TNH TON IM TRN NG CONG ELLIPTIC

Mt kha cnh quan trng trong vic nghin cu cc ng cong elliptic l ngh ra mt cch hiu
qu tnh im trn ng cong. Trong l thuyt s chng ta c mt h qu quan trng trong vic
gii quyt cc phng trnh Diophantine, lin quan n mt m v cho php chng ta s dng
hiu qu s kh khn ca bi ton logarit ri rc (Discrete Logarithm Problem DLP) cho nhm
E(Fq), ca ng cong elliptic trn trng hu hn Fq, vi q = pk v p l s nguyn t. DLP c
bit n l phng php c s dng rng ri cho public key

1 Phng php tip cn tnh cc im trn ng cong ellip

C mt s phng php cho vn .
Mt s thut ton s dng thc t l nhm ca dng E(Fp) phi tun theo mt nh l quan
trong l Hasse, m tip gip vi s im c xem xt. nh l Hasse ni rng nu E l mt
ng cong elliptic trn trng hu hn Fq, th s lng ca E(Fp) tha mn:
E Fq q 1 2 q

2 Naive approach
Naive approach tnh cc im, l km tinh t nht, lin quan n vic chy qua tt c
cc phn t ca trng Fq v kim tra ci no tha mn dng Weierstrass ca ng cong elliptic.
y 2 x 3 Ax B
V d: