Integer Overflow

Not quite insightful

Archive for January 21st, 2009

High speed methods in number factorization

with 2 comments

On 24 February 2009 I’ll be giving a talk for the University of Utah GSAC Colloquium on sub-exponential algorithms for number factorization. The talk will cover Pomerance’s Quadratic Sieve, as well as other current methods. The plan is to focus on the connections between number factorization and other problems in mathematics whose connections to number theory are both non-obvious and highly useful.

This will be a survey of known methods, rather than a presentation of original work.

Written by intoverflow

21 January, 2009 at 2:36 pm

Posted in Cryptography