The Computational Complexity of Division in Quadratic Extension Fields

DOI10.1137/0216023MaRDI QIDQ4205081zbMATH OpenOpenAlexFDO

Authors Thomas Lickteig

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0216023

zbMATH Keywords

algebraic computingcomputational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
• On the multiplicative complexity of the inversion and division of Hamiltonian quaternions
• A note on complex division
• Evaluation of rational functions
• Computational complexity of computing polynomials over the fields of real and complex numbers

Cited in

(7)

• On the multiplicative complexity of the inversion and division of Hamiltonian quaternions
• How can a complex square root be computed in an optimal way?
• On the number of multiplications needed to invert a monic power series over fields of characteristic two
• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
• A note on complex division
• A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
• On the field-based division property: applications to MiMC, Feistel MiMC and GMiMC

This page was built for publication: The Computational Complexity of Division in Quadratic Extension Fields

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