1. Régis Dupont, Andreas Enge, and François Morain, Building curves with arbitrary small MOV degree over finite prime fields, J. Cryptology 18 (2005), no. 2, 79–89.[MR]
  2. I. Duursma, P. Gaudry, and F. Morain, Speeding up the discrete log computation on curves with automorphisms, Advances in Cryptology—Asiacrypt'99 (Singapore), Lecture Notes in Comput. Sci., vol. 1716, Springer, Berlin, 1999, pp. 103–121.[MR]
  3. G. Hanrot and F. Morain, Solvability by radicals from an algorithmic point of view, in Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2001, pp. 175–182 (electronic).[MR]
  4. F. Morain, Primality proving using elliptic curves: An update, Algorithmic Number Theory (Portland, OR, 1998), Lecture Notes in Comput. Sci., vol. 1423, Springer, Berlin, 1998, pp. 111–127.[MR]