@incollection{MR2214104,
  file = {We consider the generation of prime order elliptic curves (ECs) over a prime field using the Complex Multiplication (CM) method. A crucial step of this method is to compute the roots of a special type of class field polynomials with the most commonly used being the Hilbert and Weber ones, uniquely determined by the CM discriminant D. The roots of Hilbert polynomials generate the EC directly, but have high computational demands. Weber polynomials have small computational demands, but their roots do not generate directly the EC, and hence certain transformations are required to map their roots to the roots of their Hilbert counterparts. },
  publisher = {Springer},
  mrclass = {94A60 (11F03 11G15 11Y40)},
  mrnumber = {2214104 (2007a:94194)},
  year = {2005},
  booktitle = {Information security and cryptology---{ICISC} 2004},
  url = {http://dx.doi.org/10.1007/11496618_20},
  author = {Konstantinou, Elisavet and Kontogeorgis, Aristides and Stamatiou, Yannis C. and Zaroliagis, Christos},
  mrreviewer = {David Y. Jao},
  address = {Berlin},
  series = {Lecture Notes in Comput. Sci.},
  pages = {261--278},
  volume = {3506},
  doi = {10.1007/11496618_20},
  title = {Generating prime order elliptic curves: difficulties and efficiency considerations}
}