We describe an algorithm for computing the Galois automorphisms of a nilpotent Galois extension of the rationals which run in polynomial time under the GRH.  This is much faster in practice than algorithms based on lattice reduction.