Efficient Algorithms for the Jacobian Variety of Hyperelliptic Curves y2=xp-x+1 Over a Finite Field of Odd Characteristic p

2000 ◽  
pp. 73-89 ◽  
Author(s):  
Iwan Duursma ◽  
Kouichi Sakurai
Keyword(s):  
Finite Field ◽  
Hyperelliptic Curves ◽  
Efficient Algorithms ◽  
Jacobian Variety ◽  
Characteristic P

Random Dieudonné modules, random -divisible groups, and random curves over finite fields

2013 ◽  
Vol 12 (3) ◽  
pp. 651-676 ◽  
Author(s):  
Bryden Cais ◽  
Jordan S. Ellenberg ◽  
David Zureick-Brown
Keyword(s):  
Probability Distribution ◽  
Finite Field ◽  
Random Matrix ◽  
Hyperelliptic Curve ◽  
Hyperelliptic Curves ◽  
Plane Curves ◽  
Random Curves ◽  
Isomorphism Classes ◽  
Curves Over Finite Fields ◽  
Divisible Groups

AbstractWe describe a probability distribution on isomorphism classes of principally quasi-polarized $p$-divisible groups over a finite field $k$ of characteristic $p$ which can reasonably be thought of as a ‘uniform distribution’, and we compute the distribution of various statistics ($p$-corank, $a$-number, etc.) of $p$-divisible groups drawn from this distribution. It is then natural to ask to what extent the $p$-divisible groups attached to a randomly chosen hyperelliptic curve (respectively, curve; respectively, abelian variety) over $k$ are uniformly distributed in this sense. This heuristic is analogous to conjectures of Cohen–Lenstra type for $\text{char~} k\not = p$, in which case the random $p$-divisible group is defined by a random matrix recording the action of Frobenius. Extensive numerical investigation reveals some cases of agreement with the heuristic and some interesting discrepancies. For example, plane curves over ${\mathbf{F} }_{3} $ appear substantially less likely to be ordinary than hyperelliptic curves over ${\mathbf{F} }_{3} $.

CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS

2008 ◽  
Vol 18 (02) ◽  
pp. 227-241 ◽  
Author(s):  
PETER A. BROOKSBANK ◽  
E. A. O'BRIEN
Keyword(s):  
Finite Field ◽  
Vector Space ◽  
Linear Group ◽  
Jacobson Radical ◽  
Matrix Algebra ◽  
General Linear Group ◽  
Efficient Algorithms ◽  
Sesquilinear Forms ◽  
Group Of Units ◽  
Practical Algorithm

We present a practical algorithm to construct the subgroup of the general linear group that preserves a system of bilinear or sesquilinear forms on a vector space defined over a finite field. Components include efficient algorithms to construct the Jacobson radical and the group of units of a matrix algebra.

scholarly journals Enumeration of self-dual cyclic codes of some specific lengths over finite fields

2018 ◽  
Vol 10 (03) ◽  
pp. 1850031 ◽  
Author(s):  
Supawadee Prugsapitak ◽  
Somphong Jitman
Keyword(s):  
Characteristic Function ◽  
Finite Field ◽  
Finite Fields ◽  
Linear Codes ◽  
Cyclic Code ◽  
Cyclic Codes ◽  
Efficient Algorithms ◽  
Important Class ◽  
Field Characteristic ◽  
Positive Integers

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length [Formula: see text] over a finite field if and only if [Formula: see text] and the field characteristic are even. The enumeration of such codes has been given under both the Euclidean and Hermitian products. However, in each case, the formula for self-dual cyclic codes of length [Formula: see text] over a finite field contains a characteristic function which is not easily computed. In this paper, we focus on more efficient ways to enumerate self-dual cyclic codes of lengths [Formula: see text] and [Formula: see text], where [Formula: see text], [Formula: see text], and [Formula: see text] are positive integers. Some number theoretical tools are established. Based on these results, alternative formulas and efficient algorithms to determine the number of self-dual cyclic codes of such lengths are provided.

scholarly journals THE 2-RANKS OF HYPERELLIPTIC CURVES WITH EXTRA AUTOMORPHISMS

2009 ◽  
Vol 05 (05) ◽  
pp. 897-910 ◽  
Author(s):  
DARREN GLASS
Keyword(s):  
Automorphism Group ◽  
Hyperelliptic Curve ◽  
Hyperelliptic Curves ◽  
Closed Field ◽  
Base Field ◽  
Characteristic P ◽  
Algebraically Closed Field ◽  
Characteristic Two ◽  
Carry Over ◽  
The Relationship

This paper examines the relationship between the automorphism group of a hyperelliptic curve defined over an algebraically closed field of characteristic two and the 2-rank of the curve. In particular, we exploit the wild ramification to use the Deuring–Shafarevich formula in order to analyze the ramification of hyperelliptic curves that admit extra automorphisms and use this data to impose restrictions on the genera and 2-ranks of such curves. We also show how some of the techniques and results carry over to the case where our base field is of characteristic p > 2.

Characteristic p Galois Representations That Arise from Drinfeld Modules

