Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis
From MaRDI portal
Publication:5280683
DOI10.1109/TC.2009.183zbMath1367.65201MaRDI QIDQ5280683
Francisco Rodríguez-Henríquez, Omran Ahmadi
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
65Y04: Numerical algorithms for computer arithmetic, etc.
Related Items
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