DescriptionThe Security of the RSA cryptosystem depends on the difficulty of finding the prime factors of large integers. Here we explore some of the factorization techniques currently available in cryptography. After giving an overview of cryptography we discuss some of the factorization techniques like Fermat’s factoring, Pollards p-1 method and continued fraction method. We then explore the theory of binary quadratic forms and its applications to factorization.