Square form factorization

@article{Gower2008SquareFF,
  title={Square form factorization},
  author={Jason E. Gower and Samuel S. Wagstaff},
  journal={Math. Comput.},
  year={2008},
  volume={77},
  pages={551-588}
}
We present a detailed analysis of SQUFOF, Daniel Shanks’ Square Form Factorization algorithm. We give the average time and space requirements for SQUFOF. We analyze the effect of multipliers, either used for a single factorization or when racing the algorithm in parallel. 
8 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Class Number, a Theory of Factorization, and Genera

  • Daniel Shanks
  • In Proceedings of Symposia in Pure Mathematics,
  • 1971
Highly Influential
13 Excerpts

Khinchin. Continued Fractions

  • A Y.
  • The University of Chicago Press, third edition,
  • 1964
Highly Influential
2 Excerpts

Square form factorization

  • Jason E. Gower
  • PhD thesis,
  • 2004
2 Excerpts

Cryptanalysis of Number Theoretic Ciphers

  • Samuel S. Wagstaff, Jr.
  • ssw@cerias.purdue.edu
  • 2003
1 Excerpt

Number VII in Congressus Numerantium

  • Samuel S. Wagstaff
  • Cryptanalysis of Number Theoretic Ciphers
  • 2003

Algebraic Number Theory, 1998. available at http://www.math.lsa.umich.edu /~jmilne

  • J. S. Milne
  • 1998
1 Excerpt

Prime Numbers and Computer Methods for Factorization

  • Hans Riesel
  • Birkhaüser, second edition,
  • 1994
1 Excerpt

An Introduction to the Theory of Numbers

  • Ivan Niven, Herbert S. Zuckerman, Hugh L. Montgomery
  • 1991

Binary Quadratic Forms

  • Duncan A. Buell
  • Classical Theory and Modern Computations…
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…