Proof of an exceptional zero conjecture for elliptic curves over function fields

Based on the analogy between number fields and function fields of one variable over finite fields, we formulate and prove an analogue of the exceptional zero conjecture of Mazur, Tate and Teitelbaum for elliptic curves defined over function fields. The proof uses modular parametrization by Drinfeld modular curves and the theory of non-archimedean integration. As an application we prove a refinement of the Birch-Swinnerton-Dyer conjecture if the analytic rank of the elliptic curve is zero.     

A family of quintic cyclic fields with even class number parameterized by rational points on an elliptic curve

We give a family of quintic cyclic fields with even class number parametrized by rational points on an elliptic curve associated with Emma Lehmer's quintic polynomial. Further, we use the arithmetic of elliptic curves and the Chebotarev density theorem to show that there are infinitely many such fields.     

On isogeny graphs of supersingular elliptic curves over finite fields

We study the isogeny graphs of supersingular elliptic curves over finite fields, with an emphasis on the vertices corresponding to elliptic curves of j-invariant 0 and 1728.     

The difference between the ordinary height and the canonical height on elliptic curves

We estimate the bounds for the difference between the ordinary height and the canonical height on elliptic curves over number fields. Our result is an improvement of the recent result of Cremona, Prickett, and Siksek [J.E. Cremona, M. Prickett, S. Siksek, Height difference bounds for elliptic curves over number fields, J. Number Theory 116 (2006) 42-68]. Our bounds are usually sharper than the other known bounds.     

Speeding up elliptic curve discrete logarithm computations with point halving

Pollard rho method and its parallelized variants are at present known as the best generic algorithms for computing elliptic curve discrete logarithms. We propose new iteration function for the rho method by exploiting the fact that point halving is more efficient than point addition for elliptic curves over binary fields. We present a careful analysis of the alternative rho method with new iteration function. Compared to the previous r-adding walk, generally the new method can achieve a significant speedup for computing elliptic curve discrete logarithms over binary fields. For instance, for certain NIST-recommended curves over binary fields, the new method is about 12–17% faster than the previous best methods.     

On Quadratic Twists of Elliptic Curves and Some Applications of a Refined Version of Yu's Formula

In this article, we study some cohomology groups and quadratic twists of elliptic curves, and apply Tate local duality and the results of Kramer–Tunnell on local norm cokernel to give a refined version of Yu's formula in the case of elliptic curves. Then, by using this refinement formula, we obtain explicit orders of Shafarevich–Tate groups of some elliptic curves in quadratic number fields, including a few unconditional cases.     

Ray class fields generated by torsion points of certain elliptic curves

We first normalize the derivative Weierstrass ???-function appearing in the Weierstrass equations which give rise to analytic parametrizations of elliptic curves, by the Dedekind ??-function. And, by making use of this normalization of ???, we associate a certain elliptic curve to a given imaginary quadratic field K and then generate an infinite family of ray class fields over K by adjoining to K torsion points of such an elliptic curve. We further construct some ray class invariants of imaginary quadratic fields by utilizing singular values of the normalization of ???, as the y-coordinate in the Weierstrass equation of this elliptic curve, which would be a partial result towards the Lang?CSchertz conjecture of constructing ray class fields over K by means of the Siegel?CRamachandra invariant.     

特征为3的域上的椭圆曲线点的快速计算

本文给出了特征为3的域上的椭圆曲线点的计算方法．提出了3P的计算思想；并将特征为2的域上的椭圆曲线点的一些特殊的快速计算方法移植到特征为3的域上．同时对这几种方法进行了比较；由此给出域F3^n上的椭圆曲线射影坐标的一种很好的表示法。     

Towers of function fields over finite fields corresponding to elliptic modular curves

In this paper, we find several equations of recursive towers of function fields over finite fields corresponding to sequences of elliptic modular curves. This is a continuation of the work of Noam D. Elkies [8], [9] on modular equations of higher degrees.     

