Hanoymak, T.Kayak, C.2025-07-302025-07-3020252148-183010.47000/tjmcs.15691632-s2.0-105010245283https://doi.org/10.47000/tjmcs.1569163https://hdl.handle.net/20.500.14720/28138The problem of prime factorization is particularly important in fields such as cryptography, where it plays a crucial role, especially in the security of public key cryptosystems like RSA Algorithm. There are numerous factorization algorithms that have been developed over time, each with varying levels of complexity. These algorithms have played a crucial role in fields like mathematics and cryptography, where prime factorization remains a key challenge. In this study, the continued fraction method, one of the factorization methods, is examined. To highlight the importance of the continued fraction factorization method, a brief mention is made of the vulnerability of RSA Algorithm to attacks, such as Weiner’s attack, which exploits small private keys. Our approach aims to enhance the efficiency of factorization by integrating this method with relevant theorems by giving concrete examples with detailed tables. © MatDer.eninfo:eu-repo/semantics/closedAccessContinued FractionsCryptographyFactorization AlgorithmsRsa AlgorithmArticle171N/AN/A3346