Hints and tips:
  • You may need to look up some unfamiliar terms in the title or description to get more of a sense of what is involved.
  • If the project has "No" in the "Current Availability:" field, it is already taken or not being offered this academic year but may be available again in future years.
  • The supervisor name links to a contact details webpage so, if you are interested, you can arrange to discuss this project or even propose a related topic of your own.
Level: MSci
Title: Lenstra's elliptic curve factorization
Supervisor:

Dr Ivan Tomasic
Research Area: Algebra
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 the supervisor.
Other Information:
Current Availability: Yes