Complexity of Boolean schemes for arithmetic in some towers of finite fields

MaRDI QIDQ3499664zbMATH OpenFDO

Authors A. A. Burtsev, I. B. Gashkov, S. B. Gashkov

Publication date 2 June 2008

zbMATH Keywords

complexity inversionmultiplicationscheme complexity

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
• The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
• Complexity of computation in finite fields
• On the complexity of multiplication in finite fields
• An application of the method of additive chains to inversion in finite fields

Cited in

(5)

• Finite field towers: Iterated presentation and complexity of arithmetic.
• Laced Boolean functions and subset sum problems in finite fields
• The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
• On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
• Complexity of computation in finite fields

This page was built for publication: Complexity of Boolean schemes for arithmetic in some towers of finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499664)