We describe an experimental factoring method for numbers of form x3+k; at present we have used only k=2. The method is the cubic version of the idea given by Coppersmith, Odlyzko and Schroeppel (Algorithmica 1 (1986), 1–15), in their section ‘Gaussian integers’. We look for pairs of small coprime integers a and b such that: i. the integer a+bx is smooth, ii. the algebraic integer a+bz is smooth, where z3=−k. This is the same as asking that its norm, the integer a3 - kb3 shall be smooth (at least, it is when k=2).