Square Form Factoring is an <i>O</i>(<i>N</i><sup>1/4</sup>) factoring algorithm developed by D. Shanks using certain properties of quadratic forms. Central to the original algorithm is an iterative search for a square form. We propose a new subexponential-time algorithm called SQUFOF2, based on ideas of D. Shanks and R. de Vogelaire, which replaces the iterative search with a sieve, similar to the Quadratic Sieve.
| Identifer | oai:union.ndltd.org:purdue.edu/oai:figshare.com:article/14524329 |
| Date | 05 May 2021 |
| Creators | Clinton W Bradford (10732485) |
| Source Sets | Purdue University |
| Detected Language | English |
| Type | Text, Thesis |
| Rights | CC BY 4.0 |
| Relation | https://figshare.com/articles/thesis/Square_Forms_Factoring_with_Sieves/14524329 |
Page generated in 0.0021 seconds