RSA Cryptanalysis: A Novel Acceleration for Euler-Based Fermat Factorization Algorithm
Contemporary Mathematics · 04.03.2026 · 1748-1759
DOI: 10.37256/cm.7220269032 ↗Kurz gefasst
Fachartikel in der Zeitschrift Contemporary Mathematics, online erschienen am 04.03.2026. Verfasst von Ibrahim M. Alseadoon und 4 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The Rivest-Shamir-Adleman (RSA) cryptosystem is an efficient and secure method for transmitting data over the Internet. Breaking this system primarily relies on the integer factorization problem, which involves factoring a composite odd number, n, into two prime factors, p and q. Euler-based Fermat Factorization (EFF) is one of the factoring methods based on the modular multiplication operation and is efficient when δ = p − q ≤ n0.25. However, the execution times of the EFF algorithm increase significantly with large values of n and δ > n0.25. In this paper, we propose a novel technique for optimizing the number of modular multiplication operations required to find the two factors. The method can factor a large odd number in a fast time, even when δ > n0.25. For different values of the length of the primes and δ, the experimental results indicate that the proposed algorithm is, on average, 85.5% faster than the previous improvements on the Fermat factorization method.
Zitieren
APA
Alseadoon, I. M., Fathy, K. A., Hazber, M. A., Kotb, Y., & Bahig, H. M. (2026). RSA Cryptanalysis: A Novel Acceleration for Euler-Based Fermat Factorization Algorithm. Contemporary Mathematics, 1748-1759. https://doi.org/10.37256/cm.7220269032
Vancouver
Alseadoon IM, Fathy KA, Hazber MA, Kotb Y, Bahig HM. RSA Cryptanalysis: A Novel Acceleration for Euler-Based Fermat Factorization Algorithm. Contemporary Mathematics. 2026:1748-1759. doi:10.37256/cm.7220269032
BibTeX
@article{Alseadoon2026,
author = {Alseadoon, Ibrahim M. and Fathy, Khaled A. and Hazber, Mohamed A.G. and Kotb, Yasser and Bahig, Hazem M.},
title = {RSA Cryptanalysis: A Novel Acceleration for Euler-Based Fermat Factorization Algorithm},
journal = {Contemporary Mathematics},
year = {2026},
pages = {1748--1759},
doi = {10.37256/cm.7220269032}
}
EUVIMED