The following pages link to (Q4737490):
Displaying 15 items.
- Modular polynomials on Hilbert surfaces (Q784730) (← links)
- Computing the cardinality of CM elliptic curves using torsion points (Q933164) (← links)
- Ramanujan's class invariants and their use in elliptic curve cryptography (Q988264) (← links)
- Generalized class polynomials (Q2100588) (← links)
- Constructing elliptic curves over finite fields using double eta-quotients (Q2483709) (← links)
- Generalised Weber functions (Q2875425) (← links)
- Fast evaluation of modular functions using Newton iterations and the AGM (Q3015060) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Computing modular polynomials in quasi-linear time (Q3055173) (← links)
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443) (← links)
- Choosing the correct elliptic curve in the CM method (Q3584790) (← links)
- (Q3840199) (← links)
- An approach for computing generators of class fields of imaginary quadratic number fields using the Schwarzian derivative (Q5018375) (← links)
- (Q5150422) (← links)
- On the efficient generation of prime-order elliptic curves (Q5962222) (← links)
