Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter December 4, 2007

On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other

  • I. S. Sergeev
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.2007.031

Abstract

It is shown that the transformations of normal and polynomial bases of the field GF(pn) from one to the other can be performed by a circuit over GF(p) with complexity O(n1.806) and depth O(log n).

Published Online: 2007-12-04
Published in Print: 2007-10-19

© de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 17 Issue 4

Journal and Issue

Articles in the same Issue

Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
On homomorphisms of many-sorted algebraic systems in connection with cryptographic applications
A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
An upper bound for the number of maximal independent sets in a graph
On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
One automaton model in biology
On an automaton model of pursuit
Downloaded on 27.4.2024 from https://www.degruyter.com/document/doi/10.1515/dma.2007.031/html
Scroll to top button