1. David Freeman, Constructing pairing-friendly genus 2 curves with ordinary Jacobians, Pairing-based cryptography—Pairing 2007, Lecture Notes in Comput. Sci., vol. 4575, Springer, Berlin, 2007, pp. 152-176.[MR]
  2. David Freeman and Kristin Lauter, Computing endomorphism rings of Jacobians of genus 2 curves over finite fields, Algebraic geometry and its applications, Ser. Number Theory Appl., vol. 5, World Sci. Publ., Hackensack, NJ, 2008, pp. 29–66.[MR]
  3. David Mandell Freeman and Takakazu Satoh, Constructing pairing-friendly hyperelliptic curves using Weil restriction, Preprint (2010), 1–31.[link]
  4. David Freeman, Michael Scott, and Edlyn Teske, A taxonomy of pairing-friendly elliptic curves, Journal of Cryptology 23 (2010), no. 2, 224–280.[doi/eprint]
  5. David Freeman, Peter Stevenhagen, and Marco Streng, Abelian varieties with prescribed embedding degree, Algorithmic Number Theory, Lecture Notes in Computer Science, vol. 5011, Springer, 2008, pp. 60-73.[arXiv]