On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
Diskretnaya Matematika, Tome 19 (2007) no. 3, pp. 89-101

Voir la notice de l'article provenant de la source Math-Net.Ru

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)$.
@article{DM_2007_19_3_a7,
     author = {I. S. Sergeev},
     title = {On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other},
     journal = {Diskretnaya Matematika},
     pages = {89--101},
     publisher = {mathdoc},
     volume = {19},
     number = {3},
     year = {2007},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2007_19_3_a7/}
}
TY  - JOUR
AU  - I. S. Sergeev
TI  - On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
JO  - Diskretnaya Matematika
PY  - 2007
SP  - 89
EP  - 101
VL  - 19
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2007_19_3_a7/
LA  - ru
ID  - DM_2007_19_3_a7
ER  - 
%0 Journal Article
%A I. S. Sergeev
%T On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
%J Diskretnaya Matematika
%D 2007
%P 89-101
%V 19
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2007_19_3_a7/
%G ru
%F DM_2007_19_3_a7
I. S. Sergeev. On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other. Diskretnaya Matematika, Tome 19 (2007) no. 3, pp. 89-101. http://geodesic.mathdoc.fr/item/DM_2007_19_3_a7/