438 and references
Summary: “We describe a simple procedure to find Aurifeuillian factors of values of cyclotomic polynomials Φd(a) for integers a and d> 0. Assuming a suitable Riemann Hypothesis, the algorithm runs in deterministic time Õ(d2 L), using O(dL) space, where L: = log(|a | + 1).
5. A. Granville & P. Pleasants, Aurifeuillian factorization, Math. Comp. 75 (2006, no
Sorry, we are unable to provide the full text but you may find it at the following location(s):
http://citeseerx.ist.psu.edu/v... (external link)