參考文獻

[1]GB/T 15843.1-1999 信息技術 安全技術 實體鑒別 第1部分：概述

[2]GB/T 25069-2010 信息安全技術 術語

[3]Agnew G, Beth T, Mullin R,et al. 1993. Arithmetic operations in GF(2m). Journal of Cryptology,(6):3~13

[4]Agnew G, Mullin R, Onyszchuk I,et al. 1991. An implementation for a fast public-key cryptosystem.Journal of Cryptology, (3):63~79

[5]ANSI X9.62-1999 Public Key Cryptography For The Financial Services Industry：The Elliptic Curve Digital Signature Algorithm (ECDSA). American National Standards Institute

[6]ANSI X9.63-2001 Public Key Cryptography for the Financial Services Industry:Key Agreement and key Transport Using Elliptic Curve Cryptography .American Nation Standard Institute

[7]Brickell E,Gordon D,Mccurley K,et al.1993. Fast Exponentiation with precomputation. Advances in Cryptology - EUROCRYPT’92. LNCS 658. Berlin: Springer-Verlag .200~207

[8]Blake I,Seroussi G,Smart N.1999. Elliptic Curves in Cryptography. Cambridge: Cambridge University Press

[9]ISO/IEC 15946-1: 2002 Information technology—Security techniques—Cryptographic techniques based on elliptic curves ? Part 1:General

[10]ISO/IEC 15946-2: 2002 Information technology—Security techniques—Cryptographic techniques based on elliptic curves ? Part 2:Digital signatures

[11]ISO/IEC 15946-3: 2002 Information technology—Security techniques—Cryptographic techniques based on elliptic curves ? Part 3:Key establishment

[12]ISO/IEC 15946-4: 2003 Information technology—Security techniques—Cryptographic techniques based on elliptic curves ? Part 4:Digital signatures giving message recovery

[13]ITU-T Recommendation X.680 Information Technology—Abstract Syntax Notation One (ASN.1):Specification of Basic Notation(eqv ISO/IEC 8824-1)

[14]ITU-T Recommendation X.681 Information Technology—Abstract Syntax Notation One (ASN.1):Information Object Specification(eqv ISO/IEC 8824-2)

[15]ITU-T Recommendation X.682 Information Technology—Abstract Syntax Notation One (ASN.1):Constraint Specification(eqv ISO/IEC 8824-3)

[16]ITU-T Recommendation X.683 Information Technology—Abstract Syntax Notation One (ASN.1):Parametrization of ASN.1 Specifications(eqv ISO/IEC 8824-4)

[17]ITU-T Recommendation X.690 Information Technology—ASN.1 Encoding Rules: Specification of Basic Encoding Rules (BER), Canonical Encoding Rules (CER) and Distinguished Encoding Rules (DER) (eqv ISO/IEC 8825-1)

[18]ITU-T Recommendation X.691 Information Technology—ASN.1 Encoding Rules: Specification of Packed Encoding Rules (PER) (eqv ISO/IEC 8825-2)

[19]Knuth D. 1981. The Art of Computer Programming .v.2. 2nd ed, Reading(MA): Addison-Wesley

[20]Koblitz N.1987. Elliptic curve cryptosystems.Mathematics of Computation, (48)203~209

[21]Lehmann F , Maurer M, Müller V, et al. 1994. Counting the number of points on elliptic curves over finite field of characteristic greater than three.In:Adleman L,Huang M D,ed. Algorithmic Number Theory. LNCS 877.Berlin: Springer-Verlag.60~70

[22]Lidl R,Niederreiter H.1987. Finite Fields. Cambridge:Cambridge University Press

[23]Mceliece R.1987. Finite Fields for Computer Scientists and Engineers. Boston:Kluwer Academic Publishers

[24]Menezes A.1993. Elliptic Curve Public Key Cryptosystems.Boston: Kluwer Academic Publishers

[25]Menezes A,Okamoto T, Vanstone S.1993. Reducing elliptic curve logarithms to logarithms in a finite field.IEEE Transactions on Information Theory, 39:1639~1646

[26]Müller V.1995. Counting the number of points on elliptic curves over finite fields of characteristic greater than three:[Doctorate Dissertation].Saarlandes: University of Saarlandes

[27]Pollard J.1978. Monte Carlo methods for index computation mod p. Mathematics of Computation, 32:918-924

[28]Satoh T,Araki K.1998. Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves.Comment.Math.Univ.St.Paul.,47(1):81~92

[29]Satoh T.2000. The canonical lift of an ordinary elliptic curve over a finite fields and its point counting. J.Ramanuijan Math.Soc.,15:247~270

[30]Satoh T. 2002. On p-adic point counting algorithms for elliptic curves over finite fields. In:Fieker C,Kohel D R,eds. Algorithmic Number Theory,LNCS 2369,Berlin: Springer-Verlag,43~66

[31]Satoh T,Skjernaa B ,Taguchi Y.2003. Fast computation of canonical lifts of elliptic curves and its application to point counting. Finite Fields Appl.,9:89~101

[32]Schoof R.1985. Elliptic curves over finite fields and the computation of square roots mod p.Mathematics of Computation, 44(170):483~494

[33]Schoof R.1995. Counting Points on Elliptic Curves over Finite Fields. Jl. de Theorie des Nombres de Bordeaux, 7:219~254

[34]Silverman J.1986. The Arithmetic of Elliptic Curves. Berlin: Springer-Verlag , GTM 106

[35]Smart N.1999. The discrete logarithm problem on elliptic curves of trace one. Journal of Cryptology,12(3):193~196

[36]ГОСТ Р 34.10-2001 ИНФОРМАЦИОННАЯ ТЕХНОЛОГИЯ—КРИПТОГРАФИЧЕСКАЯ ЗАЩИТА ИНФОРМАЦИИ—Процессы формирования и провepки элeктронной цифровoй подписи. ГОСУДАРСТВЕННЫЙ СТАНДАРТ РОССТИЙСКОЙ ФЕДЕРАЦИИ