Sharedwww / wiki / 09(2f)583e(2f)projects.htmlOpen in CoCalc
Author: William A. Stein
09/583e/projects
 [top] [TitleIndex] [WordIndex]

09/583e/projects

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

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

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

Projects 2: Abelian Varieties

http://wstein.org/edu/2009/583/project2/


2013-05-11 18:32