Factorization of the numbers of the form m ³ + c ₂ m ² + c ₁ m + c ₀

Abstract

We give an algorithm which can factor integers of the form m ³ + c ₂ m ² + c ₁ m + c ₀, where the c _i are small integers. It is expected that the time required is L ^δ and the space required is L ^λ where $L = \exp (\sqrt {\log {\text{ }}n{\text{ log log }}n} ){\text{ and }}\delta {\text{ = }}r/\sqrt {6(r - 1)} {\text{, }}\lambda = 2/\sqrt {6(r - 1)} ,$, where r is the elimination exponent.