Rotation symmetry in algebraically generated cryptographic substitution tables

Using some elementary properties of normal bases, we are able to show that bijective substitution tables generated from power maps or exponentiations over finite fields are linear equivalent to rotation-symmetric S-boxes. In the other direction, we show that rotation-symmetric S-boxes can always be described as a sum of power maps over finite fields.