We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a finite field. We describe an implementation of this algorithm for prime fields. We report on the use of this implementation to count the number of points on a curve over IFp , where p is a 375-digit prime
In 2000 T. Satoh gave the first p–adic point counting algorithm for elliptic curves over finite fiel...
Given an ordinary elliptic curve on Hesse form over a finite field of characteristic three, we give ...
In this write-up we discuss the problem of counting points on an elliptic curve over a finite field....
The paper describes the implementation of the Algorithm of Atkin and Elkies for computing the group ...
peer reviewedThe paper describes the implementation of the Algorithm of Atkin and Elkies for computi...
In this report we study the problem of counting the number of points on an elliptic curve over a fin...
The goal of this thesis is to explain and implement Schoof's algorithm for counting points on ellipt...
Given an elliptic curve E and a positive integer N, we consider the problem of counting the number o...
peer reviewedIn this paper we report on our implementation of a combination of the Babystep-Giantste...
In this paper we report on our implementation of a combination of the Babystep-Giantstep Algorithm a...
International audienceA classical way to compute the number of points of elliptic curves defined ove...
International audienceA classical way to compute the number of points of elliptic curves defined ove...
International audienceCryptographic schemes using elliptic curves over finite fields requirethe comp...
International audienceCryptographic schemes using elliptic curves over finite fields requirethe comp...
International audienceCryptographic schemes using elliptic curves over finite fields requirethe comp...
In 2000 T. Satoh gave the first p–adic point counting algorithm for elliptic curves over finite fiel...
Given an ordinary elliptic curve on Hesse form over a finite field of characteristic three, we give ...
In this write-up we discuss the problem of counting points on an elliptic curve over a finite field....
The paper describes the implementation of the Algorithm of Atkin and Elkies for computing the group ...
peer reviewedThe paper describes the implementation of the Algorithm of Atkin and Elkies for computi...
In this report we study the problem of counting the number of points on an elliptic curve over a fin...
The goal of this thesis is to explain and implement Schoof's algorithm for counting points on ellipt...
Given an elliptic curve E and a positive integer N, we consider the problem of counting the number o...
peer reviewedIn this paper we report on our implementation of a combination of the Babystep-Giantste...
In this paper we report on our implementation of a combination of the Babystep-Giantstep Algorithm a...
International audienceA classical way to compute the number of points of elliptic curves defined ove...
International audienceA classical way to compute the number of points of elliptic curves defined ove...
International audienceCryptographic schemes using elliptic curves over finite fields requirethe comp...
International audienceCryptographic schemes using elliptic curves over finite fields requirethe comp...
International audienceCryptographic schemes using elliptic curves over finite fields requirethe comp...
In 2000 T. Satoh gave the first p–adic point counting algorithm for elliptic curves over finite fiel...
Given an ordinary elliptic curve on Hesse form over a finite field of characteristic three, we give ...
In this write-up we discuss the problem of counting points on an elliptic curve over a finite field....
Add to ORKG