
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D. Zuras, "More on Squaring and Multiplying Large Integers," IEEE Transactions on Computers, vol. 43, no. 8, pp. 899908, August, 1994.  
BibTex  x  
@article{ 10.1109/12.295852, author = {D. Zuras}, title = {More on Squaring and Multiplying Large Integers}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {8}, issn = {00189340}, year = {1994}, pages = {899908}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.295852}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  More on Squaring and Multiplying Large Integers IS  8 SN  00189340 SP899 EP908 EPD  899908 A1  D. Zuras, PY  1994 KW  digital arithmetic; multiplying circuits; data handling; squaring; multiplying; large integers; FFT multipliers. VL  43 JA  IEEE Transactions on Computers ER   
Methods of squaring and multiplying large integers are discussed. The obvious O(n/sup 2/) methods turn out to be best for small numbers. Existing O(n/sup log/ /sup 3/log/ /sup 2/)/spl ap/O(n/sup 1.585/) methods become better as the numbers get bigger. New methods that are O(/sup log5/log/ /sup 3/)/spl ap/0(n/sup 1.465/), O(n/sup log/ /sup 7/log/ /sup 4/)/spl ap/O(n/sup 1.404/), and O(n/sup log/ /sup 9/log/ /sup 5/)/spl ap/O(n/sup 1.365/) presented. In actual experiments, all of these methods turn out to be faster than FFT multipliers for numbers that can be quite large (<37,000,000 bits). Squaring seems to be fundamentally faster than multiplying but it is shown that T/sub multiplyspl les/2T/sub square/+O(n).
[1] A. V. Aho, J. E. Hopcroft, J. D. Ullman,The Design and Analysis of Computer Algorithms. Reading, MA: AddisonWesley, 1974, ch. 7.
[2] S. A. Cook, "On the minimum computation time of functions," thesis, Harvard Univ., May 1966, pp. 5177.
[3] A. Karatsuba and Yn Ofman, "Multiplication of multidigit numbers on automata,"Soviet Phys. Doklody, vol. 7, no. 7, pp. 595596, Jan. 1963.
[4] D. E. Knuth,The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. Reading, MA: AddisonWesley, 1981.
[5] A. Schönhage and V. Strassen,Computing, vol. 7, pp. 281292, 1971 (in German).
[6] M. Shand, Digital Equipment Corp., Paris Res. Lab., personal communication, July 1993.
[7] A. L. Toom, "The complexity of a scheme of functional elements realizing tbe multiplication of integers,"Soviet Math., vol. 3, pp. 714716, 1963.
[8] D. Zuras, "On squaring and multiplying large integers," in11th IEEE Symp. Comput. Arithmetic, pp. 260271.