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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Rigorous Analysis of a Randomised Number Field Sieve

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

MR9 Centre for Mathematical Sciences LR3A, Engineering, Department of Average on weekdays: 8887.24770642 kWh

Other talks

Sera Markoff Inaugural Lecture for the Plumian Professorship in Astronomy and Experimental Philosophy - 'Staring into the heart of darkness: from theory to the direct imaging of black holes' A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ A Novel Diffusion Model based Approach for Sleep Music Generation RNA-Mediated Regulation of Germinal Centre B-Cell Fitness: a tale of two DEAD-box RNA helicases Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning Talk TBC
 

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