Abstract
Big data security is a significant concern today due to rapidly growing data volume, velocity, and varieties of data in nature. Data security is a major concern because during transmission through insecure channels. From its recognition, the Montgomery multi-digit multiplication algorithms are still well-accepted approaches in the numerical calculation, chaos arithmetic, and highperformance implementation of public key cryptosystems such as RSA, Diffie-Hellman, and the Elliptic curve cryptosystems. We have presented the comparative study of multi-digit integer multiplication algorithms, and their performance is evaluated in terms of CPU execution time. Montgomery modular multiplication is a good practice, among others.
Recommended Citation
Biswas, Sudarsan and Biswas, Neepa
(2024)
"Comparative Analysis of Multi-digit Modular Multiplication Algorithms for public key Crypto system in Big Data Security,"
American Journal of Electronics & Communication (AJEC): Vol. 3:
Iss.
3, Article 4.
Available at:
https://research.smartsociety.org/ajec/vol3/iss3/4