Scribd
Upload
2 views

Literature Review

The literature review discusses the evolution of large number multiplication methods, highlighting the Karatsuba algorithm and Fast Fourier Transform (FFT) as significant advancements that improve computational efficiency. It also explores the role of base number systems in optimizing multiplication processes, particularly in cryptography, where efficient algorithms are crucial for secure encryption. The review concludes by indicating that the project will investigate the integration of base systems and advanced algorithms to further enhance large number multiplication.

Uploaded by

sikukurobin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Literature Review

The literature review discusses the evolution of large number multiplication methods, highlighting the Karatsuba algorithm and Fast Fourier Transform (FFT) as significant advancements that improve computational efficiency. It also explores the role of base number systems in optimizing multiplication processes, particularly in cryptography, where efficient algorithms are crucial for secure encryption. The review concludes by indicating that the project will investigate the integration of base systems and advanced algorithms to further enhance large number multiplication.

Uploaded by

sikukurobin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Here’s a Literature Review for your project:

Literature Review:

Multiplication of large numbers has been a fundamental problem in mathematics and computer science
for centuries, with several methods and algorithms developed over time to optimize the process.
Traditional multiplication, often referred to as "long multiplication," follows a straightforward approach
but becomes computationally expensive as the size of numbers increases. As computational needs grow
in fields like cryptography, scientific simulations, and large-scale data analysis, researchers have
developed more efficient algorithms to handle these challenges.

One of the early breakthroughs in large number multiplication came with the Karatsuba algorithm
(Karatsuba, 1960). This method reduces the number of multiplication operations needed by recursively
breaking the numbers into smaller parts. Instead of the standard complexity in long multiplication,
Karatsuba achieves , making it significantly faster for large numbers. Subsequent research has refined
Karatsuba’s method, making it a foundational technique for many modern multiplication algorithms.

Another critical development is the Fast Fourier Transform (FFT) algorithm, originally introduced by
Cooley and Tukey in 1965. FFT is widely used in signal processing, but it also has applications in fast
polynomial multiplication, which can be used to multiply large integers. The method reduces the time
complexity to , making it one of the fastest known algorithms for large number multiplication. However,
FFT-based multiplication is complex and may introduce precision errors when dealing with floating-point
numbers.

Base number systems such as binary, octal, and hexadecimal have also been explored in the context of
optimizing large number operations. Binary multiplication, used in many computer systems, offers
simplicity when implemented in hardware (Tanenbaum & Bos, 2014). Shifting techniques in binary
multiplication can replace more costly multiplication operations with additions and bitwise shifts, which
are faster on modern processors. Moreover, base systems like hexadecimal can compress data
representation, reducing the size of numbers and simplifying multiplication processes (Knuth, 1997).

In cryptography, large number multiplication plays a critical role, particularly in algorithms like RSA and
ECC (Elliptic Curve Cryptography) that require the manipulation of large prime numbers (Rivest et al.,
1978). Efficient multiplication is essential for encryption and decryption processes. Researchers in
cryptography continue to explore ways to optimize large number arithmetic, as improvements in
multiplication can lead to more secure and faster encryption algorithms (Koblitz, 1987).

Recent advancements have also explored the use of quantum computing for large number
multiplication, which promises exponential improvements in speed (Shor, 1994). Quantum algorithms
like Shor's algorithm provide a theoretical framework for breaking down complex multiplication
problems, although practical implementations remain in the experimental phase.

In summary, the literature highlights significant progress in the optimization of large number
multiplication through both algorithmic improvements and the use of base number systems. The
Karatsuba algorithm and FFT stand out as key advancements, while base conversions offer additional
benefits in certain contexts. However, each method has its trade-offs in terms of complexity, memory
usage, and precision. This project builds on these findings by exploring the combined use of base
systems and advanced algorithms to optimize large number multiplication, addressing the gaps
identified in current approaches.

You might also like