Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications

Shahram Jahani, Azman Samsudin and Kumbakonam Govindarajan Subramanian

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

Abstract: 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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/107109

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2014:y:2014:i:1:n:107109

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().