Can $y^2=x^3-x+1$ elliptic curve with $GF(3^m)$ where $m=97$ be used for Diffie Hellman key exchange? I am new to ECC. I have just read about the elliptic curve $y^2=x^3-x+1$. I am copying the exact line

The elliptic curve is super-singular $E:y^2=x^3-x+1$ in affine coordinates defined over a Galois field $GF(3^m)$, $m=97$, whose irreducible polynomial is $x^{97}+x^{12}+2$.

Now I have three questions.

How is this curve different from than ordinary elliptic curve $(GF (2^m))$?
Can this graph be used to implement ECDH?
How secure is this curve compared to NIST's recommended curve parameters?

Thank you in advance for your help.
This curve is thoroughly insecure. These researchers performed a computation to break discrete log on this exact curve.
All small characteristic pairing-friendly curves are insecure under modern knowledge. Here is another paper breaking discrete log on a curve over $\operatorname{GF}(3^{6\cdot 509})$ -- note that this field size is much bigger than your curve.