FACTORIZATION PROBLEM IN ASYMMETRIC ENCRYPTION
Keywords:
Asymmetric encryption, Symmetric encryption, Cloud computing, Data security, Factorization algorithms, CryptographyAbstract
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.References
1. Stallings, W. (2017). Cryptography and Network Security: Principles and Practice (7th ed.). Pearson.
2. Paar, C., & Pelzl, J. (2010). Understanding Cryptography: A Textbook for Students and Practitioners. Springer.
3. Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (1996). Handbook of Applied Cryptography. CRC Press.
4. Katz, J., & Lindell, Y. (2014). Introduction to Modern Cryptography (2nd ed.). CRC Press.
5. Kurose, J. F., & Ross, K. W. (2017). Computer Networking: A Top-Down Approach (7th ed.). Pearson.
6. Liu, J., & Ning, P. (2012). Security and Privacy in Cloud Computing. Springer.
7. Dworkin, M. (2001). Recommendation for Block Cipher Modes of Operation: Methods and Techniques. NIST Special Publication 800-38A.
8. Diffie, W., & Hellman, M. (1976). New Directions in Cryptography. IEEE Transactions on Information Theory, 22(6), 644-654.



