Font Size: a A A

Research On Digital Signature Algorithm Based On Elliptic Curve

Posted on:2019-09-12Degree:MasterType:Thesis
Country:ChinaCandidate:Q Y WangFull Text:PDF
GTID:2428330563456213Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
In the cryptosystem,the public key cryptosystem based on the elliptic curve discrete logarithm problem is widely used in the field of information security because of its low requirement for broadband,short key,and high security.It can protect information security and integrity,at the same time,it also has non-repudiation and other functions.Based on the safety performance and computational efficiency of elliptic curve digital signatures,this paper analyzes the improvement of the elliptic curve digital signature system,and proposes a solution of the improvement of the elliptic curve digital signature system:1.Since the inversion operation in the digital signature algorithm occupies a large amount of computation space,the computational efficiency of the elliptic curve digital signature scheme is reduced.Therefore,this paper first proposes two improved schemes by replacing the coefficients of traditional signature equations.The improved two signature schemes can effectively avoid the inversion operation during the signing process,and also reduces one multiplication operation.The improved scheme effectively improves the computational efficiency of digital signatures.2.The digital signature scheme is designed,it needs to use different random numbers to sign the information.We use the Hash function to encrypt the random number so that the improved scheme can overcome this constraint.3.This paper presents a dual-private key,two-parameter digital signature scheme with forward security,and Apply this signature technology to middleware of RFID system.It can protect the interests of end users in online shopping..4.The paper aims at the Montgomery-type elliptic curve on the binary domain GF(2~m),on the basis of the one-time calculation of kP+lQ,we transform the coefficient k,l in kP+lQ and propose a faster Montgomery elliptic curve optimization scalar multiplication algorithm.The algorithm reduces the number of cycle in the operation,improves the computational efficiency,and has certain practical significance for the rapid realization of the elliptic curve digital signature algorithm.
Keywords/Search Tags:Hash function, Elliptic curve, Digital signature, Montgomery, Scalar multiplication algorithm
PDF Full Text Request
Related items