We explore algorithmic aspects of a simply transitive commutative group action coming from the class field theory of imaginary hyperelliptic function fields. Namely, the Jacobian of an imaginary hyperelliptic curve defined over $\mathbb F_q$ acts on a subset of isomorphism classes of Drinfeld modules. We describe an algorithm to compute the group action efficiently. This is a function field analog of the Couveignes-Rostovtsev-Stolbunov group action. We report on an explicit computation done with our proof-of-concept C++/NTL implementation; it took a fraction of a second on a standard computer. We prove that the problem of inverting the group action reduces to the problem of finding isogenies of fixed τ-degree between Drinfeld $\mathbb F_q[X...
In this thesis we will look at elliptic and hyperelliptic curves. There are three abelian groups tha...
Summary: "An algorithm for finding an automorphism group of a hyperelliptic curve y^2 = p(x) with pi...
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a fini...
In this thesis we show that the theory of algebraic correspondences introduced by Deuring in the 193...
81 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The second part of the thesis ...
AbstractLetk/Fq(x) be a quadratic extension that is ramified over the unique pole ofx, and letAbe th...
Rank one Drinfeld modules are the analogue of elliptic curves with complex multiplication. The study...
We derive an explicit method of computing the composition step in Cantor’s algorithm for group opera...
Let F be the function field of an irreducible, smooth, projective curve over a finite field. Let A b...
Let F be the function field of an irreducible, smooth, projective curve over a finite field. Let A b...
The use in cryptography of the group structure on elliptic curves or the jacobians of hyperelliptic ...
Hyperelliptic curves have been widely studied for cryptographic applications, and some special hyper...
International audienceWe give an efficient algorithm to compute equations of twists of hyperelliptic...
AbstractThe group K2 of a curve C over a finite field is equal to the tame kernel of the correspondi...
AbstractWe propose a conjectural explicit isogeny from the Jacobians of hyperelliptic Drinfeld modul...
In this thesis we will look at elliptic and hyperelliptic curves. There are three abelian groups tha...
Summary: "An algorithm for finding an automorphism group of a hyperelliptic curve y^2 = p(x) with pi...
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a fini...
In this thesis we show that the theory of algebraic correspondences introduced by Deuring in the 193...
81 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The second part of the thesis ...
AbstractLetk/Fq(x) be a quadratic extension that is ramified over the unique pole ofx, and letAbe th...
Rank one Drinfeld modules are the analogue of elliptic curves with complex multiplication. The study...
We derive an explicit method of computing the composition step in Cantor’s algorithm for group opera...
Let F be the function field of an irreducible, smooth, projective curve over a finite field. Let A b...
Let F be the function field of an irreducible, smooth, projective curve over a finite field. Let A b...
The use in cryptography of the group structure on elliptic curves or the jacobians of hyperelliptic ...
Hyperelliptic curves have been widely studied for cryptographic applications, and some special hyper...
International audienceWe give an efficient algorithm to compute equations of twists of hyperelliptic...
AbstractThe group K2 of a curve C over a finite field is equal to the tame kernel of the correspondi...
AbstractWe propose a conjectural explicit isogeny from the Jacobians of hyperelliptic Drinfeld modul...
In this thesis we will look at elliptic and hyperelliptic curves. There are three abelian groups tha...
Summary: "An algorithm for finding an automorphism group of a hyperelliptic curve y^2 = p(x) with pi...
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a fini...