English
Related papers

Related papers: Constructing curves over finite fields with many p…

200 papers

There is an algorithm that takes as input a global field k and produces a curve over k violating the local-global principle. Also, given a global field k and a nonnegative integer n, one can effectively construct a curve X over k such that…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

It is a well known result that the number of points over a finite field on the Legendre family of elliptic curves can be written in terms of a hypergeometric function modulo $p$. In this paper, we extend this result, due to Igusa, to a…

Number Theory · Mathematics 2012-01-17 Adriana Salerno

We study the distribution of algebraic points on curves in abelian varieties over finite fields.

Algebraic Geometry · Mathematics 2007-05-23 Fedor Bogomolov , Yuri Tschinkel

In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…

Number Theory · Mathematics 2020-12-14 Benjamin Jones

The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…

Number Theory · Mathematics 2020-01-16 Everett W. Howe

We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.

Number Theory · Mathematics 2023-01-02 Jean-Marc Couveignes , Tony Ezome

We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In…

Number Theory · Mathematics 2016-09-02 Ioulia N. Baoulina

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…

Number Theory · Mathematics 2024-02-07 Valerio Dose , Guido Lido , Pietro Mercuri , Claudio Stirpe

We give several new constructions for moderate rank elliptic curves over $\mathbb{Q}(T)$. In particular we construct infinitely many rational elliptic surfaces (not in Weierstrass form) of rank 6 over $\mathbb{Q}$ using polynomials of…

Number Theory · Mathematics 2010-11-16 Scott Arms , Steven J. Miller , Alvaro Lozano-Robledo

In this, largely expository, note, we show how the simplicial structure of the moduli spaces of stable rational curves with marked points allows to produce explicit equations for these spaces. The key argument is an elementary combinatorial…

Algebraic Geometry · Mathematics 2019-06-13 Joaquin Maya , Jacob Mostovoy

It is pointed out that despite of the non-linearity of the underlying equations, there do exist rather general methods that allow to generate new minimal surfaces from known ones.

Differential Geometry · Mathematics 2018-11-26 Jens Hoppe , Vladimir G. Tkachev

We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.

Number Theory · Mathematics 2010-05-31 Irene Garcia-Selfa , Jose M. Tornero

Simple constructions are given for finite semifields that include as special cases both old semifields and recently constructed semifields.

Combinatorics · Mathematics 2012-01-04 Juergen Bierbrauer , William M. Kantor

The first part is expository: it explains how finite fields may be used to prove theorems on infinite fields by a reduction mod p process. The second part gives a variant of P.Smith's fixed point theorem which applies in any characteristic.

Algebraic Geometry · Mathematics 2009-03-25 Jean-Pierre Serre

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

Cryptography and Security · Computer Science 2007-12-27 Andreas Enge

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…

Number Theory · Mathematics 2007-07-16 Amod Agashe , Kristin Lauter , Ramarathnam Venkatesan

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

Number Theory · Mathematics 2017-09-29 Maciej Grzeskowiak

We study plane curves over finite fields whose tangent lines at smooth $\mathbb{F}_q$-points together cover all the points of $\mathbb{P}^2(\mathbb{F}_q)$.

Algebraic Geometry · Mathematics 2023-04-05 Shamil Asgarli , Dragos Ghioca

We develop techniques for determining the fibers of a morphism of curves $\phi: C \to D$ over a nonarchimedean local field $K$. These results have applications to studying closed point on curves over global fields since closed points on $C$…

Number Theory · Mathematics 2025-09-23 Irmak Balçik , Stephanie Chan , Yuan Liu , Bianca Viray

This paper gives various methods for constructing vector bundles over elliptic curves and more generally over families of elliptic curves. We construct universal families over generalized elliptic curves via spectral cover methods and also…

alg-geom · Mathematics 2008-02-03 Robert Friedman , John W. Morgan , Edward Witten