Related papers: Algorithmic study of superspecial hyperelliptic cu…

We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

In this article, we present a method for computing rational points on hyperelliptic curves of genus~3 and isolated quadratic points on hyperelliptic curves of genus~2 and~3 whose Jacobians have rank~0. Our approach begins by computing the…

The geometry of algebraic curves over finite fields is a rich area of research. In previous work, the authors investigated a particular aspect of the geometry over finite fields of the classical unit circle, namely how the number of…

In this paper we consider the question of whether there exists a hyperelliptic curve of genus $g$ which is defined over $\FF_q$ but has no rational points over $\FF_q$ for various pairs $(g,q)$.

Let $k$ be an algebraically closed field of characteristic $p >0$. Suppose $g \geq 3$ and $0 \leq f \leq g$. We prove there is a smooth projective $k$-curve of genus $g$ and $p$-rank $f$ with no non-trivial automorphisms. In addition, we…

We give an algorithm for computing an inseparable endomorphism of a supersingular elliptic curve $E$ defined over $\mathbb F_{p^2}$, which, conditional on GRH, runs in expected $O(p^{1/2}(\log p)^2(\log\log p)^3)$ bit operations and…

We consider algebraic affine and projective curves of Edwards \cite{E, SkOdProj} over a finite field $\text{F}_{p^n}$. Most cryptosystems of the modern cryptography \cite{SkBlock} can be naturally transform into elliptic curves \cite{Kob}.…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

We prove that there are only finitely many modular curves of $D$-elliptic sheaves over $\mathbb{F}_q(T)$ which are hyperelliptic. In odd characteristic we give a complete classification of such curves.

We investigate the isogeny graphs of supersingular elliptic curves over $\mathbb{F}_{p^2}$ equipped with a $d$-isogeny to their Galois conjugate. These curves are interesting because they are, in a sense, a generalization of curves defined…

We present a method for constructing optimized equations for the modular curve X_1(N) using a local search algorithm on a suitably defined graph of birationally equivalent plane curves. We then apply these equations over a finite field F_q…

We describe the automorphism groups of finite $p$-groups arising naturally via Hessian determinantal representations of elliptic curves defined over number fields. Moreover, we derive explicit formulas for the orders of these automorphism…

Let $d\geq2$ be an integer. Denote by $E_d$ and $E'_{d}$ the hyperelliptic curves over $\mathbb{F}_q$ given by $$E_d: y^2=x^d+ax+b~~~ \text{and} ~~~E'_d: y^2=x^d+ax^{d-1}+b,$$ respectively. We explicitly find the number of…

This survey on the automorphism groups of finite p-groups focuses on three major topics: explicit computations for familiar finite p-groups, such as the extraspecial p-groups and Sylow p-subgroups of Chevalley groups; constructing p-groups…

Let $\mathbb{F}_q$ be the finite field of order $q=p^h$ with $p>2$ prime and $h>1$, and let $\mathbb{F}_{\bar{q}}$ be a subfield of $\mathbb{F}_q$. From any two $\bar{q}$-linearized polynomials $L_1,L_2 \in \overline{\mathbb{F}}_q[T]$ of…

We study a class of semistable ordinary hyperelliptic curves over 2-adic fields and the special fibre of their minimal regular model. We show that these curves can be controlled using `cluster pictures', similarly to the case of odd residue…

The formal group law of an elliptic curve has seen recent applications to computational algebraic geometry in the work of Couveignes to compute the order of an elliptic curve over finite fields of small characteristic. The purpose of this…

In this article we give the details of an effective point counting algorithm for genus two curves over finite fields of characteristic three. The algorithm has an application in the context of curve based cryptography. One distinguished…

In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with…