• Nikita Sunil Sukhadeve
• A.M.Shah

The demand of the decade is for low area, low power, and efficient arithmetic operations. The mathematical function of multiplication must be carried out quickly and efficiently in high-speed systems like digital signal processing, image processing, graphics, etc. When developing a system with complicated operations, it's crucial to take into account a number of critical factors, including the portability of a device, power consumption, the system's response time, and power dissipation. Modular operations are used in many of the algorithms used in applications like cryptography, which is the act of classifying information, changing it to a form that may be unintelligible, and protecting it from unauthorized persons. The length of the output in modular operations is constant, unlike other arithmetic operations. Partially produced products are generated in the first stage of multipliers, which is nothing more than a series of AND gates. The incomplete items are then combined to produce the complete products. Taking all of this into account takes time. This paper reviews the most popular and cutting-edge approaches for effective modular multiplication in this study, looking specifically at FPGA-based solutions while also assessing their advantages and disadvantages.

Modular Multiplication, Karatsuba Algorithm, Cryptosystem

"A Survey on Different Methodologies of Modular Multiplication", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.9, Issue 10, page no.b504-b508, October-2022, Available :http://www.jetir.org/papers/JETIR2210171.pdf

"A Survey on Different Methodologies of Modular Multiplication", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.9, Issue 10, page no. ppb504-b508, October-2022, Available at : http://www.jetir.org/papers/JETIR2210171.pdf