The Weierstrass normal form of elliptic curves (in fields with characteristic != 2 and != 3) over field has found many applications in cryptography. But this curve form has also two types: non-singular ( that can be used in crypto) and singular (that can’t). Let’s take a look why singular curves causes problems in cryptography.
Singular curves is the curves where discriminant is equal to zero, so
In such cases, this curve can be represented in two forms:
-
(when there is a triple root 0) where using mapping it gives an isomorphism to additive group ( with same order ) where discrete logarithm is trivial.
-
(when there is a double root 0) where using mapping it gives an isomorphism to multiplicative group (with order ) where discrete logarithm problem is easy to solve for default elliptic key sizes.
This both cases are perfectly overviewed in Section 2.10 of Washington’s Elliptic Curves: Number Theory and Cryptography.
Here is an example how to solve discrete logarithm problem for such curves.