A non-reducible Meyer‑Muller's like elliptic curve cryptosystem

In this paper we present a novel variant of Meyer‑M¨uller's elliptic curve cryptosystem. Unlike Meyer‑ M¨uller's proposal and its Chua-Ling's variant, the one presented here is not reducible to Rabin‑Williams' cryptosystem. This is formally proven under the assumption that computing half points on elliptic curves defined over the ring Z/nZ is hard when the factorization of n is unknown.