A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access

Abstract

A new approach for the computation of long integer cube (third power) based on a splitting-in-two divide et impera approach and on a modified Toom-Cook-3 unbalanced method is presented, showing that the “classical” square-and-multiply algorithm is not (always) optimal. The new algorithm is used as a new basic tool to improve long integer exponentiation: different techniques combining binary and ternary exponent expansion are shown. Effective implementations by using the GMP library are tested, and performance comparisons are presented.