Barry Van Leeuwen

From form to factor

The factorization problem has always been recognized as a great problem. Many of us are familiar with at least one factorization method: trial division, Pollard's rho method, quadratic sieve, or even the (general/special/random) number field sieve. However there are interesting methods that see no practical use, but are of theoretically of great interest. In this talk we will explore how we can use Binary Quadratic Forms to factorize a (not necessarily) semi-prime integer n=pq.