No full text
Paper published in a book (Scientific congresses, symposiums and conference proceedings)
Computing the number of points of elliptic curves over finite fields
Buchmann, Johannes; Müller, Volker
1991In Computing the number of points of elliptic curves over finite fields
Peer reviewed
 

Files


Full Text
No document available.

Send to



Details



Keywords :
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 or­ders of elliptic curves over finite fields. This paper is a summary of the results in my Master Thesis.
Disciplines :
Computer science
Identifiers :
UNILU:UL-CONFERENCE-2009-435
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)
Language :
English
Title :
Computing the number of points of elliptic curves over finite fields
Publication date :
1991
Event name :
International Symposium on Symbolic and Algebraic Computation 1991
Event place :
Bonn, Germany
Event date :
July 15-17, 1991
Audience :
International
Main work title :
Computing the number of points of elliptic curves over finite fields
Publisher :
ACM Press
ISBN/EAN :
0897914376
Pages :
179-182
Peer reviewed :
Peer reviewed
Commentary :
ISSAC'91: Pro­ceedings of the 1991 International Symposium on Symbolic and Algebraic Computation
Available on ORBilu :
since 11 December 2013

Statistics


Number of views
98 (4 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
 
7
Scopus citations®
without self-citations
6
OpenCitations
 
4

Bibliography


Similar publications



Contact ORBilu