4Bijan Ansari,Huapeng Wu.Parallel scalar multiplication for ellipticcurve cryptosystems[].CommunicationsCircuits and SystemsProceedings International Conference on.2005
二级参考文献17
1[2]V.Miller,Uses of elliptic curves in cryptography,Advances in Cryptology-CRYPTO' 85.LNCS218,Santa Barbara,Calif.,Springer-Verlag,1986,417-426.
2[3]Multiprecision Integer and Rational Arithmetic C/C++ Library(MIRCAL),available at http://indigo.ie/～msoott/.
3[4]A.Menezes,T.Okamnoto,S.Vanstone,Reducing elliptic curve logarithms to logarithms in a finitoe field.IEEE Trans.on Information Theory,1993,39(5),1639-1646.
4[5]N.Koblitz,A Course in Number Theory and Cryptogralphy,2nd e7ition.Spring-Verlag.1994.Ch.6.
5[6]N.Koblitz,Algebraic Aspects of Cryptography,Algorithms and Computation in Math.Editors:E.Becker,M.Bronstein,H.Cohen,3(1998),Berlin Heidelberg,Springer-Verlag,1998,Ch.6.
6[7]IEEE P1363,Standard Specifications for Public-Key Cryptography,Ballot Draft.1999,Drafts available at http://indigo,ie/～msoott/.
7[8]R.Schoof,Elliptic curves over finite fields and the computation of square roots modp.Math.Comp.,1985,44(170),483-494.
8[9].T.Izu,J.kogure,M.Noro,K.Yokoyama,Efficient Implementation of Sehoof's Algorithm.Asi acrypt'98,Berlin Heidelberg,Springer-Verlag,1998,66-79.
9[10]Lehmann,Maurer,Mueller,Shoup ,Counting the number of points on elliptic curves over finite fields of characteristic greater than three,Proc.1st Algorithmic Number Theory Symposinn (ANTS),Berlin Heidelberg,Springer-Verlag,1994,LNCS877,60-70.
10[1]N.Koblitz,Elliptic curve cryptosystems,Mathematics of Computation,1987,45(177),203-209.
