Related papers: A CRT algorithm for constructing genus 2 curves ov…
In this paper we classify curves of genus 2 with group of automorphisms isomorphic to D_8 or D_12 over an arbitrary field k (of characteristic different from 2 in the D_8 case and from 2 and 3 in the D_{12} case) up to k-isomorphism. As an…
Let $X$ be a smooth projective curve over a finite field of characteristic $p$. We describe and implement a practical algorithm for computing the $p$-divisible group $Jac(X)[p^\infty]$ via computing its Dieudonn\'{e} module, or equivalently…
We give a practical method to compute the 2-torsion subgroup of the Jacobian of a non-hyperelliptic curve of genus $3$, $4$ or $5$. The method is based on the correspondence between the 2-torsion subgroup and the theta hyperplanes to the…
Suppose $C$ is an isogeny class of abelian varieties over a finite field $k$. In this paper we give a partial answer to the question of which finite group schemes over $k$ occur as kernels of polarizations of varieties in $C$. We show that…
The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols. On the other hand, it proposes new schemes and guidelines for improving the practice of robust protocol…
Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of…
This article is a short introduction to the theory of the groups of points of elliptic curves over finite fields. It is concerned with the elementary theory and practice of elliptic curves cryptography, the new generation of public key…
We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…
We prove the elliptic transformation law of Jacobi forms for the generating series of Pandharipande--Thomas invariants of an elliptic Calabi--Yau 3-fold over a reduced class in the base. This proves part of a conjecture by Huang, Katz, and…
Let p be a prime and let C be a genus one curve over a number field k representing an element of order dividing p in the Shafarevich-Tate group of its Jacobian. We describe an algorithm which computes the set of D in the Shafarevich-Tate…
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
In this paper we study genus 2 curves whose Jacobians admit a polarized (4,4)-isogeny to a product of elliptic curves. We consider base fields of characteristic different from 2 and 3, which we do not assume to be algebraically closed. We…
The goal of this paper is to develop a numerical algorithm that solves a two-dimensional elliptic partial differential equation in a polygonal domain using tensor methods and ideas from isogeometric analysis. The proposed algorithm is based…
If $E$ is an elliptic curve, defined over $\mathbb{Q}$ or a number field having at least one real embedding, then Elkies proved that $E$ has supersingular reduction at infinitely many primes $p$. Baba and Granath extended this result to…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends Kedlaya's algorithm to a very general class of curves using a map to the projective line. We develop all the necessary bounds,…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
This paper is devoted to constructing an explicit efficient representation for the Jacobian variety of a nonsingular curve of genus greater than 1, and its group law. We describe an algorithm for executing the group law on the Jacobian…
Castryck, Decru, and Smith used superspecial genus-2 curves and their Richelot isogeny graph for basing genus-2 isogeny cryptography, and recently, Costello and Smith devised an improved isogeny path-finding algorithm in the genus-2…
Generalizing a method of Sutherland and the author for elliptic curves, we design a subexponential algorithm for computing the endomorphism rings of ordinary abelian varieties of dimension two over finite fields. Although its correctness…