Extension of elliptic curves on Krasner hyperfields

The aim of the article is to initiate a new study in the framework of algebraic hyperfields, with an applicative impact in cryptography. First we define the notions of generalized Weierstrass equation and elliptic hypercurve on Krasner hyperfields, as a generalization of the notion of elliptic curve on fields. Then we investigate properties of the hypergroups derived from elliptic hypercurves and of the associated H_v-groups. Finally, we present a class of canonical hypergroups, which can be used as an alphabet in a special cryptographic system.     

Elliptic curves with large torsion and positive rank over number fields of small degree and ECM factorization

In this paper, we present several methods for the construction of elliptic curves with large torsion group and positive rank over number fields of small degree. We also discuss potential applications of such curves in the elliptic curve factorization method (ECM).     

Elliptic units in K2

We present certain norm-compatible systems in K₂ of function fields of some CM elliptic curves. We demonstrate that these systems have some properties similar to elliptic units.     

Efficient Arithmetic on Koblitz Curves

It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: taking a given integer multiple of a given point on the curve. The cost of the protocols depends on that of the elliptic scalar multiplication operation.Koblitz introduced a family of curves which admit especially fast elliptic scalar multiplication. His algorithm was later modified by Meier and Staffelbach. We give an improved version of the algorithm which runs 50 than any previous version. It is based on a new kind of representation of an integer, analogous to certain kinds of binary expansions. We also outline further speedups using precomputation and storage.     

Some Properties of Reduced Modular Polynomials

In this paper we will discuss some properties of reduced modular polynomials used in SEA algorithm for computing the number of rational points of elliptic curves on finite fields.     

Logarithmic transformations of rigid analytic elliptic surfaces

We give new examples of algebraic elliptic surfaces and non-algebraic rigid analytic elliptic surfaces by means of logarithmic transformations. In the complex analytic case, it is known that all multiple fibers of elliptic surfaces are obtained by logarithmic transformations. Using rigid analytic geometry, we construct similar transformations of elliptic surfaces over complete non-Archimedean valuation base fields. These operations yield rigid analytic elliptic fibrations with multiple fibers. When the resulting surface admits an ample line bundle, we may algebraize the surface. In the positive characteristic case, we obtain new types of algebraic elliptic surfaces. We also obtain a non-algebraic rigid analytic surface the combination of whose invariants appears neither in the algebraic case nor in the complex analytic case.     

On the construction of irreducible polynomials over finite fields via odd prime degree endomorphisms of elliptic curves

In this paper we present an iterative construction of irreducible polynomials over finite fields based on repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.     

Determination of elliptic curves with everywhere good reduction over real quadratic fields

All elliptic curves having everywhere good reduction over \Bbb Q(?{29})\Bbb Q(\sqrt {29}) are determined by studying the fields of 2- and 3-division points. As a byproduct of the argument, the elliptic curves over some real quadratic fields are determined. Though part of the result are already obtained in [2], [4], [5], [10], the proof given in the present paper is simpler.     

与广义Baouendi-Grushin算子相关的二阶退化椭圆方程的Hopf型引理

本文研究与广义Baouendi-Grushin(B-G)算子相关的二阶退化椭圆方程.利用广义B-G向量场的拟齐性质建立了相关的拟齐度量,证明了与广义B-G算子相关的退化椭圆方程的Hopf型引理,并给出了有关应用及推广.     

On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves

We show that the elliptic curve analogue of the pseudo-random number function, introduced recently by M. Naor and O. Reingold, produces a sequence with large linear complexity. This result generalizes a similar result of F. Griffin and I. E. Shparlinski for the linear complexity of the original function of M. Naor and O. Reingold. The proof is based on some results about the distribution of subset-products in finite fields and some properties of division polynomials of elliptic curves.     

Nonexistence of elliptic curves having good reduction everywhere over certain quadratic fields

The purpose of this paper is to show the nonexistence of elliptic curves having good reduction everywhere over certain quadratic fields.