Many efficient algorithms of Montgomery-form elliptic curve cryptology have been investigated recently. At present, there are no reported studies of the isomorphic class of the Montgomery-form elliptic curve over a finite field. This paper investigates the isomorphism of Montgomery-form elliptic curves via the isomorphism of Weierstrass-form elliptic curves and gives a table of (nearly) all the forms of Montgomery- form elliptic curves suitable for cryptographic usage. Then, an algorithm for generating a secure elliptic curve with Montgomery-form is presented. The most important advantages of the new algorithm are that it avoids the transformation from an elliptic curve’s Weierstrass-form to its Montgomery-form, and that it de- creases the probability of collision. So, the proposed algorithem is quicker, simpler, and more efficient than the old ones. Many efficient algorithms of Montgomery-form elliptic curve cryptology have been investigated recently. At present, there are no reported studies of the isomorphic class of the Montgomery-form elliptic curve over a finite field. This paper investigates the isomorphism of Montgomery-form elliptic curves via the isomorphism of Weierstrass-form elliptic curves and gives a table of (nearly) all the forms of Montgomery- form elliptic curves suitable for cryptographic usage. Then, an algorithm for generating a secure elliptic curve with Montgomery-form is presented. The most important advantages of the new algorithm are that it avo avoids the transformation from an elliptic curve’s Weierstrass-form to its Montgomery-form, and that it de- creases the probability of collision. So, the proposed algorithem is quicker, simpler, and more efficient than the old ones.