Font Size: a A A

The Research And DSP Implementation Of Elliptic Curve Cryptography

Posted on:2008-11-07Degree:MasterType:Thesis
Country:ChinaCandidate:H LaiFull Text:PDF
GTID:2178360215458616Subject:Cryptography
Abstract/Summary:PDF Full Text Request
In 21st century, digital communication has become one important part of our lives. With the rise of information value, the information security faces increasingly serious menaces. Consequently, there must be some efficient technology to protect the security of information, and public key cryptography will play a more and more important role.Miller and Koblitz proposed Elliptic curve cryptosystem (ECC) in 1980s. As a new public key system, ECC is better than other public key algorithm in terms of safety, time and cost. Thus in the last 20 years, it developed fast, attracted attention from mathematicians and cryptographists of the world, and been widely used in the society.This paper is mainly about ECC system. Firstly, the history of ECC and its application implements is reviewed, and the basic theory of ECC is introduced. Then, the key factors for realization of fast point multiplication on elliptic curve are analyzed in detail and a new fast point multiplication is proposed. After analysis, it shows that the new algorithm is high efficient, feasible, and need less storage memory. Lastly, the whole realizing process of ECC system on DSPs is given in the paper, meanwhile, combining with the characteristics of TMS320C64x chips, the program is deeply optimized. As a result, a basic functions library of ECC based on finite prime number field is formed and its efficiency is evaluated. By contrasting, the efficiency of field operations in this paper is faster than others.
Keywords/Search Tags:elliptic curve, finite prime number field, point multiplication, DSP
PDF Full Text Request
Related items