ABSTRACT
Where, a,b∈Fp, 4a3+27b2≠0 , set E (Fp) include all at this point on the elliptic curve, (x,y) ∈Fp, there is a point O at infinity. There is a point G = (xG, yG). Mobile user can choose a random integer dA∈[1,N-1] as the private key. According to QA=dA×G, its public key can be calculated. It can be proved that calculation from dA and G to QA is easy, but it is difficult from QA to dA, it is difficulty of discrete logarithm. It can guarantee the security of secret key.
