On the depth of logic circuits for operations in the fields GF(2ⁿ)
From MaRDI portal
Publication:5472004
Recommendations
- On design of circuits of logarithmic depth for inversion 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
- Inversion in finite fields using logarithmic depth
- An application of the method of additive chains to inversion in finite fields
Cited in
(7)- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
- 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})\)
- Inversion in finite fields using logarithmic depth
- On design of circuits of logarithmic depth for inversion in finite fields
- On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits"
- Complexity of computation in finite fields
This page was built for publication: On the depth of logic circuits for operations in the fields \(\text{GF}(2^n)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472004)
