Pages that link to "Item:Q1909875"

The following pages link to Counting points on elliptic curves over finite fields (Q1909875):

Displaying 50 items.

• Computing the endomorphism ring of an ordinary elliptic curve over a finite field (Q2430982) (← links)
• Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
• On the independence of Heegner points associated to distinct quadratic imaginary fields (Q2469208) (← links)
• Computing the height of volcanoes of \(\ell \)-isogenies of elliptic curves over finite fields (Q2474858) (← links)
• Rational points on elliptic curves \(y^2=x^3+a^3\) in \(\mathbb F_p\) where \(p\equiv 1\pmod 6\) is prime (Q2478039) (← links)
• Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
• A \(p\)-adic point counting algorithm for elliptic curves on Legendre form (Q2567155) (← links)
• Evaluation of Gaussian hypergeometric series using Huff's models of elliptic curves (Q2631620) (← links)
• Rational points on cubic, quartic and sextic curves over finite fields (Q2663304) (← links)
• Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields (Q2687269) (← links)
• The equivariant complexity of multiplication in finite field extensions (Q2693365) (← links)
• ``Chinese \& Match'', an alternative to Atkin's ``Match and Sort'' method used in the SEA algorithm (Q2701567) (← links)
• The canonical lift of an ordinary elliptic curve over a finite field and its point counting (Q2764527) (← links)
• An extension of Satoh's algorithm and its implementation (Q2764529) (← links)
• Computational Number Theory and Cryptography (Q2926150) (← links)
• (Q2935174) (← links)
• Computing functions on Jacobians and their quotients (Q2942126) (← links)
• Point counting on K3 surfaces and an application concerning real and complex multiplication (Q2970996) (← links)
• Computing cardinalities of -curve reductions over finite fields (Q2971005) (← links)
• Explicit isogenies in quadratic time in any characteristic (Q2971015) (← links)
• Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation (Q2971023) (← links)
• A $p$-adic algorithm to compute the Hilbert class polynomial (Q3055076) (← links)
• A generic approach to searching for Jacobians (Q3055104) (← links)
• Global Duality, Signature Calculus and the Discrete Logarithm Problem (Q3091979) (← links)
• Modular Polynomials for Genus 2 (Q3091984) (← links)
• <i>p</i>-adic class invariants (Q3092478) (← links)
• Computing endomorphism rings of elliptic curves under the GRH (Q3096951) (← links)
• A quasi-linear time algorithm for computing modular polynomials in dimension 2 (Q3196365) (← links)
• Sato-Tate distributions (Q3295946) (← links)
• Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms (Q3296197) (← links)
• Construction of strong elliptic curves suitable for cryptographic applications (Q3383074) (← links)
• On Polynomial Interpolations related to Verheul Homomorphisms (Q3430823) (← links)
• Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
• On the existence and non-existence of elliptic pseudoprimes (Q3584824) (← links)
• Efficient CM-constructions of elliptic curves over finite fields (Q3592699) (← links)
• Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography (Q3600496) (← links)
• Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields (Q3627456) (← links)
• (Q4224300) (← links)
• (Q4237387) (← links)
• Constructing Isogenies between Elliptic Curves Over Finite Fields (Q4267918) (← links)
• Remarks on the Schoof-Elkies-Atkin algorithm (Q4396461) (← links)
• Isomorphisms between Artin-Schreier towers (Q4501043) (← links)
• Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
• Counting Points in Medium Characteristic Using Kedlaya's Algorithm (Q4651432) (← links)
• Points on elliptic curves over finite fields (Q4677384) (← links)
• Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm (Q4700202) (← links)
• Modular equations for hyperelliptic curves (Q4821057) (← links)
• Computing Zeta Functions of Artin–schreier Curves over Finite Fields (Q4827595) (← links)
• Pairing the volcano (Q4911917) (← links)
• A Subexponential Algorithm for Evaluating Large Degree Isogenies (Q4931651) (← links)