An application of the method of additive chains to inversion in finite fields
From MaRDI portal
Recommendations
- A Generalization of Addition Chains and Fast Inversions in Binary Fields
- Lagrange inversion over finite fields
- Inversion in finite fields using logarithmic depth
- Inversion and subspaces of a finite field
- Sums of inverses in thin sets of finite fields
- A new construction for involutions over finite fields
- On the additive bases problem in finite fields
- Additive maps on generalized inverses of matrices over fields
- Additive combinatorics over finite fields: new results and applications
- Constructions of Involutions Over Finite Fields
Cites work
Cited in
(15)- Fast algorithm of square rooting in some finite fields of odd characteristic
- On inversion in \(\mathbb Z_{{2^n}-1}\)
- 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
- Fast algorithms for solving equations of degree \(\le 4\) in some finite fields
- On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
- On design of circuits of logarithmic depth for inversion in finite fields
- Complexity of Boolean schemes for arithmetic in some towers of finite fields
- On inversion in finite fields of characteristic 2 with logarithmic depth
- Complexity of computation in finite fields
- scientific article; zbMATH DE number 4064464 (Why is no real title available?)
- Rectifier circuits of bounded depth
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
- Efficient inversion of rational maps over finite fields
- On the depth of logic circuits for operations in the fields \(\text{GF}(2^n)\)
This page was built for publication: An application of the method of additive chains to inversion in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5424089)
