HYPERGEOMETRIC SERIES AND ARITHMETIC–GEOMETRIC MEAN OVER 2-ADIC FIELDS

2012 ◽  
Vol 08 (03) ◽  
pp. 831-844
Author(s):  
KENSAKU KINJO ◽  
YUKEN MIYASAKA

Dwork proved that the Gaussian hypergeometric function on p-adic numbers can be extended to a function which takes values of the unit roots of ordinary elliptic curves over a finite field of characteristic p ≥ 3. We present an analogous theory in the case p = 2. As an application, we give a relation between the canonical lift and the unit root of an elliptic curve over a finite field of characteristic 2 by using the 2-adic arithmetic–geometric mean.

1995 ◽  
Vol 38 (2) ◽  
pp. 167-173 ◽  
Author(s):  
David A. Clark ◽  
Masato Kuwata

AbstractLet k = Fq be a finite field of characteristic p with q elements and let K be a function field of one variable over k. Consider an elliptic curve E defined over K. We determine how often the reduction of this elliptic curve to a prime ideal is cyclic. This is done by generalizing a result of Bilharz to a more general form of Artin's primitive roots problem formulated by R. Murty.


2010 ◽  
Vol 53 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Omran Ahmadi ◽  
Igor Shparlinski

AbstractLet E be an ordinary elliptic curve over a finite field q of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative character sums. We apply these bounds to some variants of the sum-product problem on E.


2019 ◽  
Vol 38 (3) ◽  
pp. 193-201 ◽  
Author(s):  
A. Boulbot ◽  
Abdelhakim Chillali ◽  
A. Mouhib

Let Fq be a finite field of q elements, where q is a power of a prime number p greater than or equal to 5. In this paper, we study the elliptic curve denoted Ea,b(Fq[e]) over the ring Fq[e], where e2 = e and (a,b) ∈ (Fq[e])2. In a first time, we study the arithmetic of this ring. In addition, using the Weierstrass equation, we define the elliptic curve Ea,b(Fq[e]) and we will show that Eπ0(a),π0(b)(Fq) and Eπ1(a),π1(b)(Fq) are two elliptic curves over the field Fq, where π0 and π1 are respectively the canonical projection and the sum projection of coordinates of X ∈Fq[e]. Precisely, we give a bijection between the sets Ea,b(Fq[e]) and Eπ0(a),π0(b)(Fq)×Eπ1(a),π1(b)(Fq).


2009 ◽  
Vol 05 (02) ◽  
pp. 229-256 ◽  
Author(s):  
A. BANDINI ◽  
I. LONGHI

Let F be a global field of characteristic p > 0, 𝔽/F a Galois extension with [Formula: see text] and E/F a non-isotrivial elliptic curve. We study the behavior of Selmer groups SelE(L)l (l any prime) as L varies through the subextensions of 𝔽 via appropriate versions of Mazur's Control Theorem. In the case l = p, we let 𝔽 = ∪ 𝔽d where 𝔽d/F is a [Formula: see text]-extension. We prove that Sel E(𝔽d)p is a cofinitely generated ℤp[[ Gal (ℤd/F)]]-module and we associate to its Pontrjagin dual a Fitting ideal. This allows to define an algebraic L-function associated to E in ℤp[[Gal(ℤ/F)]], providing an ingredient for a function field analogue of Iwasawa's Main Conjecture for elliptic curves.


2012 ◽  
Vol 08 (04) ◽  
pp. 945-961 ◽  
Author(s):  
RUPAM BARMAN ◽  
GAUTAM KALITA

Let λ ∈ ℚ\{0, -1} and l ≥ 2. Denote by Cl, λ the nonsingular projective algebraic curve over ℚ with affine equation given by [Formula: see text] In this paper, we give a relation between the number of points on Cl, λ over a finite field and Gaussian hypergeometric series. We also give an alternate proof of a result of [D. McCarthy, 3F2 Hypergeometric series and periods of elliptic curves, Int. J. Number Theory6(3) (2010) 461–470]. We find some special values of 3F2 and 2F1 Gaussian hypergeometric series. Finally we evaluate the value of 3F2(4) which extends a result of [K. Ono, Values of Gaussian hypergeometric series, Trans. Amer. Math. Soc.350(3) (1998) 1205–1223].


