Abstract.
In this short note we describe an elementary technique which leads to a linear algorithm for solving the discrete logarithm problem on elliptic curves of trace one. In practice the method described means that when choosing elliptic curves to use in cryptography one has to eliminate all curves whose group orders are equal to the order of the finite field.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received 9 December 1997 and revised 11 March 1998
Rights and permissions
About this article
Cite this article
Smart, N. The Discrete Logarithm Problem on Elliptic Curves of Trace One. J. Cryptology 12, 193–196 (1999). https://doi.org/10.1007/s001459900052
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001459900052