A Nagell algorithm in any characteristic

DOI10.1007/978-3-642-28368-0_30MaRDI QIDQ2889796zbMATH OpenOpenAlexFDO

Authors Mehdi Tibouchi

Publication date 8 June 2012

Published in Cryptography and Security: From Theory to Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28368-0_30

zbMATH Keywords

elliptic curvesbinary fieldsNagell algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Computational aspects of algebraic curves (14Q05)

Recommendations

• Addendum to a paper of Harada and Lang
• scientific article; zbMATH DE number 3075869
• Computing projective equivalences of planar curves birationally equivalent to elliptic and hyperelliptic curves
• scientific article; zbMATH DE number 828356
• The arithmetic of Jacobian groups of superelliptic cubics

Cited in

(1)

• An explicit construction for \(n\)-contact curves to a smooth cubic via divisions of polynomials and Zariski tuples

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: A Nagell algorithm in any characteristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889796)