Article collection "Mathematical Problems of Cybernetics" №15, Moscow, 2006
Authors:Sergeev I.S.
On the logarithmic depth circuits for inversion in finite fields of characteristic 2
Abstract:
It is shown that the inversion in a standard basis of finite field GF(2n) can be implemented by a circuit of complexity O(n4) and depth 6,44 log2 n + o(log n) or, alternatively, by a circuit of complexity (n1.667) and depth O(log n).
Keywords:
finite fields, inversion, Boolean circuits, depth
Publication language:russian, pages:30 (p. 35-64)
Research direction:
Mathematical problems and theory of numerical methods
