scholarly journals Space curves, X-ranks and cuspidal projections

Author(s):  
Edoardo Ballico

AbstractLet $$X\subset \mathbb {P}^3$$ X ⊂ P 3 be an integral and non-degenerate curve. We say that $$q\in \mathbb {P}^3\setminus X$$ q ∈ P 3 \ X has X-rank 3 if there is no line $$L\subset \mathbb {P}^3$$ L ⊂ P 3 such that $$q\in L$$ q ∈ L and $$\#(L\cap X)\ge 2$$ # ( L ∩ X ) ≥ 2 . We prove that for all hyperelliptic curves of genus $$g\ge 5$$ g ≥ 5 there is a degree $$g+3$$ g + 3 embedding $$X\subset \mathbb {P}^3$$ X ⊂ P 3 with exactly $$2g+2$$ 2 g + 2 points with X-rank 3 and another embedding without points with X-rank 3 but with exactly $$2g+2$$ 2 g + 2 points $$q\in \mathbb {P}^3$$ q ∈ P 3 such that there is a unique pair of points of X spanning a line containing q. We also prove the non-existence of points of X-rank 3 for general curves of bidegree (a, b) in a smooth quadric (except in known exceptional cases) and we give lower bounds for the number of pairs of points of X spanning a line containing a fixed $$q\in \mathbb {P}^3\setminus X$$ q ∈ P 3 \ X . For all integers $$g\ge 5$$ g ≥ 5 , $$x\ge 0$$ x ≥ 0 we prove the existence of a nodal hyperelliptic curve X with geometric genus g, exactly x nodes, $$\deg (X) = x+g+3$$ deg ( X ) = x + g + 3 and having at least $$x+2g+2$$ x + 2 g + 2 points of X-rank 3.

2016 ◽  
Vol 102 (3) ◽  
pp. 316-330 ◽  
Author(s):  
MAJID HADIAN ◽  
MATTHEW WEIDNER

In this paper we study the variation of the $p$-Selmer rank parities of $p$-twists of a principally polarized Abelian variety over an arbitrary number field $K$ and show, under certain assumptions, that this parity is periodic with an explicit period. Our result applies in particular to principally polarized Abelian varieties with full $K$-rational $p$-torsion subgroup, arbitrary elliptic curves, and Jacobians of hyperelliptic curves. Assuming the Shafarevich–Tate conjecture, our result allows one to classify the rank parities of all quadratic twists of an elliptic or hyperelliptic curve after a finite calculation.


2013 ◽  
Vol 12 (3) ◽  
pp. 651-676 ◽  
Author(s):  
Bryden Cais ◽  
Jordan S. Ellenberg ◽  
David Zureick-Brown

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} $.


2010 ◽  
Vol 47 (1) ◽  
pp. 31-65 ◽  
Author(s):  
Michael J. Jacobson ◽  
Renate Scheidler ◽  
Andreas Stein

Abstract In this paper, we give an overview of cryptographic applications using real hyperelliptic curves. We review previously proposed cryptographic protocols and discuss the infrastructure of a real hyperelliptic curve, the mathematical structure underlying all these protocols. We then describe recent improvements to infrastructure arithmetic, including explicit formulas for divisor arithmetic in genus 2, and advances in solving the infrastructure discrete logarithm problem, whose presumed intractability is the basis of security for the related cryptographic protocols.


Author(s):  
Turku Ozlum Celik

Abstract We give an algebraic method to compute the fourth power of the quotient of any even theta constants associated with a given non-hyperelliptic curve in terms of geometry of the curve. In order to apply the method, we work out non-hyperelliptic curves of genus 4, in particular, such curves lying on a singular quadric, which arise from del Pezzo surfaces of degree 1. Indeed, we obtain a complete level 2 structure of the curves by studying their theta characteristic divisors via exceptional divisors of the del Pezzo surfaces as the structure is required for the method.


Author(s):  
L. Roth

