[Cryptography] factoring small(ish) numbers

David Leon Gil coruus at gmail.com
Tue Oct 14 00:01:49 EDT 2014

On Monday, October 13, 2014, Jonathan Katz <jkatz at cs.umd.edu> wrote:

> I'm curious if anyone can point me to references that would indicate
> values of n for which n-bit numbers can be factored "easily."

cado-nfs + undergraduate + 1 month == answer

Or take a look at: www.wired.com/2012/10/dkim-vulnerability-widespread/all/

It has the numbers you're after, as of two years ago. See also

One can debate what "easily" means, but for my purposes I am thinking of
> something where (1) the factoring is done on a single, standard PC, (2) in
> less than a month, using (3) code that is either readily available or could
> be written by a talented undergraduate CS student.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20141014/5ae8ce47/attachment.html>

More information about the cryptography mailing list