A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Speeding up the Multiplication Algorithm for Large Integers

2020
*
Engineering, Technology & Applied Science Research
*

Multiplication is one of the basic operations that influence the performance of many computer applications such as cryptography. The main challenge of the multiplication operation is the cost of the operation as compared to other basic operations such as addition and subtraction, especially when the size of the numbers is large. In this work, we investigate the use of the window strategy for multiplying a sequence of large integers to design an efficient sequential algorithm in order to reduce

doi:10.48084/etasr.3932
fatcat:zme3ycsa6rfatb6nbnrqa2bnem