Factoring Polynomials for Constructing Pairing-friendly Elliptic Curves

In this paper we present a new method to construct a polynomial u(x) ∈ Z[x] which will make Φk(u(x)) reducible. We construct a finite separable extension of Q(ζk), denoted as E. By primitive element theorem, there exists a primitive element θ ∈ E such that E = Q(θ). We represent the primitive k-th root of unity ζk by θ and get a polynomial u(x) ∈ Q[x] from the representation. The resulting u(x) will make Φk(u(x)) factorable.