Integer factorisation is one of the most important problems in number theory and computer science. In 1985, Lenstra proposed a factorisation algorithm using elliptic curves, which is currently the fastest known algorithm for finding 'small' prime factors. In this talk we will give an introduction to the factorisation problem and the theory of elliptic curves, as well as an overview of Lenstra's algorithm including an analysis of its complexity.
Fri, 12/10/2012 - 2:00pm to 3:00pm
RC-4082, Red Centre Building, UNSW