Some computational problems of cryptographic significance concerning elliptic curves over rings
Two computational problems related to an elliptic curve \(E\) over a finite ring \(Z_n\) with \(n\) square-free are studied, namely computing the number of rational points of \(E\) and finding \(Q\) such that, for a given rational point \(P\), \(2Q= P\). Concerning the computational complexity, the two problems are equivalent to integer factoring.
scientific article; zbMATH DE number 1853046
scientific article