Constructing elliptic curves and curves of genus 2 over finite fields
From MaRDI portal
Publication:2829798
Recommendations
- A CRT algorithm for constructing genus 2 curves over finite fields
- A CM construction for curves of genus 2 with \(p\)-rank 1
- scientific article; zbMATH DE number 2154267
- Constructing elliptic curves of prime order
- Efficient CM-constructions of elliptic curves over finite fields
- The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
- On counting and generating curves over small finite fields
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- Constructing hyperelliptic covers for elliptic curves over quadratic extension fields
- Computing endomorphism rings of Jacobians of genus 2 curves over finite fields
Cited in
(13)- Computing genus 2 curves from invariants on the Hilbert moduli space
- A CRT algorithm for constructing genus 2 curves over finite fields
- Improved CRT algorithm for class polynomials in genus 2
- Genus 2 curves with complex multiplication
- Constructing hyperelliptic curves of genus 2 suitable for cryptography
- Constructing elliptic curves over finite fields using double eta-quotients
- \(N\)-systems, class polynomials of double eta-quotients and singular values of \(j\)-invariant function
- scientific article; zbMATH DE number 2154267 (Why is no real title available?)
- scientific article; zbMATH DE number 15984 (Why is no real title available?)
- Constructing Picard curves with complex multiplication using the Chinese remainder theorem
- On counting and generating curves over small finite fields
- Constructing elliptic curves from Galois representations
- Families of elliptic curves with genus 2 covers of degree 2
This page was built for publication: Constructing elliptic curves and curves of genus 2 over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829798)