The Parallelization Algorithm Research Of Elliptic Curve Scalar Multiplication On DSP

Cryptology is a core of information security,and modern cryptology researches two kinds of cryptosystems:the secret key cryptosystem and the public key cryptosystem.The public key cryptosystem can provide some functions such as digital signature,identity authentication that the single key cryptosystem can't compare to,in addition to providing all the functions of the secret key cryptosystem.Elliptic Curve Cryptography(ECC)provides the highest strengthper-key-bit of any cryptography known.Compared with other public-key cryptographies,ECC not only has the higher security but also has less computation overheads,shorter key size and narrower bandwidth.Therefore, it is believed that ECC will become the next generation popular public-key cryptography.Scalar multiplication is the main operation in ECC.It determines the speed of encryption/decryption in ECC.Many achievements on improving scalar multiplication have been proposed,and many improved algorithms have been presented.In this essay,a parallelization algorithm is presented to improve the efficiency.This essay provides a brief description of ECC public key cryptography and the related knowledge,particularly introduces non-super singular elliptic curves E established on the finite field with p＞3.And the essay further researches the present scalar multiplication,and proposes a parallelization algorithm based on DSP which is the primary condition of ECC.The algorithm adopts parallelization operation instead of the traditional methods.The analysis shows that the efficiency is improved by proposed algorithm.