Projects
First Projects (on factoring)
Tom Boothby
Make FLINT faster than PARI at factoring numbers with <= 53 bit. See http://trac.sagemath.org/sage_trac/ticket/5945
Aly Deines
Do a toy dlog index calculus implementation: Index_Calculus_Aly_s_Midterm_Project.sws
Dan Shumow
Lattice sieve (part of General number field sieve) for finding smooth numbers. GNFS.sage
Sourav San Gupta
- SPD's: twinkle, twirl, Bernstein, Bicycles, fast elliptic curve arithmetic
See http://students.washington.edu/souravsg/spd_583e/contents.htm or equivalently http://wstein.org/edu/2009/spd_583e.zip
Robert Bradshaw
Investigate cutoffs between (implementations of) various factoring algorithms. Fix sage's generic factor command in various ways. bradshaw.zip
Dustin Moody
Describe and implement the continued fraction algorithm for factoring integers. dustin_moody.zip
Paul Carr
Describe Vallee's Two-Thirds Algorithm. project1_vallee.pdf
Wenhan Wang
The hyperelliptic curve method for factoring integers. Like ECM, but instead of using an elliptic curve, use a hyperelliptic curve. project_hecm.pdf