Counting points on elliptic curves over finite fields
From MaRDI portal
Publication:1909875
DOI10.5802/jtnb.142zbMath0852.11073OpenAlexW2037816851MaRDI QIDQ1909875
Publication date: 24 March 1996
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=JTNB_1995__7_1_219_0
Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05)
Related Items
An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function, Breaking SIDH in polynomial time, DiSSECT: distinguisher of standard and simulated elliptic curves via traits, A new isogeny representation and applications to cryptography, Efficiently computable complex multiplication of elliptic curves, Arithmetic progressions in certain subsets of finite fields, Degree and height estimates for modular equations on PEL Shimura varieties, On the efficient generation of prime-order elliptic curves, Fast computation of elliptic curve isogenies in characteristic two, Multiple images encryption based on 3D scrambling and hyper-chaotic system, Constructing Isogenies between Elliptic Curves Over Finite Fields, Quantum lattice enumeration and tweaking discrete pruning, Evaluation of Gaussian hypergeometric series using Huff's models of elliptic curves, Improved generalized Atkin algorithm for computing square roots in finite fields, Modular equations for hyperelliptic curves, Computing the number of points on an elliptic curve over a finite field: algorithmic aspects, A quasi-linear time algorithm for computing modular polynomials in dimension 2, Computational Number Theory and Cryptography, Computing Zeta Functions of Artin–schreier Curves over Finite Fields, Rational points on cubic, quartic and sextic curves over finite fields, Computing modular Galois representations, Computing functions on Jacobians and their quotients, Distorting the volcano, Hilbert modular polynomials, Approximating Euler products and class number computation in algebraic function fields, -adic images of Galois for elliptic curves over (and an appendix with John Voight), On the distribution of Atkin and Elkies primes, Improvements to the deformation method for counting points on smooth projective hypersurfaces, Cryptography on elliptic curves over \(p\) -adic number fields, Spreading alerts quietly and the subgroup escape problem, On a theorem of Mestre and Schoof, Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields, Computing bilinear pairings on elliptic curves with automorphisms, Computing the endomorphism ring of an ordinary elliptic curve over a finite field, Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic, Unnamed Item, The equivariant complexity of multiplication in finite field extensions, Some properties of reduced modular polynomials, Point counting on K3 surfaces and an application concerning real and complex multiplication, Computing cardinalities of -curve reductions over finite fields, Explicit isogenies in quadratic time in any characteristic, Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation, Trace formulas for Hecke operators, Gaussian hypergeometric functions, and the modularity of a threefold, ``Chinese & Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm, Computing isomorphisms and embeddings of finite fields, Towards practical key exchange from ordinary isogeny graphs, Some properties of reduced Drinfeld modular polynomials, Computing Hilbert Class Polynomials, Computing Zeta Functions in Families of C a,b Curves Using Deformation, Modular polynomials via isogeny volcanoes, Computing the cardinality of CM elliptic curves using torsion points, Sato-Tate distributions, Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms, Computing modular correspondences for abelian varieties, A low-memory algorithm for finding short product representations in finite groups., Point counting in families of hyperelliptic curves, ON THE DISTRIBUTION OF ORDERS OF FROBENIUS ACTION ON ^-TORSION OF ABELIAN SURFACES, On the elliptic curve endomorphism generator, On the independence of Heegner points associated to distinct quadratic imaginary fields, Refinement of the four-dimensional GLV method on elliptic curves, Pairing the volcano, A class of hyper-bent functions and Kloosterman sums, Counting Points in Medium Characteristic Using Kedlaya's Algorithm, Computing the height of volcanoes of \(\ell \)-isogenies of elliptic curves over finite fields, Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\), Rational points on elliptic curves \(y^2=x^3+a^3\) in \(\mathbb F_p\) where \(p\equiv 1\pmod 6\) is prime, Fast algorithms for computing isogenies between elliptic curves, Identifying supersingular elliptic curves, Counting the order of the group of points of an elliptic curve over a finite field based on Shanks's algorithm, Algorithms for modular counting of roots of multivariate polynomials, Computing separable isogenies in quasi-optimal time, Remarks on the Schoof-Elkies-Atkin algorithm, On the existence and non-existence of elliptic pseudoprimes, Fast arithmetic in unramified \(p\)-adic fields, A Subexponential Algorithm for Evaluating Large Degree Isogenies, Efficient CM-constructions of elliptic curves over finite fields, A local-global principle for rational isogenies of prime degree, Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?, Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography, A $p$-adic algorithm to compute the Hilbert class polynomial, A generic approach to searching for Jacobians, Ramanujan's class invariants and their use in elliptic curve cryptography, Algebraic approaches for solving isogeny problems of prime power degrees, Об алгоритмах построения изогений эллиптических кривых над конечными полями и их приложениях, Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules, Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, Construction of strong elliptic curves suitable for cryptographic applications, Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus, Expander graphs based on GRH with an application to elliptic curve cryptography, Global Duality, Signature Calculus and the Discrete Logarithm Problem, Modular Polynomials for Genus 2, p-adic class invariants, Linearizing torsion classes in the Picard group of algebraic curves over finite fields, Construction of elliptic curves with cyclic groups over prime fields, Computing endomorphism rings of elliptic curves under the GRH, On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field, On the complexity of the discrete logarithm and Diffie-Hellman problems, On counting and generating curves over small finite fields, Point counting on reductions of CM elliptic curves, Modular polynomials on Hilbert surfaces, Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves, Finding exact values of a character sum, On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average, On Polynomial Interpolations related to Verheul Homomorphisms, Isomorphisms between Artin-Schreier towers, Pseudorandom vector generation using elliptic curves and applications to Wiener processes, Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
Uses Software
Cites Work
