Efficient CM-constructions of elliptic curves over finite fields
From MaRDI portal
Publication:3592699
DOI10.1090/S0025-5718-07-01980-1zbMath1127.14022MaRDI QIDQ3592699
Peter Stevenhagen, Reinier Bröker
Publication date: 13 September 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Complex multiplication and moduli of abelian varieties (11G15)
Related Items (8)
On the hardness of the computational ring-LWR problem and its applications ⋮ Finding elliptic curves with a subgroup of prescribed size ⋮ ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Smooth factors of integers and elliptic curve based factoring with an oracle ⋮ CSIDH: an efficient post-quantum commutative group action ⋮ Genus-2 curves and Jacobians with a given number of points ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem
Uses Software
Cites Work
- Weber's class invariants revisited
- PRIMES is in P
- Counting points on elliptic curves over finite fields
- The Difference Between Consecutive Primes, II
- Proving primality in essentially quartic random time
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- A Rigorous Time Bound for Factoring Integers
- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2
- Progress in Cryptology - INDOCRYPT 2003
- Elliptic Curves with a Given Number of Points
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient CM-constructions of elliptic curves over finite fields
