48 citations · 136 across the 22 of their papers we have counts for
Showing 2004 · math.NTShow all
3 papers · 2 filters
math.NT2004★ 1 cited
Computing Modular Polynomials
Denis Charles, Kristin Lauter
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many a…
math.NT2004★ 2 cited
Class invariants for quartic CM fields
Eyal Z. Goren, Kristin E. Lauter
One can define class invariants for a quartic primitive CM field K as special values of certain Siegel (or Hilbert) modular functions at CM points corresponding to K. We provide ex…
math.NT2004
A CRT algorithm for constructing genus 2 curves over finite fields
Kirsten Eisentraeger, Kristin Lauter
We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, w…