3KOBLITZ N. Elliptic curve cryptosystems[J]. Mathematics of Computation, 1987, 48: 203-209.
4SCHOOF R. Elliptic curves over finite fields and the computation of square roots mod p[J]. Mathematics of Computation, 1985, 44: 483-494.
5POHLIG SC, HELLMAN ME. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance[J]. IEEE Transactions on Infornation Theory, 1978, 24: 106-110.
6董军武 裴定一.模多项式的系数特征[J].通信技术,2004,147:201-204.
7COUVEIGNES J-M, DEWAGHE L, MORAIN F. Isogeny Cycles and the Schoof-Elkies-Atkin algorithm[A]. Proceedings of ANTS-I, LNCS877[C], 1994.43-58.
8IZU T, KOGURE T, NORO M, et al.Efficient Implementation of Schoofs Algorithm[A]. Proceedings of the ASIACRYPT98[C]. Springer-Verlag, 1998. 66-79.
9WOODBURY AD, BAILEY DV, PAAR C. Elliptic Curve Cryptography on Smart Cards without Coprocessors[A]. Proceedings of CARDIS 2000[C]. UK:Bristol, 2000. 71-92.
10GUAJARDO J, BLUMEL R, KRIEGER U, et al.Efficient Implementation of Elliptic Curve Cryptosystems on the TI MSP 430x33x Family of Microcontrollers[A].KIM K. Proceedings of PKC2001[C]. Springer-Verlag, 2001.365-382.
