Research On Rapid Elliptic Based Digital Signature Scheme

Digital signature, a great composition of modern e-commerce, is a sort of compounded technology which include Hash function, cryptography and other related technology of information security. It is being used in the areas of completeness checks, authentication of identity and etc. however, some problem begin go appear while the advancement of IT-tech. For the purpose to achieve better security level, it needs to enlarge the length of code which means the dramatic decrement on computational efficiency. To keep the balance between efficiency and security level, a new scheme is required to satisfy the requirement of lower computational complexity while a reliable security is received.Based on the research on how to improve the security level or to get lower computational complexity of the ellipse curve based digital signature theme, the contribution or research work of this paper is under the list.(1) A comprehensive introduction on the digital signature and other variety of cryptosystem. Close behind the introduction is a comparison between the listed cryptosystem based digital signature scheme about its security level or computational efficiency in a table with accurate data. In the final part of the first chapter, a conclusion is drawn that ellipse curve based digital signature theme is rational choice compared with other cryptosystem based digital signature theme.(2) Point-operation on elliptic is heated discussion among the world’s research considering the fact that it will present great influence on various elliptic-based application of information security. In chapter3, the central concern is how to advance the computation efficiency of multiple point operation. Two classic algorithms is introduced and deeply discussed and the then the author composed a new concept, efficient NAF, to describe some inefficient sub-sequence and to have it modified. The last part of this chapter focused on a modified algorithm which is with better efficient both on basic point operation and arbitrary point and comparable analysis with concrete date is presented.(3) The last chapter focused on the Elliptic Curve Point Multiplication, which would occupy the most computation resources when taking ellipse curve computation. The Modified Algorithm will avoid the inverse operation. The superiority of the modification on the algorithm is to achieve lower computational complexity and meanwhile with the prerequisite that security is ensured.