Square form factorization
Abstract
We present a detailed analysis of SQUFOF, Daniel Shanks' Square Form Factorization algorithm. We give the expected running time and space requirement for SQUFOF. We analyze the effect of multipliers, either used for a single factorization or when racing the algorithm in parallel.
Degree
Ph.D.
Advisors
Wagstaff, Purdue University.
Subject Area
Mathematics
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.