On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
Igor' Sergeevich Sergeev · Discrete Mathematics and Applications · 2007
It is shown that the transformations of normal and polynomial bases of the field GF ( p n ) from one to the other can be performed by a circuit over GF ( p ) with complexity O ( n 1.806 ) and depth O (log n ).