The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
From MaRDI portal
Publication:2513076
DOI10.3103/S0027132209040019zbMath1304.94131OpenAlexW2024684344MaRDI QIDQ2513076
Sergey B. Gashkov, Igor S. Sergeev
Publication date: 2 February 2015
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s0027132209040019
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Complexity of computation in finite fields ⋮ Fast algorithms for solving equations of degree \(\le 4\) in some finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Fast multiplication of polynomials over fields of characteristic 2
- Finite field towers: Iterated presentation and complexity of arithmetic.
- Fast computation of continued fraction expansions.
- The Computational Complexity of Continued Fractions
- Optimal tower fields
- An application of the method of additive chains to inversion in finite fields
This page was built for publication: The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
