BetterWang

November 14th, 2003, 10:42

ECC curve E(Fp) y^2 = x^3 + a x + b (mod p)

a point G on the curve.

n points on the the curvie.

private key q and k, with

q*G=0 infinite; k*G=K

first question: is q == n ?

2nd : how to generate q after i choose a b p & G

enctypt and decrypt has the same compute work to do?

3rd : what different with calculate q and k

they both calculate from G, can bruteforce q and k in the same time?

a point G on the curve.

n points on the the curvie.

private key q and k, with

q*G=0 infinite; k*G=K

first question: is q == n ?

2nd : how to generate q after i choose a b p & G

enctypt and decrypt has the same compute work to do?

3rd : what different with calculate q and k

they both calculate from G, can bruteforce q and k in the same time?