Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 31106
The Number of Rational Points on Elliptic Curves y2 = x3 + b2 Over Finite Fields

Authors: Betül Gezer, Hacer Özden, Ahmet Tekcan, Osman Bizim

Abstract:

Let p be a prime number, Fpbe a finite field and let Qpdenote the set of quadratic residues in Fp. In the first section we givesome notations and preliminaries from elliptic curves. In the secondsection, we consider some properties of rational points on ellipticcurves Ep,b: y2= x3+ b2 over Fp, where b ∈ F*p. Recall that theorder of Ep,bover Fpis p + 1 if p ≡ 5(mod 6). We generalize thisresult to any field Fnp for an integer n≥ 2. Further we obtain someresults concerning the sum Σ[x]Ep,b(Fp) and Σ[y]Ep,b(Fp), thesum of x- and y- coordinates of all points (x, y) on Ep,b, and alsothe the sum Σ(x,0)Ep,b(Fp), the sum of points (x, 0) on Ep,b.

Keywords: Elliptic curves over finite fields, rational points on elliptic curves

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1330831

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1554

References:


[1] G.E. Andrews. Number Theory. Dover Pub., 1971
[2] A.O.L. Atkin and F. Moralin. Eliptic Curves and Primality Proving.Math. Comp. 61 (1993), 29?68.
[3] S. Goldwasser and J. Kilian. Almost all Primes can be Quickly Certified.In Proc. 18th STOC, Berkeley, May 28-30, 1986, ACM, New York(1986), 316-329.
[4] N. Koblitz. A Course in Number Theory and Cryptography. Springer-Verlag, 1994.
[5] H.W.Jr. Lenstra. Factoring Integers with Elliptic Curves. Annals ofMaths. 126(3) (1987), 649?673.
[6] V.S. Miller. Use of Elliptic Curves in Cryptography, in Advances inCryptology?CRYPTO?85. Lect. Notes in Comp. Sci. 218, Springer-Verlag, Berlin (1986), 417?426.
[7] R.A. Mollin. An Introduction to Cryptography. Chapman&Hall/CRC,2001.
[8] L.J. Mordell. On the Rational Solutions of the Indeterminate Eqnarraysof the Third and Fourth Degrees. Proc. Cambridge Philos. Soc. 21(1922),179?192.
[9] R. Schoof. Counting Points on Elliptic Curves Over Finite Fields.Journal de Theorie des Nombres de Bordeaux 7(1995), 219?254.
[10] J.H. Silverman. The Arithmetic of Elliptic Curves. Springer-Verlag, 1986.
[11] A.Tekcan. Elliptic Curves y2 = x3?t2x over Fp. International Journalof Mathematics Sciences 1(3)(2007), 165-171.
[12] L.C. Washington. Elliptic Curves, Number Theory and Cryptography.Chapman&Hall /CRC, Boca London, New York, Washington DC, 2003.
[13] A. Wiles. Modular Elliptic Curves and Fermat?s Last Theorem. Annalsof Maths. 141(3) (1995), 443?551.