Polynomial selection for the general number field sieve

Shi Bai (SoCS CECS)

CS HDR MONITORING Algorithms & Data Research Group

DATE: 2010-04-13
TIME: 13:00:00 - 13:30:00
LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
The general number field sieve is asymptotically the fastest algorithm for factoring large integers. Its running time depends on a good choice of a polynomial pair. Hence the polynomial selection is an important part of the number field sieve algorithm.

I will describe the Kleinjung's algorithm for polynomial selection and some attempts to improve the algorithm. The general number field sieve can be also applied to solve the discrete logarithm problem. I will also describe some alternatives to the above algorithm for the polynomial selection for the discrete logarithm problem.

BIO:
PhD student in Computer Science.