Security analyse of elliptic curve cryptosystem
Zhou Ming-tian · Jisuanji gongcheng yu sheji · 2006
The security basis of the elliptic curve crypto system is analyzed. It is found that there is no efficient method to solve the discrete logarithm problem of non-supersingular with big prime factor over finite field. The high security elliptic curve cryptosystem is constructed by select the appropriate selection of high security elliptic curve over finite field.