Fast multiplication on elliptic curves over small fields of characteristic two

Journal of Cryptology

Volumn 11, Issue 4, 1998, Pages 219-234

  Müller, Volker ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Characteristic two; Elliptic curves; Frobcnius expansion; Frobenius endomorphism; Multiplication

Indexed keywords

EID: 0011918550     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900045     Document Type: Article

References (12)

1. D. Fox, A.W. Rohm Effiziente Digitale Signatursystemc auf der Basis elliptischer Kurven, in Digitale Signaturen, P. Horster, ed., DuD Fachberichte, Vieweg, 1996, pp. 256-266.
2. |2] P. Kirsch Implementierung einer Arithmetik des Polynomrings GF(1)\X\ und des Körpers GF(2"), Diplomarbeit, Universität des Saarlandes, Saarbrücken, 1996.
3. N. Koblitz Elliptic Curve Cryptosystems, Math. Com/., 48 (1987), 203-209.
4. N. Koblitz CM-Curves with Good Cryptographic Properties, Advances in Cryptology-CRYPTO 91, Lecture Notes in Computer Science, No. 576, Springer-Verlag, Berlin, 1992, pp. 279-287.
5. LiDIA-A Library for Computational Number Theory, available per ftp from http//www.Informatik.tu-darmstadt.de/TIJ.
6. C.H. Lim, P.J. Lee More Flexible Exponentiation with Precomputation, Advances in CryptologyCRYPTO 94, Lecture Notes in Computer Science, No. 839, Springer-Verlag, Berlin, 1994, pp. 95-107.
7. W. Meier, O. Staffelbach Efficient Multiplication on Certain Nonsupersingular Elliptic Curves, Advances in Cryplologv-CRYPTO 92, Lecture Notes in Computer Science, No. 740, Springer-Verlag, Berlin, 1992, pp. 333-344.
8. [81 A. Menezes, T. Okamoto, S.A. Vanstone Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field, Proceedings of the 23rd ACM Symp. on Theory of Computing, 1991, pp. 1639-1646.
9. A. Menezes Elliptic Curve Public Key Cryptosystems, Kluwer, Dordrecht, 1993.
10. V.S. Miller Use of Elliptic Curves in Cryptography, Advances in Cryptology-CRYPTO 85, Lecture Notes in Computer Science, No. 218, Springer-Verlag, Berlin, 1986, pp. 417-426.
11. [II] S.C. Pohlig, M.E. Hellman An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance, IEEE Trans. Inform. Theory, 24 (1978), 106-110.
12. R. Schroeppel, H. Orman, S. O'Malley, O. Spatschek Fast Key Exchange with Elliptic Curve Systems, Advances in Cryptology-CRYPTO 95, Lecture Notes in Computer Science, No. 963, Springer-Verlag, Berlin, 1995, pp. 43-56.