1. In a previous note the author has examined the systems of tangent planes to a degenerate surface in S3 consisting of n planes, regarded as the limit of a general surface of the same order. It is well known that a pair of space curves which are the limiting form of a non-degenerate curve must have a certain number of intersections; hence, if a surface in higher space degenerates into a number of surfaces, these must intersect in curves of various orders. In the present paper we consider the nature of the envelope to a surface consisting of two general surfaces of S4 having in common a single curve of general character, the degenerate surface being regarded as the limit of some surface of general type. The same conclusions hold for a similar degenerate surface in Sr (r>4).


2010 ◽  
Vol 21 (07) ◽  
pp. 939-949 ◽  
Author(s):  
KEIJI MATSUMOTO ◽  
TOMOHIDE TERASOMA

In this paper, we define a generalized arithmetic-geometric mean μg among 2g terms motivated by 2τ-formulas of theta constants. By using Thomae's formula, we give two expressions of μg when initial terms satisfy some conditions. One is given in terms of period integrals of a hyperelliptic curve C of genus g. The other is by a period integral of a certain Calabi–Yau g-fold given as a double cover of the g-dimensional projective space Pg.


2009 ◽  
Vol 05 (05) ◽  
pp. 897-910 ◽  
Author(s):  
DARREN GLASS

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.


2021 ◽  
Vol 3 ◽  
pp. 11-24
Author(s):  
Denys Boiko

The paper studies hyperelliptic curves of the genus g > 1, divisors on them and their applications in Python programming language. The basic necessary definitions and known properties of hyperelliptic curves are demonstrated, as well as the notion of polynomial function, its representation in unique form, also the notion of rational function, norm, degree and conjugate to a polynomial are presented. These facts are needed to calculate the order of points of desirable functions, and thus to quickly and efficiently calculate divisors. The definition of a divisor on a hyperelliptic curve is shown, and the main known properties of a divisor are given. There are also an example of calculating a divisor of a polynomial function, reduced and semi-reduced divisors are described, theorem of the existence of such a not unique semi-reduced divisor, and theorem of the existence of a unique reduced divisor, which is equivalent to the initial one, are proved. In particular, a semi-reduced divisor can be represented as an GCD of divisors of two polynomial functions. It is also demonstrated that each reduced divisor can be represented in unique form by pair of polynomials [a(x), b(x)], which is called Mumford representation, and several examples of its representation calculation are given. There are shown Cantor’s algorithms for calculating the sum of two divisors: its compositional part, by means of which a not unique semi-reduced divisor is formed, and the reduction part, which gives us a unique reduced divisor. In particular, special case of the compositional part of Cantor’s algorithm, doubling of the divisor, is described: it significantly reduces algorithm time complexity. Also the correctness of the algorithms are proved, examples of applications are given. The main result of the work is the implementation of the divisor calculation of a polynomial function, its Mumford representation, and Cantor’s algorithm in Python programming language. Thus, the aim of the work is to demonstrate the possibility of e↵ective use of described algorithms for further work with divisors on the hyperelliptic curve, including the development of cryptosystem, digital signature based on hyperelliptic curves, attacks on such cryptosystems.


2011 ◽  
Vol 2011 ◽  
pp. 1-25 ◽  
Author(s):  
Lin You ◽  
Guangguo Han ◽  
Jiwen Zeng ◽  
Yongxuan Sang

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.


2020 ◽  
Vol 54 (3) ◽  
pp. 95-99
Author(s):  
Sebastian Lindner ◽  
Laurent Imbert ◽  
Michael J. Jacobson

The divisor class group of a hyperelliptic curve defined over a finite field is a finite abelian group at the center of a number of important open questions in algebraic geometry, number theory and cryptography. Many of these problems lend themselves to numerical investigation, and as emphasized by Sutherland [14, 13], fast arithmetic in the divisor class group is crucial for their efficiency. Besides, implementations of these fundamental operations are at the core of the algebraic geometry packages of widely-used computer algebra systems such as Magma and Sage.


Sign in / Sign up

Export Citation Format

Share Document