Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
A Nagell Algorithm in Any Characteristic
verfasst von : Mehdi Tibouchi
Erschienen in: Cryptography and Security: From Theory to Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Any non-singular plane cubic with a rational point is an elliptic curve, and is therefore birationally equivalent to a curve in Weierstraß form. Such a birational equivalence can be found using generic techniques, but they are computationally quite inefficient.
As early as 1928, Nagell proposed a much simpler procedure to construct that birational equivalence in the particular case of plane cubics, which is implemented in computer algebra packages to this day. However, the procedure fails in even characteristic. We show how the algorithm can be modified to work in any characteristic.