On short representations of orders and number fields

We discuss the problem of transforming representations of number elds by generating polynomials and by Q-basis into each other. We prove that for a number eld or an order of discriminant one can determine in polynomial time a representation whose size is polynomially bounded in log jj.