Modular polynomials on Hilbert surfaces

Enea Milio 1 Damien Robert 2
1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
2 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : We describe an evaluation/interpolation approach to compute modular polynomials on a Hilbert surface, which parametrizes abelian surfaces with maximal real multiplication. Under some heuristics we obtain a quasi-linear algorithm. The corresponding modular polynomials are much smaller than the ones on the Siegel threefold. We explain how to compute even smaller polynomials by using pullbacks of theta functions to the Hilbert surface, and give an application to the CRT method to construct class polynomials.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [71 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01520262
Contributor : Enea Milio <>
Submitted on : Saturday, September 9, 2017 - 10:50:08 AM
Last modification on : Tuesday, December 18, 2018 - 4:18:26 PM

File

articleHilbert.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01520262, version 2

Citation

Enea Milio, Damien Robert. Modular polynomials on Hilbert surfaces. 2017. ⟨hal-01520262v2⟩

Share

Metrics

Record views

369

Files downloads

240