|
This article is cited in 3 scientific papers (total in 3 papers)
On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
I. S. Sergeev
Abstract:
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)$.
Received: 05.06.2006
Citation:
I. S. Sergeev, “On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other”, Diskr. Mat., 19:3 (2007), 89–101; Discrete Math. Appl., 17:4 (2007), 361–373
Linking options:
https://www.mathnet.ru/eng/dm968https://doi.org/10.4213/dm968 https://www.mathnet.ru/eng/dm/v19/i3/p89
|
Statistics & downloads: |
Abstract page: | 594 | Full-text PDF : | 331 | References: | 68 | First page: | 16 |
|