Research ArticleNo Access

Number of rational points of elliptic curves

Viliam Ďuriš

Department of Mathematics, Constantine The Philosopher University in Nitra, Tr. A. Hlinku 1, 94974 Nitra, Slovakia

E-mail Address: vduris@ukf.sk

Search for more papers by this author

and

Timotej Šumný

Benkova primary school, Benkova 34, 949 11 Nitra, Slovakia

E-mail Address: sumnyt@gmail.com

Search for more papers by this author

https://doi.org/10.1142/S1793557122500176Cited by:0 (Source: Crossref)

Abstract

In the modern theory of elliptic curves, one of the important problems is the determination of the number of rational points on an elliptic curve. The Mordel–Weil theorem [T. Shioda, On the Mordell–Weil lattices, Comment. Math. University St. Paul.39(2) (1990) 211–240] points out that the elliptic curve defined above the rational points is generated by a finite group. Despite the knowledge that an elliptic curve has a final number of rational points, it is still difficult to determine their number and the way how to determine them. The greatest progress was achieved by Birch and Swinnerton–Dyer conjecture, which was included in the Millennium Prize Problems [A. Wiles, The Birch and Swinnerton–Dyer conjecture, The Millennium Prize Problems (American Mathematical Society, 2006), pp. 31–44]. This conjecture uses methods of the analytical theory of numbers, while the current knowledge corresponds to the assumptions of the conjecture but has not been proven to date. In this paper, we focus on using a tangent line and the osculating circle for characterizing the rational points of the elliptical curve, which is the greatest benefit of the contribution. We use a different view of elliptic curves by using Minkowki’s theory of number geometry [H. F. Blichfeldt, A new principle in the geometry of numbers, with some applications, Trans. Amer. Math. Soc.15(3) (1914) 227–235; V. S. Miller, Use of elliptic curves in cryptography, in Proc. Advances in Cryptology — CRYPTO ’85, Lecture Notes in Computer Science, Vol. 218 (Springer, Berlin, Heidelberg, 1985), pp. 417–426; E. Bombieri and W. Gubler, Heights in Diophantine Geometry, Vol. 670, 1st edn. (Cambridge University Press, 2007)].

Communicated by V. A. Artamonov

Keywords:

AMSC: 11G05, 14G05, 11H06

References

1. D. J. Bernstein, P. Birkner, M. Joye, T. Lange and C. Peters , Twisted Edwards curves, in Progress in Cryptology — AFRICACRYPT 2008, Lecture Notes in Computer Science, Vol. 5023 (Springer, Berlin, Heidelberg, 2008). Google Scholar
2. H. F. Blichfeldt , A new principle in the geometry of numbers, with some applications, Trans. Amer. Math. Soc. 15(3) (1914) 227–235. Crossref, Google Scholar
3. E. Bombieri and W. Gubler , Heights in Diophantine Geometry, Vol. 670, 1st edn. (Cambridge University Press, 2007). Google Scholar
4. D. Coppersmith, A. M. Odlzyko and R. Schroeppel , Discrete logarithms in GF $(p)$ $(p)$ , Algorithmica 1 (1986) 1–15. Crossref, Web of Science, Google Scholar
5. G. Frey , On ternary equations of Fermat type and relations with elliptic curves, Modular Forms and Fermat’s Last Theorem (Springer, New York, 1997), pp. 527–548. Crossref, Google Scholar
6. D. M. Gordon , Discrete logarithms in GF $(P)$ $(P)$ using the number field sieve, SIAM J. Discrete Math. 6(1) (1993) 124–138. Crossref, Web of Science, Google Scholar
7. P. Ingram , Specializations of elliptic surfaces, and divisibility in the Mordell–Weil group, Algebra Number Theory 5(4) (2011) 465–493, https://doi.org/10.2140/ant.2011.5.465. Crossref, Web of Science, Google Scholar
8. I. Kleiner , From Fermat to Wiles: Fermat’s last theorem becomes a theorem, Elemente Math. 55(1) (2000) 19–37. Crossref, Google Scholar
9. N. Koblitz , Elliptic curve cryptosystems, Math. Comp. 48(177) (1987) 203–209. Crossref, Web of Science, Google Scholar
10. V. S. Miller , Use of elliptic curves in cryptography, in Proc. Advances in Cryptology — CRYPTO ’85, Lecture Notes in Computer Science, Vol. 218 (Springer, Berlin, Heidelberg, 1985), pp. 417–426. Google Scholar
11. A. Miyaji and M. Tatebayashi, Public key cryptosystem with an elliptic curve. U.S. Patent No 5,272,755, (1993). Google Scholar
12. D. Poulakis , The number of solutions of the Mordell equation, Acta Arithm. 88(2) (1999) 173–179. Crossref, Web of Science, Google Scholar
13. K. Rektorys, Přehled užité matematiky. Praque: SNTL, (1981). Google Scholar
14. R. Schimmrigk and S. Underwood , The Shimura–Taniyama conjecture and conformal field theory, J. Geom. Phys. 48 (2003) 169–189, https://doi.org/10.1016/S0393-0440(03)00030-5. Crossref, Web of Science, Google Scholar
15. I. Semaev , Evaluation of discrete logarithms in a group of $p$ $p$ -torsion points of an elliptic curve in characteristic $p$ $p$ , Math. Comput. Amer. Math. Soc. 67(221) (1998) 353–356. Crossref, Web of Science, Google Scholar
16. A. Shallue and Ch. E. Van De Woestijne , Construction of rational points on elliptic curves over finite fields, in Int. Algorithmic Number Theory Symp. (Springer, Heidelberg, Berlin, 2006), pp. 510–524. Crossref, Google Scholar
17. T. Shioda , On the Mordell–Weil lattices, Comment. Math. University St. Paul. 39(2) (1990) 211–240. Google Scholar
18. C. L. Siegel , A mean value theorem in geometry of numbers, Ann. Math. (1945) 340–347. Crossref, Web of Science, Google Scholar
19. J. H. Silverman , Advanced Topics in the Arithmetic of Elliptic Curves (Springer-Verlag, New York, 1994). Crossref, Google Scholar
20. J. H. Silverman , The Arithmetic of Elliptic Curves (Springer-Verlag, New York, 2009). Crossref, Google Scholar
21. A. Wiles , Modular elliptic curves and Fermat’s last theorem, Ann. Math. 141(3) (1995) 443–551. Crossref, Web of Science, Google Scholar
22. A. Wiles , The Birch and Swinnerton–Dyer conjecture, The Millennium Prize Problems (American Mathematical Society, 2006), pp. 31–44. Google Scholar
23. S. Y. Yan , Elliptic curve cryptography, in Cybercryptography: Applicable Cryptography for Cyberspace Security, Chap. 7 (Springer International Publishing, 2019), pp. 343–398. Crossref, Google Scholar