Continued Fractions Applied to a Family of RSA-like Cryptosystems

ePrint Report: Continued Fractions Applied to a Family of RSA-like Cryptosystems

George Teseleanu, Paul Cotan

Let $N=pq$ be the product of two balanced prime numbers $p$ and $q$. Murru and Saettone presented in 2017 an interesting RSA-like cryptosystem that uses the key equation $ed - k (p^2+p+1)(q^2+q+1) = 1$, instead of the classical RSA key equation $ed - k (p-1)(q-1) = 1$. The authors claimed that their scheme is immune to Wiener's continued fraction attack. Unfortunately, Nitaj \emph{et. al.} developed …

eprint report family rsa