CRYPTANALYSIS OF RSA-LIKE CRYPTOSYSTEM WITH MODULUS N = pq AND ed ≡ 1(mod (p² + p + 1)(q² + q + 1)).

In 2018, N. Murru and F. M. Saettone proposed a novel RSA-like cryptosystem with modulus N = pq and ed ≡ 1(mod (p²+p+1)(q²+q+1)) based on a generalization of the Rffedei Rational functions. In this paper, we give some bounds on the deciphering exponent d = Nδ, in which this RSA-like cryptosystem is insecure. For the enciphering exponent e = Nα and p + q + 1 = Nα, the attack bound on d is ... in the case of α < 1 and ... when α > 1. Furthermore, we describe the magnitude of the bounds in all cases of α and β. [ABSTRACT FROM AUTHOR]