The methods of finding points on elliptic curves over finite fields are presented with special emphasis on deterministic algorithms. Such algorithms were unknown until 2005. Earlier methods were probabilistic in nature and their efficiency was strongly conditioned on unproved Riemann conjectures.
REFERENCES(10)
1.
E. Bach, Explicit bounds for primality testing and related problems, Math. Comp. 55 (1990), 355–380.
A. Shallue, C. van de Woestijne, Construction of rational points on elliptic curves over finite fields, Lecture Notes in Computer Science 4076, Springer 2006, 510–524.
D. Shanks, Five number-theoretic algorithms, Congressus Numerantium 7 , Proc. 2 nd Manitoba Conf. on Numerical Math. (University of Manitoba), 1972, 51–70.
We process personal data collected when visiting the website. The function of obtaining information about users and their behavior is carried out by voluntarily entered information in forms and saving cookies in end devices. Data, including cookies, are used to provide services, improve the user experience and to analyze the traffic in accordance with the Privacy policy. Data are also collected and processed by Google Analytics tool (more).
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.