Journal ArticleOPEN ACCESS

Square form factorization

  • Gower J
  • Wagstaff S
Mathematics of Computation (2007) 77(261) 551-588
DOI: 10.1090/s0025-5718-07-02010-8
7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Gower, J., & Wagstaff, S. (2007). Square form factorization. Mathematics of Computation, 77(261), 551–588. https://doi.org/10.1090/s0025-5718-07-02010-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free