University of Cambridge > > Combinatorics Seminar > Rigorous Analysis of a Randomised Number Field Sieve

Rigorous Analysis of a Randomised Number Field Sieve

Add to your list(s) Download to your calendar using vCal

  • UserJonathan Lee (University of Cambridge)
  • ClockThursday 26 February 2015, 16:00-17:00
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

The Number Field Sieve is the current practical and theoretical state of the art algorithm for factoring. Unfortunately, there has been no rigorous analysis of this type of algorithm.

By suitably randomising key aspects of the number theory, we prove that an NFS -type algorithm produces congruences of squares in expected time L(1/3, 2.88). These results are tightly coupled to recent progress on the distribution of smooth numbers, and we provide additional tools to turn progress on these problems into improved bounds.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity