text: If, despite the preceding admonition, one decides to construct one's own domain parameters, one should select the underlying field and then use one of the following strategies to find a curve with appropriate (i.e., near prime) number of points using one of the following methods:
  Select a random curve and use a general point-counting algorithm, for example, Schoof's algorithm or the Schoof–Elkies–Atkin algorithm,
  Select a random curve from a family which allows easy calculation of the number of points (e.g., Koblitz curves), or
  Select the number of points and generate a curve with this number of points using the complex multiplication technique.
  Several classes of curves are weak and should be avoided:
  Curves over  with non-prime m are vulnerable to Weil descent attacks.
  Curves such that n divides  (where p is the characteristic of the field: q for a prime field, or  for a binary field) for sufficiently small B are vulnerable to Menezes–Okamoto–Vanstone (MOV) attack which applies usual discrete logarithm problem (DLP) in a small-degree extension field of  to solve ECDLP.  The bound B should be chosen so that discrete logarithms in the field  are at least as difficult to compute as discrete logs on the elliptic curve .
  Curves such that  are vulnerable to the attack that maps the points on the curve to the additive group of .