Cryptology ePrint Archive: Report 2009/070
Available versions in chronological order
20090216:075233 (posted 16-Feb-2009 07:52:33 UTC)
Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Standard Basis
Omran Ahmadi and Francisco Rodr\'iguez-Henr\'iquez
20090731:184911 (posted 31-Jul-2009 18:49:11 UTC)
Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis
Omran Ahmadi and Francisco Rodr\'iguez-Henr\'iquez
20091113:000630 (posted 13-Nov-2009 00:06:30 UTC)
Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis
Omran Ahmadi and Francisco Rodr\iguez-Henriquez
[
Cryptology ePrint archive
]