FACTORIZATION PROBLEM IN ASYMMETRIC ENCRYPTION

Аннотация

In the era of rapidly expanding digital networks and cloud computing, securing sensitive information has become a cornerstone of modern computing. Cryptography plays a pivotal role in safeguarding data against unauthorized access, interference, and cyber threats. Among the cryptographic mechanisms, asymmetric encryption algorithms, particularly RSA, rely heavily on the computational difficulty of prime factorization to ensure security. However, traditional factorization methods are often inefficient for large-scale applications, posing potential vulnerabilities. This study explores advanced techniques to enhance data protection by integrating Fermat’s factorization theorem into modern encryption analysis.

Темы

Идентификаторы

DOI

10.5281/zenodo.17773320

Цитирования и источники