Computing the number of points of elliptic curves over finite fields

Reference : Computing the number of points of elliptic curves over finite fields


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/12939

Title :	Computing the number of points of elliptic curves over finite fields
Language :	English
Author, co-author :	Buchmann, Johannes [Technische Universität, Darmstadt]
	Müller, Volker [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	1991
Main document title :	Computing the number of points of elliptic curves over finite fields
Publisher :	ACM Press
Pages :	179-182
Peer reviewed :	Yes
Audience :	International
ISBN :	0897914376
Event name :	International Symposium on Symbolic and Algebraic Computation 1991
Event date :	July 15-17, 1991
Event place (city) :	Bonn
Event country :	Germany
Keywords :	[en] Elliptic curve ; Point counting ; Schoof algorithm
Abstract :	[en] In this paper we report on our implementation of a combination of the Babystep-Giantstep Algorithm and the Algorithm of Schoof for computing group orders of elliptic curves over finite fields. This paper is a summary of the results in my Master Thesis.
Permalink :	http://hdl.handle.net/10993/12939
DOI :	10.1145/120694.120718
Commentary :	ISSAC'91: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation

There is no file associated with this reference.

All documents in ORBi^lu are protected by a user license.