Welcome to the resource topic for 2025/1396
Title:
A Generalized Wiener-type Attack Against a Family RSA-like Cryptosystem
Authors: George Teseleanu
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 scheme, 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 = 2^i, where i > 2 is an integer. This represents a natural continuation of previous research, which successfully applied similar techniques for n = 1, 2, 4.
ePrint: https://eprint.iacr.org/2025/1396
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .