Efficient CM-constructions of elliptic curves over finite fields

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)

zbMATH Keywords

elliptic curves; finite fields; complex multiplication; class polynomial

Mathematics Subject Classification ID

94A60: Cryptography

14H52: Elliptic curves

11G20: Curves over finite and local fields

14G15: Finite ground fields in algebraic geometry

11G15: Complex multiplication and moduli of abelian varieties

Related Items

Computing Hilbert class polynomials with the Chinese remainder theorem

Uses Software

• ECPP

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