Abstract
We propose an algorithm to compute the Frobenius polynomial of an ordinary non hyperelliptic curve of genus 3 over double-struck F sign2N. The method is a generalization of Mestre's AGM-algorithm for hyperelliptic curves and leads to a quasi quadratic time algorithm for point counting. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
APA
Ritzenthaler, C. (2004). Point counting on genus 3 non hyperelliptic curves. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3076, 379–394. https://doi.org/10.1007/978-3-540-24847-7_29
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