Article
Licensed
Unlicensed
Requires Authentication
On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
-
I. S. Sergeev
Published/Copyright:
December 4, 2007
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
You are currently not able to access this content.
You are currently not able to access this content.
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
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
