Abstract / résuméCUMC / CCEM 2005



Name / nom: Anne-Sophie Charest

School / école: McGill University

Length / durée: 25 min

Title / titre: Lenstra's Algorithm for Factoring with Elliptic Curves

Abstract / résumé: This talk is an introduction to Lenstra's algorithm for factoring integers using elliptic curves intended for students with little previous knowledge in group theory. I will first present briefly the Pollard's p-1 algorithm for factoring integers. Then, I will introduce elliptic curves and explain how Lenstra used them to create a much more powerful algorithm using a similar idea than Pollard's. Finally, I will discuss the implementation of this algorithm.

Prerequisites / choses nécessaires: None.



PDF format / format PDF: charest.pdf