Counting the Number of Points on Elliptic Curves over Finite Fields of Characteristic Greater than Three

Reference : Counting the Number of Points on Elliptic Curves over Finite Fields of Characteristic...


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

Title :	Counting the Number of Points on Elliptic Curves over Finite Fields of Characteristic Greater than Three
Language :	English
Author, co-author :	Lehmann, Frank [> >]
	Maurer, Markus [> >]
	Müller, Volker [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Shoup, Victor [New York University, New York]
Publication date :	1994
Journal title :	Proceedings of Algorithmic Number Theory Symposium I, Lecture Notes in Computer Science
Pages :	60-70
Peer reviewed :	Yes
Audience :	International
Event name :	Algorithmic Number Theory Symposium I (ANTS I)
Event date :	1994
Event organizer :	Cornell University
Event place (city) :	Ithaca (New York)
Event country :	USA
Keywords :	[en] Elliptic curves ; Point counting ; Atkin-Elkies algorithm
Abstract :	[en] The paper describes the implementation of the Algorithm of Atkin and Elkies for computing the group order of elliptic curves over large prime fields. The focus of the paper lays on algorithmical aspects of the Atkin/Elkies algorithm. Practical data and running times are given.
Target :	Researchers ; Students
Permalink :	http://hdl.handle.net/10993/2284

There is no file associated with this reference.

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