Low Complexity Cubing and Cube Root Computation over \F_{3ᵐ} in Polynomial Basis

DOI10.1109/TC.2009.183zbMATH Open1367.65201OpenAlexW2132269377MaRDI QIDQ5280683FDOQ5280683

Authors: Omran Ahmadi, Francisco Rodríguez-Henríquez 

Publication date: 27 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2009.183

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited In (3)

• New cube root algorithm based on the third order linear recurrence relations in finite fields
• On the arithmetic operations over finite fields of characteristic three with low complexity
• Formulas for cube roots in \(\mathbb F_{3^m}\)

This page was built for publication: Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis

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