Crypto Seminar Talk - Polynomial Selection for the General Number Field Sieve
1 view
Skip to first unread message
Dan Shumow
May 27, 2008, 7:58:59 PM5/27/08
to uw-crypto, nt...@googlegroups.com, peter.mo...@microsoft.com
TIME: 1:30-2:30 pm, Thursday May 29, 2008
PLACE: 415L Guggenheim (the Applied Math Building)
SPEAKER: Peter Montgomery, Microsoft Research
TITLE: Polynomial Selection for the General Number Field Sieve
ABSTRACT:
The Number Field Sieve is asymptotically the fastest algorithm for
factoring a large integer N with no small prime factors, such as an
RSA modulus. An early step in the algorithm selects two polynomials
with a common root modulo N. This talk will present some techniques
for choosing the polynomials when N has no nice algebraic form.
PLACE: 415L Guggenheim (the Applied Math Building)
SPEAKER: Peter Montgomery, Microsoft Research
TITLE: Polynomial Selection for the General Number Field Sieve
ABSTRACT:
The Number Field Sieve is asymptotically the fastest algorithm for
factoring a large integer N with no small prime factors, such as an
RSA modulus. An early step in the algorithm selects two polynomials
with a common root modulo N. This talk will present some techniques
for choosing the polynomials when N has no nice algebraic form.
Reply all
Reply to author
Forward
0 new messages