Publication:4205081

DOI10.1137/0216023zbMATH Open0686.68040OpenAlexW1967306952MaRDI QIDQ4205081FDOQ4205081

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

computational complexityalgebraic computing

Mathematics Subject Classification ID

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

Cited In (5)

• A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
• 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
• 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)