Maple procedures for working with the group of rational divisors of a genus 2 hyperelliptic curve; designed for compatibility with generic_group procedures.
Archive of posts filed under the Maple category.
Elliptic Curve group law in Maple
Maple procedures for working with the group of rational points of an elliptic curve; designed for compatibility with generic_group procedures.
Abstract group operations in Maple
Maple procedures for order finding, DLP and multiplication by m in an abstract group
The SEA algorithm
Overview of the SEA algorithm for computing cardinality of elliptic curves over finite fields.
A less very, very stupid way of counting points on elliptic curves
Sidestepping brute-force determination of the number of points over a finite field by construction of zeta functions.
Small defect types in Maple
Maple procedures for finding polynomials of a given trace and degree; hence for establishing the possible types of zeta function for small defect.
Elliptic Divisibility Sequences
EDS, their connection to elliptic curves and Maple procedures for working with them.
The Torsion subgroup of an Elliptic Curve
Yet more Maple code, this time for finding/classifying torsion points of an elliptic curve.
Implementing the Group Law Algorithm in Maple- finite fields
Extension of Maple code to finite fields.
Implementing the Group Law Algorithm in Maple- Examples
Sample problems from Silverman on the Elliptic curve group law.
