[Cryptography] factoring small(ish) numbers
jkatz at cs.umd.edu
Mon Oct 13 19:23:24 EDT 2014
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."
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.
I am aware of the RSA factoring challenges, but those are solved by large,
distributed efforts run by academics using special-purpose setups and
taking much more than 1 month.
Thanks in advance for any pointers.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the cryptography