Research on Large Integer Multiplication Based on Knuth and Karatsuba Multiplication
Tao Li
Abstract
Tao Li
Abstract
Algorithms in cryptosystem such as RSA and Diffie-Hellman require large integer multiplication.In the paper Knuth classical multiplication,Karatsuba multiplication and their time complexity were presented,on the basis of which a new large integer multiplication trick was put forward and proved available in theory and practice.The experiment showed that the improved multiplication algorithm is more efficient in implementation of large integer multiplication.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Algorithms in cryptosystem such as RSA and Diffie-Hellman require large integer multiplication.In the paper Knuth classical multiplication,Karatsuba multiplication and their time complexity were presented,on the basis of which a new large integer multiplication trick was put forward and proved available in theory and practice.The experiment showed that the improved multiplication algorithm is more efficient in implementation of large integer multiplication.
Key concepts: Multiplication (music), Multiplication algorithm, Integer (computer science), Cryptosystem, Arithmetic, Mathematics, Basis (linear algebra), Computer science