Pages that link to "Item:Q1909876"

The following pages link to Computing the number of points on an elliptic curve over a finite field: algorithmic aspects (Q1909876):

Displaying 16 items.

• Modular polynomials on Hilbert surfaces (Q784730) (← links)
• Computing the cardinality of CM elliptic curves using torsion points (Q933164) (← links)
• Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
• Towards practical key exchange from ordinary isogeny graphs (Q1710681) (← links)
• Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001 (Q1826275) (← links)
• Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields (Q2687269) (← links)
• ``Chinese & Match'', an alternative to Atkin's ``Match and Sort'' method used in the SEA algorithm (Q2701567) (← links)
• Computing the $\ell $-power torsion of an elliptic curve over a finite field (Q3055170) (← links)
• Computing modular polynomials in quasi-linear time (Q3055173) (← links)
• Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
• Remarks on the Schoof-Elkies-Atkin algorithm (Q4396461) (← links)
• Schwarzian conditions for linear differential operators with selected differential Galois groups (Q4597594) (← links)
• Modular equations for hyperelliptic curves (Q4821057) (← links)
• Modular forms, Schwarzian conditions, and symmetries of differential equations in physics (Q5272601) (← links)
• Modular polynomials via isogeny volcanoes (Q5389453) (← links)
• Construction of elliptic curves with cyclic groups over prime fields (Q5479047) (← links)