Research Article

Article:Ultra Long Integer Multiplication on GDPS

by  Y K Viswanadham, Dr Ch D V Subba Rao, T V Subrahmanyam
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Issue 8
Published: October 2010
Authors: Y K Viswanadham, Dr Ch D V Subba Rao, T V Subrahmanyam
10.5120/1271-1751
PDF

Y K Viswanadham, Dr Ch D V Subba Rao, T V Subrahmanyam . Article:Ultra Long Integer Multiplication on GDPS. International Journal of Computer Applications. 7, 8 (October 2010), 22-25. DOI=10.5120/1271-1751

                        @article{ 10.5120/1271-1751,
                        author  = { Y K Viswanadham,Dr Ch D V Subba Rao,T V Subrahmanyam },
                        title   = { Article:Ultra Long Integer Multiplication on GDPS },
                        journal = { International Journal of Computer Applications },
                        year    = { 2010 },
                        volume  = { 7 },
                        number  = { 8 },
                        pages   = { 22-25 },
                        doi     = { 10.5120/1271-1751 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2010
                        %A Y K Viswanadham
                        %A Dr Ch D V Subba Rao
                        %A T V Subrahmanyam
                        %T Article:Ultra Long Integer Multiplication on GDPS%T 
                        %J International Journal of Computer Applications
                        %V 7
                        %N 8
                        %P 22-25
                        %R 10.5120/1271-1751
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

Many Internet applications require intensive cryptographic calculation such as public-key encryptions and digital signatures. These schemes require a computation of large integer multiplications. Those cryptographic schemes are vulnerable to a brute-force attack, and the large key is the countermeasure. In practice, the key size that makes brute-force attack impractical will slows down the speed of encryption and decryption. Multiplication of two very long integers usually takes time to compute. Distributed Karatsuba algorithm is proposed to reduce the time of multiplication of two very long digits. The proposed architecture that makes use of Karatsuba algorithm achieves faster multiplication.

References
  • Andre Weimerskirch, “Generalizations of the Karatsuba Algorithm for Efficient Implementation”,http://www. Crypto.ruhr-uni-bochum.de/imperia/ md/content/textekaweb.pdf, 2003
  • A.Karatsuba and Y.Offman, “Multiplication of multi digit numbers on automata“, Soviet Physics-Doklady,1962.
  • Chin-Bou Liu, “Design and Implementation of Long-Digit Karatsuba’s Multiplication Algorithm Using Tensor Product Formulation”, In The Ninth Workshop on Compiler Techniques for High-Performance Computing, 2003.
  • Dan Zuras, “More On Squaring and Multiplying Large Integers”, IEEE Transactions on Computers, AUGUST 1994
  • J. Tudor, “Using the Parallel Karotsuba Algorithm For Long Integer Multiplication”, European Conference on Parallel Processing,, 1997.
  • M. Taufer, “A Protein Structure Prediction Supercomputer Based on Public-Resource Computing”. IEEE Transactions on Parallel and Distributed Systems, Aug 2006.
  • en.Wiktionary . org / wiki / distributed _ computing
  • SETI@Home - setiathome.ssl.berkeley.edu
  • Climate prediction - Climateprediction.net
  • Quake-Catcher Network - qcn.stanford.edu
  • PrimeGrid-http://distributedcomputing.info/ap- math.html#primegrid
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

GDPS IMDP Karatsuba Algorithm

Powered by PhDFocusTM