Level: MSci
Title: Lenstra's elliptic curve factorization
Supervisor:

Dr Ivan Tomasic
Research Area: Geometry and Analysis
Description:

This is the third-fastest known algorithm for integer factorisation that uses elliptic curves. The project would involve covering the necessary background in algebraic geometry and elliptic curves, and understanding how the algorithm works. For a further credit, there is a possibility of experimentation with examples, and a possibility of implementing the algorithm in a programming language.
Further Reading:

Literature suggestions will be supplied.
Key Modules:

To be confirmed with supervisor.
Other Information:
Current Availability: Yes