Elliptic Curves with a Given Number of Points. - Reinier Bröker; Peter Stevenhagen (ANTS, 2004)

Efficient CM-constructions of elliptic curves over finite fields. - Reinier Bröker; Peter Stevenhagen (Math. Comput., 2007)

Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography. - Reinier Bröker; Denis Xavier Charles; Kristin E. Lauter (Pairing, 2008)

Computing Hilbert Class Polynomials. - Juliana Belding; Reinier Bröker; Andreas Enge; Kristin E. Lauter (IACR Cryptol. ePrint Arch., 2008)

A p-adic algorithm to compute the Hilbert class polynomial. - Reinier Bröker (Math. Comput., 2008)

Modular Polynomials for Genus 2. - Reinier Bröker; Kristin E. Lauter (LMS J. Comput. Math., 2009)

p-adic class invariants. - Reinier Bröker (LMS J. Comput. Math., 2011)

Modular polynomials via isogeny volcanoes. - Reinier Bröker; Kristin E. Lauter; Andrew V. Sutherland (Math. Comput., 2012)

Evaluating Igusa functions. - Reinier Bröker; Kristin E. Lauter (Math. Comput., 2014)

Genus-2 curves and Jacobians with a given number of points. - Reinier Bröker; Everett W. Howe; Kristin E. Lauter; Peter Stevenhagen (LMS J. Comput. Math., 2015)

Fourier coefficients of sextic theta series. - Reinier Bröker; Jeffrey Hoffstein (Math. Comput., 2016)