Article
Licensed
Unlicensed
Requires Authentication
On design of circuits of logarithmic depth for inversion in finite fields
-
S. B. Gashkov
Published/Copyright:
December 15, 2008
Abstract
We suggest a method of realisation of inversion over the standard bases of finite fields GF(pn) by means of circuits over GF(p) of complexity 
and depth 
, where ɛ > 0, and w < 1.667 is the exponent of multiplication of 
× and × n matrices. Inversion over Gaussian normal bases is realised by a circuit of complexity 
and depth , where b, c are constants.
Received: 2007-01-29
Published Online: 2008-12-15
Published in Print: 2008-December
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
Articles in the same Issue
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
