Abstract
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the curve. For this, we reduce the problem to the task of finding a rational point on a curve of genus zero. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Shallue, A., & Van De Woestijne, C. E. (2006). Construction of rational points on elliptic curves over finite fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4076 LNCS, pp. 510–524). Springer Verlag. https://doi.org/10.1007/11792086_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free