2020 ◽  
Vol 19 ◽  

The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA) [2]. It is well known that the problem of discrete logarithm is NP-hard on group on elliptic curve (EC) [5]. The orders of groups of an algebraic affine and projective curves of Edwards [3, 9] over the finite field Fpn is studied by us. We research Edwards algebraic curves over a finite field, which are one of the most promising supports of sets of points which are used for fast group operations [1]. We construct a new method for counting the order of an Edwards curve [F ] d p E over a finite field Fp . It should be noted that this method can be applied to the order of elliptic curves due to the birational equivalence between elliptic curves and Edwards curves. The method we have proposed has much less complexity 22 O p log p at not large values p in comparison with the best Schoof basic algorithm with complexity 8 2 O(log pn ) , as well as a variant of the Schoof algorithm that uses fast arithmetic, which has complexity 42O(log pn ) , but works only for Elkis or Atkin primes. We not only find a specific set of coefficients with corresponding field characteristics for which these curves are supersingular, but we additionally find a general formula by which one can determine whether a curve [F ] d p E is supersingular over this field or not. The symmetric of the Edwards curve form and the parity of all degrees made it possible to represent the shape curves and apply the method of calculating the residual coincidences. A birational isomorphism between the Montgomery curve and the Edwards curve is also constructed. A oneto- one correspondence between the Edwards supersingular curves and Montgomery supersingular curves is established. The criterion of supersingularity for Edwards curves is found over F pn .


2020 ◽  
pp. 1-9
Author(s):  
Jeffrey Yelton

Abstract Given an elliptic curve E in Legendre form $y^2 = x(x - 1)(x - \lambda )$ over the fraction field of a Henselian ring R of mixed characteristic $(0, 2)$ , we present an algorithm for determining a semistable model of E over R that depends only on the valuation of $\lambda $ . We provide several examples along with an easy corollary concerning $2$ -torsion.


Author(s):  
Amirmehdi Yazdani Kashani ◽  
Hassan Daghigh

Many elliptic curve cryptosystems require an encoding function from a finite field Fq into Fq-rational points of an elliptic curve. We propose a uniform encoding to general elliptic curves over Fq. We also discuss about an injective case of SWU encoing for hyperelliptic curves of genus 2. Moreover we discuss about an injective encoding for elliptic curves with a point of order two over a finite field and present a description for these elliptic curves.


2016 ◽  
Vol 13 (01) ◽  
pp. 133-152
Author(s):  
Igor E. Shparlinski ◽  
Andrew V. Sutherland

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime [Formula: see text] and positive integer [Formula: see text], outputs an elliptic curve [Formula: see text] over the finite field [Formula: see text] for which the cardinality of [Formula: see text] is divisible by [Formula: see text]. The running time of the algorithm is [Formula: see text], and this leads to more efficient constructions of rational functions over [Formula: see text] whose image is small relative to [Formula: see text]. We also give an unconditional version of the algorithm that works for almost all primes [Formula: see text], and give a probabilistic algorithm with subexponential time complexity.


2016 ◽  
Vol 68 (4) ◽  
pp. 721-761 ◽  
Author(s):  
Vorrapan Chandee ◽  
Chantal David ◽  
Dimitris Koukoulopoulos ◽  
Ethan Smith

AbstractLetting p vary over all primes and E vary over all elliptic curves over the finite field 𝔽p, we study the frequency to which a given group G arises as a group of points E(𝔽p). It is well known that the only permissible groups are of the form Gm,k:=ℤ/mℤ×ℤ/mkℤ. Given such a candidate group, we let M(Gm,k) be the frequency to which the group Gm,karises in this way. Previously, C.David and E. Smith determined an asymptotic formula for M(Gm,k) assuming a conjecture about primes in short arithmetic progressions. In this paper, we prove several unconditional bounds for M(Gm,k), pointwise and on average. In particular, we show thatM(Gm,k) is bounded above by a constant multiple of the expected quantity when m ≤ kA and that the conjectured asymptotic for M(Gm,k) holds for almost all groups Gm,k when m ≤ k1/4-∈. We also apply our methods to study the frequency to which a given integer N arises as a group order #E(𝔽p).


Sign in / Sign up

Export Citation Format

Share Document