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

  • Marco Bodrato
  • Alberto Zanoni
Conference paper

DOI: 10.1007/978-3-642-32973-9_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7442)
Cite this paper as:
Bodrato M., Zanoni A. (2012) A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers. In: Gerdt V.P., Koepf W., Mayr E.W., Vorozhtsov E.V. (eds) Computer Algebra in Scientific Computing. CASC 2012. Lecture Notes in Computer Science, vol 7442. Springer, Berlin, Heidelberg

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.

AMS Subject Classification

11N64 11A25 13B25 

Keywords and phrases

Toom-Cook cube third power long integers 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Marco Bodrato
    • 1
  • Alberto Zanoni
    • 2
  1. 1.mambaSoftTorinoItaly
  2. 2.Dipartimento di Scienze StatisticheUniversità “Sapienza”RomaItaly

Personalised recommendations