New Cryptanalysis of Two Families of RSA-like Schemes
Axioms · 19.07.2026 · 15 (7) · 543
DOI: 10.3390/axioms15070543 ↗Kurz gefasst
Fachartikel in der Zeitschrift Axioms, online erschienen am 19.07.2026. Verfasst von Brahim Chnioune und 3 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In certain variants of the RSA cryptosystem with a modulus N=pq, the public exponent e and the private exponent d are related by the equation ed≡1(modφn(N)) or ed≡1(modψn(N)), where φn(N)=(pn−1)(qn−1) and ψn(N)=(pn−1)(qn−1)(p−1)(q−1) are defined for a positive integer n≥1. In this paper, we introduce a new attack against the RSA variants when two public exponents e1 and e2 are given, satisfying eidi≡1(modφn(N)) or eidi≡1(modψn(N)) for i=1,2. Specifically, we show that when the prime factors of N share an amount of their least significant bits, and d1 and d2 share an amount of their most significant bits, the factorization of N can be computed in polynomial time. Our method is based on an extension of Coppersmith’s technique and lattice basis reduction and achieves improved bounds as the number of shared bits increases. The proposed attacks are heuristic in nature, relying on the standard assumption that the polynomials obtained after lattice reduction are algebraically independent.
Zitieren
APA
Chnioune, B., Rahmani, M., Nitaj, A., & Ziane, M. (2026). New Cryptanalysis of Two Families of RSA-like Schemes. Axioms, 15(7), 543. https://doi.org/10.3390/axioms15070543
Vancouver
Chnioune B, Rahmani M, Nitaj A, Ziane M. New Cryptanalysis of Two Families of RSA-like Schemes. Axioms. 2026;15(7):543. doi:10.3390/axioms15070543
BibTeX
@article{Chnioune2026,
author = {Chnioune, Brahim and Rahmani, Mohammed and Nitaj, Abderrahmane and Ziane, Mhammed},
title = {New Cryptanalysis of Two Families of RSA-like Schemes},
journal = {Axioms},
year = {2026},
volume = {15},
number = {7},
pages = {543},
doi = {10.3390/axioms15070543}
}
EUVIMED