Large integer multiplication realizing method and device based on vector instructions

Abstract

The invention provides a large integer multiplication realizing method and device based on vector instructions. The multiplicand and the multiplier of the large integer multiplication are each split into one or more vector length integers, the integers are multiplied, and all products are summed; when the integers with two vector lengths are multiplied, product vectors generated by all the vector multiplication instructions form two addition carry chains according to the appointed sequence, the vector addition instructions with carries are utilized for making carries generated by vector addition each time serve as input of the next vector addition instruction, all the addition carries in the chains are eliminated, and only two addition carries are generated and added back to obtain the product of the integers with the two vector lengths. Specifically, if the length of the multiplicand and the length of the multiplier are smaller than 1 / n of the vector length, multiplication of n groups of integers is combined into the one-time multiplication of vector length integers, and the calculation handling capacity is promoted by n times. Based on the large integer multiplication method, the invention further discloses a high-speed large integer multiplication device based on an Intel Xeon Phi co-processor. According to the method, instruction numbers needed by the large integer multiplication method are reduced, calculation delay is reduced, and the calculation handling capacity is improved.

Description

technical field [0001] The invention relates to the field of data encryption and decryption in computer technology, in particular to a method and device for realizing multiplication of large integers based on vector instructions. Background technique [0002] Large integer multiplication is widely used in the calculation process of public key cryptography in computer technology to ensure the security of transmitted data. In the field of computer data encryption computing, the multiplication of large integers is often used to calculate the modular multiplication of large integers. Modular multiplication of large integers is a basic operation of a class of public key encryption algorithms, such as RSA algorithm and elliptic curve algorithm, which determines the calculation speed of the algorithm. For the modular multiplication of large integers that do not know the modulus in advance, such as the modular multiplication in the RSA algorithm, it is generally implemented using t...

AI Technical Summary

Problems solved by technology

[0008] The main disadvantages of this approach are: first, many vector instructions are required to convert large integers to redundant representations, and to convert the result of multiplication of large integers from redundant representations back to integers; Several high bits accommodate the carry generated by addition, and large integers may need to be split into more words, which will increase the number of operations of vector multiplication instructions and vector addition instructions

[0009] The method of redundant representation cannot calculate the vector fast summation in the multiplication of large integers very efficiently, so the calculation efficiency is low

Images