Open Access
Translator Disclaimer
2014 Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
Shahram Jahani, Azman Samsudin, Kumbakonam Govindarajan Subramanian
J. Appl. Math. 2014: 1-9 (2014). DOI: 10.1155/2014/107109


Public-key cryptosystems are broadly employed to provide security for digital information. Improving the efficiency of public-key cryptosystem through speeding up calculation and using fewer resources are among the main goals of cryptography research. In this paper, we introduce new symbols extracted from binary representation of integers called Big-ones. We present a modified version of the classical multiplication and squaring algorithms based on the Big-ones to improve the efficiency of big integer multiplication and squaring in number theory based cryptosystems. Compared to the adopted classical and Karatsuba multiplication algorithms for squaring, the proposed squaring algorithm is 2 to 3.7 and 7.9 to 2.5 times faster for squaring 32-bit and 8-Kbit numbers, respectively. The proposed multiplication algorithm is also 2.3 to 3.9 and 7 to 2.4 times faster for multiplying 32-bit and 8-Kbit numbers, respectively. The number theory based cryptosystems, which are operating in the range of 1-Kbit to 4-Kbit integers, are directly benefited from the proposed method since multiplication and squaring are the main operations in most of these systems.


Download Citation

Shahram Jahani. Azman Samsudin. Kumbakonam Govindarajan Subramanian. "Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications." J. Appl. Math. 2014 1 - 9, 2014.


Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131319
Digital Object Identifier: 10.1155/2014/107109

Rights: Copyright © 2014 Hindawi


Vol.2014 • 2014
Back to Top