Review Of Fast Multiplication Algorithms For Embedded Systems Design
Journal: International Journal of Scientific & Technology Research (Vol.6, No. 8)Publication Date: 2017-08-15
Authors : Mohammed Mosab Asad; Ibrahim Marouf; Qasem Abu Al-Haija;
Page : 238-242
Keywords : Karatsuba multiplication; SchnhageStrassen multiplication; interleaved multiplication algorithm; Montgomery modular multiplication; Guajardo-Paar Squaring Algorithm.;
Abstract
This paper presents a review with numerical example and complexity analysis of the fast multiplication algorithms to help embedded system designers to improve the hardware performance for many applications such as cryptosystems design. The paper presented two practical multiplication algorithms Karatsuba multiplication algorithm with time complexity On2612310log261231122682893 and SchnhageStrassen multiplication algorithm with the run-time bit complexity defined as On log268289n log268289log2682892612310n2612311. In addition interleaved multiplication algorithm can be used efficiently to compute the modular multiplication with logarithmic time complexity which enhances the linear time complexity of Montgomery modular multiplication.
Other Latest Articles
- Genetic Diversity Analysis of Traditional Rice Variety Pachchaperumal Using SSR Markers
- The Effect Of Financial Ratios On Islamic Rural Bank Performance In Indonesia
- Sustainable Livelihood Approach For Assessing Household Adoption To Eviction Mau Forest Kenya
- Determinants Of Foreign Direct Investment In Mauritius Evidence From Time Series Data
- Mechanical And Physical Properties Of Polyurethane Composites Reinforced With Carbon Black N990 Particles
Last modified: 2017-10-22 19:56:52