Finding elliptic curves with a subgroup of prescribed size
From MaRDI portal
Publication:3179510
DOI10.1142/S1793042117500099zbMath1377.11074arXiv1403.7887MaRDI QIDQ3179510
Andrew V. Sutherland, Igor E. Shparlinski
Publication date: 21 December 2016
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.7887
Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Polynomials over finite fields (11T06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bicovering arcs and small complete caps from elliptic curves
- On the distribution of Atkin and Elkies primes
- Value sets of Dickson polynomials over finite fields
- Discrete logarithms, Diffie-Hellman, and reductions
- On the deterministic complexity of factoring polynomials over finite fields
- Factoring integers with elliptic curves
- Short sums of certain arithmetic functions
- PRIMES is in P
- On the characterization of minimal value set polynomials
- The distribution of integers with a divisor in a given interval
- Topics in multiplicative number theory
- Multiple Discrete Logarithm Problems with Auxiliary Inputs
- Computing Igusa class polynomials
- Modern Computer Algebra
- Mathematics of Public Key Cryptography
- Quadratic non-residues in short intervals
- A Group Action on $${\mathbb Z}_p^{\times }$$ and the Generalized DLP with Auxiliary Inputs
- The complexity of class polynomial computation via floating point approximations
- Computing Hilbert class polynomials with the Chinese remainder theorem
- On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions
- The distribution of quadratic residues and non‐residues
- On Certain Character Sums
- A Hyperelliptic Smoothness Test, II
- A new approach to the discrete logarithm problem with auxiliary inputs
- Choosing the correct elliptic curve in the CM method
- Efficient CM-constructions of elliptic curves over finite fields
- The Arithmetic of Elliptic Curves
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- A Note on Elliptic Curves Over Finite Fields
- A Rigorous Time Bound for Factoring Integers
- A Brun-Titschmarsh theorem for multiplicative functions.
- A note on elliptic curves over finite fields
- A hyperelliptic smoothness test. I
- Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
- Class Invariants by the CRT Method
- Accelerating the CM method
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
- Abelian varieties over finite fields
- On primes in arithmetic progressions
- Discrete logarithm problems with auxiliary inputs
This page was built for publication: Finding elliptic curves with a subgroup of prescribed size
