1. Mark Bauer, Edlyn Teske, and Annegret Weng, Point counting on Picard curves in large characteristic, Math. Comp. 74 (2005), no. 252, 1983–2005 (electronic).[MR]
  2. Friederike Brezing and Annegret Weng, Elliptic curves suitable for pairing based cryptography, Des. Codes Cryptogr. 37 (2005), no. 1, 133–141.[MR]
  3. P. Gaudry, T. Houtmann, D. Kohel, C. Ritzenthaler, and A. Weng, The 2-adic CM method for genus 2 curves with application to cryptography, Advances in cryptology—ASIACRYPT 2006, Lecture Notes in Comput. Sci., vol. 4284, Springer, Berlin, 2006, pp. 114–129.[MR]
  4. Kenji Koike and Annegret Weng, Construction of CM Picard curves, Math. Comp. 74 (2005), no. 249, 499–518 (electronic).[MR]
  5. Annegret Weng, Generation of random Picard curves for cryptography, Preprint (2004), 7 pages.
  6. Annegret Weng, A low-memory algorithm for point counting on Picard curves, Des. Codes Cryptogr. 38 (2006), no. 3, 383–393.[MR]