On the implementation of elliptic curve cryptosystems (Q3972886)

[For the entire collection see Zbl 0719.00029.] The group of points on an elliptic curve over a field of characteristic \(p>3\) can be defined as the set of solutions \((x,y)\) of the general Weierstrass equation \(y^ 2=x^ 3+ax+b\) and, in the case of characteristic \(p=2\), \(y^ 2+y=x^ 3+ax+b\). The authors consider the family of elliptic curves having coefficient \(a=0\), in which case, the order of the group of the elliptic curve over \(\text{GF}(p)\) with \(p=-1\bmod 3\) is \((p+1)\) and over \(\text{GF}(2^ m)\) where \(m\) is odd is \(2^{m+1}\). The authors propose this family of elliptic curves for cryptographic use and give numerical examples which could have some cryptographic applications.