Computing binary curves of genus five
Du\v{s}an Dragutinovi\'c

TL;DR
This paper develops algorithms to classify all genus 5 curves over the finite field _2, categorizing them by their geometric types and analyzing their Jacobian isogeny classes, automorphisms, and Newton polygons.
Contribution
The paper introduces specific algorithms for enumerating all genus 5 curves over _2 up to isomorphism, distinguished by their geometric types and Jacobian properties.
Findings
Classified all genus 5 curves over _2 by type.
Computed the number of curves weighted by automorphism group size.
Analyzed isogeny classes and Newton polygons of Jacobians.
Abstract
Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in . We present and explain algorithms we used to determine, up to isomorphism over , all genus 5 curves defined over , and we do that separately for each of the three mentioned types. We consider these curves in terms of isogeny classes over of their Jacobians or their Newton polygons, and for each of the three types, we compute the number of curves over weighted by the size of their -automorphism groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Algebraic Geometry and Number Theory · Advanced Numerical Analysis Techniques