2000 ◽  
Vol 43 (3) ◽  
pp. 282-293 ◽  
Author(s):  
Nigel Boston ◽  
David T. Ose
Keyword(s):  
Finite Field ◽  
Galois Group ◽  
Galois Representations ◽  
Drinfeld Module ◽  
Drinfeld Modules ◽  
Absolute Galois Group ◽  
Characteristic P ◽  
Finite Characteristic ◽  
The Absolute

AbstractWe examine which representations of the absolute Galois group of a field of finite characteristic with image over a finite field of the same characteristic may be constructed by the Galois group’s action on the division points of an appropriate Drinfeld module.

Fermat Jacobians of Prime Degree over Finite Fields

1999 ◽  
Vol 42 (1) ◽  
pp. 78-86 ◽  
Author(s):  
Josep González
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Algebraic Closure ◽  
Cyclotomic Field ◽  
Roots Of Unity ◽  
Characteristic P ◽  
Prime Degree ◽  
Numerical Criterion

AbstractWe study the splitting of Fermat Jacobians of prime degree l over an algebraic closure of a finite field of characteristic p not equal to l. We prove that their decomposition is determined by the residue degree of p in the cyclotomic field of the l-th roots of unity. We provide a numerical criterion that allows to compute the absolutely simple subvarieties and their multiplicity in the Fermat Jacobian.

scholarly journals Computing the Characteristic Polynomials of a Class of Hyperelliptic Curves for Cryptographic Applications

2011 ◽  
Vol 2011 ◽  
pp. 1-25 ◽  
Author(s):  
Lin You ◽  
Guangguo Han ◽  
Jiwen Zeng ◽  
Yongxuan Sang
Keyword(s):  
Finite Field ◽  
Characteristic Polynomial ◽  
Hyperelliptic Curve ◽  
Zeta Functions ◽  
Hyperelliptic Curves ◽  
Common Method ◽  
Characteristic Polynomials ◽  
Computational Data ◽  
Prime Factors

Hyperelliptic curves have been widely studied for cryptographic applications, and some special hyperelliptic curves are often considered to be used in practical cryptosystems. Computing Jacobian group orders is an important operation in constructing hyperelliptic curve cryptosystems, and the most common method used for the computation of Jacobian group orders is by computing the zeta functions or the characteristic polynomials of the related hyperelliptic curves. For the hyperelliptic curveCq:v2=up+au+bover the fieldFqwithqbeing a power of an odd primep, Duursma and Sakurai obtained its characteristic polynomial forq=p,a=−1,andb∈Fp. In this paper, we determine the characteristic polynomials ofCqover the finite fieldFpnforn=1, 2 anda,b∈Fpn. We also give some computational data which show that many of those curves have large prime factors in their Jacobian group orders, which are both practical and vital for the constructions of efficient and secure hyperelliptic curve cryptosystems.

Certain 3-decompositions of complete graphs, with an application to finite fields

1985 ◽  
Vol 99 (3-4) ◽  
pp. 277-281 ◽  
Author(s):  
Peter Rowlinson
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Complete Graph ◽  
Disjoint Union ◽  
Necessary Condition ◽  
Complete Graphs ◽  
Characteristic P ◽  
Strongly Regular

SynopsisA necessary condition is obtained for a complete graph to have a decomposition as the line-disjoint union of three isomorphic strongly regular subgraphs. The condition is used to determine the number of non-trivial solutions of the equation x3+y3 = z3 in a finite field of characteristic p ≡ 2 mod 3.

scholarly journals Traces, high powers and one level density for families of curves over finite fields

2017 ◽  
Vol 165 (2) ◽  
pp. 225-248 ◽  
Author(s):  
ALINA BUCUR ◽  
EDGAR COSTA ◽  
CHANTAL DAVID ◽  
JOÃO GUERREIRO ◽  
DAVID LOWRY–DUDA
Keyword(s):  
Finite Field ◽  
Moduli Spaces ◽  
Function Field ◽  
Level Density ◽  
Zeta Functions ◽  
Hyperelliptic Curves ◽  
Unitary Matrix ◽  
Moduli Spaces Of Curves ◽  
A New Technique ◽  
The One

AbstractThe zeta function of a curve C over a finite field may be expressed in terms of the characteristic polynomial of a unitary matrix ΘC. We develop and present a new technique to compute the expected value of tr(ΘCn) for various moduli spaces of curves of genus g over a fixed finite field in the limit as g is large, generalising and extending the work of Rudnick [Rud10] and Chinis [Chi16]. This is achieved by using function field zeta functions, explicit formulae, and the densities of prime polynomials with prescribed ramification types at certain places as given in [BDF+16] and [Zha]. We extend [BDF+16] by describing explicit dependence on the place and give an explicit proof of the Lindelöf bound for function field Dirichlet L-functions L(1/2 + it, χ). As applications, we compute the one-level density for hyperelliptic curves, cyclic ℓ-covers, and cubic non-Galois covers.

Sign in / Sign up

Export Citation Format

Share Document