Reference : Computing the number of points of elliptic curves over finite fields |
Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
Engineering, computing & technology : Computer science | |||
http://hdl.handle.net/10993/12939 | |||
Computing the number of points of elliptic curves over finite fields | |
English | |
Buchmann, Johannes [Technische Universität, Darmstadt] | |
Müller, Volker ![]() | |
1991 | |
Computing the number of points of elliptic curves over finite fields | |
ACM Press | |
179-182 | |
Yes | |
International | |
0897914376 | |
International Symposium on Symbolic and Algebraic Computation 1991 | |
July 15-17, 1991 | |
Bonn | |
Germany | |
[en] Elliptic curve ; Point counting ; Schoof algorithm | |
[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. | |
http://hdl.handle.net/10993/12939 | |
10.1145/120694.120718 | |
ISSAC'91: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation |
There is no file associated with this reference.
All documents in ORBilu are protected by a user license.