AbstractWe define a class of algebras over finite fields, called polynomially cyclic algebras, which extend the class of abelian field extensions. We study the structure of these algebras; furthermore, we define and investigate properties of Lagrange resolvents and Gauss and Jacobi sums.Natural examples of polynomially cyclic algebras are for instance algebras of the form Fp[X]/(Fq(X)) where p,q are distinct odd primes and Fq is the q-th cyclotomic polynomial. Further examples occur similarly on replacing the cyclotomic polynomials with factors of division polynomials of elliptic curves. Finally, Gauss and Jacobi sums over polynomially cyclic algebras are applied for improving current algorithms for counting the number of points of elliptic...
Abstract. Using the relation between the problem of counting irreducible polynomials over finite fie...
International audienceAs a subproduct of the Schoof-Elkies-Atkin algorithm to count points on ellipt...
In this thesis we investigate practical aspects related to point counting problems on algebraic vari...
AbstractWe define a class of algebras over finite fields, called polynomially cyclic algebras, which...
In this write-up we discuss the problem of counting points on an elliptic curve over a finite field....
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
This thesis describes a procedure (the `CM method'), based on the theory of complex multiplication, ...
It is by now a well-known paradigm that public-key cryptosystems can be built using finite Abelian g...
This paper provides several generalizations of Gauss theorem that counts points on special elliptic ...
In 2000 T. Satoh gave the first p–adic point counting algorithm for elliptic curves over finite fiel...
AbstractFor a prime numberpand a number fieldk, letk∞/kbe the cyclotomic Zp-extension. LetA∞be the p...
Abstract. We obtain nontrivial estimates of quadratic charac-ter sums of division polynomials Ψn(P),...
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomia...
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtaine...
The goal of this thesis is to explain and implement Schoof's algorithm for counting points on ellipt...
Abstract. Using the relation between the problem of counting irreducible polynomials over finite fie...
International audienceAs a subproduct of the Schoof-Elkies-Atkin algorithm to count points on ellipt...
In this thesis we investigate practical aspects related to point counting problems on algebraic vari...
AbstractWe define a class of algebras over finite fields, called polynomially cyclic algebras, which...
In this write-up we discuss the problem of counting points on an elliptic curve over a finite field....
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
This thesis describes a procedure (the `CM method'), based on the theory of complex multiplication, ...
It is by now a well-known paradigm that public-key cryptosystems can be built using finite Abelian g...
This paper provides several generalizations of Gauss theorem that counts points on special elliptic ...
In 2000 T. Satoh gave the first p–adic point counting algorithm for elliptic curves over finite fiel...
AbstractFor a prime numberpand a number fieldk, letk∞/kbe the cyclotomic Zp-extension. LetA∞be the p...
Abstract. We obtain nontrivial estimates of quadratic charac-ter sums of division polynomials Ψn(P),...
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomia...
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtaine...
The goal of this thesis is to explain and implement Schoof's algorithm for counting points on ellipt...
Abstract. Using the relation between the problem of counting irreducible polynomials over finite fie...
International audienceAs a subproduct of the Schoof-Elkies-Atkin algorithm to count points on ellipt...
In this thesis we investigate practical aspects related to point counting problems on algebraic vari...