Computing the number of points of elliptic curves over finite fields

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing the number of points of elliptic curves over finite fields

Full text

Pdf (322 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents

Bonn, West Germany

Pages: 179 - 182

Year of Publication: 1991

ISBN:0-89791-437-6

Authors

Johannes Buchmann	FB 14 Informatik, Universität des Saarlandes, D-6600 Saarbrücken, Germany
Volker Müller	FB 14 Informatik, Universität des Saarlandes, D-6600 Saarbrücken, Germany

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 46, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120718 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ChRo88	L. Charlap, D. Robbins: An elementary introduction to elliptic curves, CRD Expository Report No. 31, Institude for Defense Analyses Princeton, December 1988
	CCRo90	L. Charlap, R. Coley, D. Robbins: Enumeration of Rational points on elliptic curves over finite fields, preprint
	Hu87	D. HusemSller: Elliptic curves, Graduate texts in Mathematics 111, Springer-Verlag, 1987
	Ko86	N. Koblitz: Elliptic curve cryptosystems, Mathematics of Computation, 48 (1987), 203-209
	La78	S. Lang: Elliptic Curves, Diophantine Analysis, Springer-Verlag, 1978
	Li87	J. van der Lingen: Elliptic curves and factorization, Report 87-2 (1987), University of Amsterdam
	Me84	K. Mehlhorn: Data Structures and Algorithms1: Sorting and Searching, Springer- Verlag, 1984
	Mi86	Victor S Miller, Use of elliptic curves in cryptography, Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85, p.417-426, June 1986, Santa Barbara, California, United States
	Od86	A M Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques, p.224-314, December 1985, Paris, France
	BBCO90	C. Batut, D. Bernardi, H. Cohen, M. Olivier" User's guide to PARI-GP
	Scho85	R. School: Elliptic curves over finite fields and the computation of square roots rood p, Mathematics of Computation, vol. 44, 1985, 483-494
	Sh70	D. Shanks: Class number, A theory of factorization and genera, Proc. Sympos. Pure Math. vol.20, Amer. Math. Soc., 1970, 415- 44O
	Sh72	D. Shanks: Five number theoretic algorithms, Congressus Numerantium No. VII, Proc. 2nd Manitoba Cone on Numerical Math., 1972, 51-70
	Si86	J. Silverman: The arithmetic of Elliptic Curves, Springer-Verlag, 1986