Big-Digits Representation and its Application in Cryptography
Shahram Jahani and Azman Samsudin
Corresponding Email: [email protected]
Received date: -
Accepted date: -
Abstract:
The efficiency of number theory based cryptosystems correlates directly to the efficiency of the large integer multiplication operation. In this paper, we propose a hybrid of the Karatsuba-Classical multiplication algorithm that is based on a Look-up table of "Big-Digits" representation. The Big-Digits representation is a more compact representation compared to the binary representation. Therefore, by using the Big-Digits representation, the number of sub-multiplication operations in a multiplication algorithm will reduce significantly. The results of this study show that the proposed multiplication algorithm, which is based on the Big-Digits representation, is faster than the classical, Karatsuba and the hybrid of Karatsuba-Classical multiplication algorithms in a range of the public-key cryptography implementation.
Keywords: Public-key cryptography, Big-Integer calculation, and Karatsuba multiplication algorithm