On design of circuits of logarithmic depth for inversion in finite fields

DOI10.1515/DMA.2008.035zbMath1210.94120OpenAlexW2006519283MaRDI QIDQ3184560

Sergey B. Gashkov, Igor S. Sergeev

Publication date: 21 October 2009

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2008.035

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Finite fields (field-theoretic aspects) (12E20)

Related Items (1)

Complexity of computation in finite fields

Cites Work

• Fast arithmetic with general Gauß periods
• On arithmetical algorithms over finite fields
• Low complexity normal bases
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• On fast multiplication of polynomials over arbitrary algebras
• Fast rectangular matrix multiplication and applications
• Inversion in finite fields using logarithmic depth
• Very Fast Parallel Polynomial Arithmetic
• Log Depth Circuits for Division and Related Problems
• Normal bases via general Gauss periods
• Subquadratic-time factoring of polynomials over finite fields
• On a quick multiplication in normal bases of finite fields
• An application of the method of additive chains to inversion in finite fields
• On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other

This page was built for publication: On design of circuits of logarithmic depth for inversion in finite fields