Paper 2025/1396

A Generalized Wiener-type Attack Against a Family RSA-like Cryptosystem

Abstract

Let $N = pq$ be the product of two balanced prime numbers $p$ and $q$. In 2023, Cotan and Te\c seleanu introduced a family of RSA-like cryptosystems based on the key equation $ed - k(p^n - 1)(q^n - 1) = 1$, where $n \geq 1$. Note that when $n = 1$, we obtain the classical RSA system, while $n = 2$ yields the variant proposed by Elkamchouchi, Elshenawy, and Shaban. In this paper, we present a novel attack that combines continued fractions with lattice-based methods for the case $n = 6$. This represents a natural continuation of previous research, which successfully applied similar techniques for $n = 1, 2, 4$.