Digital signature method, signature verification method and device based on GRS code

Abstract

The invention discloses a digital signature method, a signature verification method and device based on a GRS code. The digital signature method comprises the following steps: constructing a GRS code based on a finite field; generating a public key and a private key according to the GRS code; performing hash operation on the plaintext needing digital signature to obtain an abstract value; and encrypting the abstract value by using the private key to obtain a digital signature. According to the scheme of the embodiment of the invention, the obtained digital signature has high feasibility, the number of public keys can be reduced, the digital signature efficiency is improved, and the security is further improved.

Description

technical field [0001] The invention belongs to the technical field of information security, and in particular relates to a digital signature method based on a GRS code, a signature verification method and a device thereof. Background technique [0002] Digital signature is one of the basic elements of public key cryptography. It is widely used in identity authentication, data integrity detection, anti-repudiation and other scenarios, and occupies a very important position in public key cryptography. However, since the integer decomposition and discrete logarithm problems have been proven to be effectively solved by quantum computers, the traditional digital signature system based on the above-mentioned difficult problems is not safe under quantum computers, and it has become a challenge to construct a digital signature system that can effectively resist quantum attacks. An urgent need in the cryptography community and industry. [0003] The public-key cryptosystem based on...

AI Technical Summary

Problems solved by technology

However, since the integer decomposition and discrete logarithm problems have been proven to be effectively solved by quantum computers, the traditional digital signature system based on the above-mentioned difficult problems is not safe under quantum computers, and it has become a challenge to construct a digital signature system that can effectively resist quantum attacks. An urgent need in the cryptography community and industry

[0003] The public-key cryptosystem based on error-correcting codes is constructed using the difficult problem of linear code decoding. It is different from the public-key cryptosystem based on large number decomposition and discrete logarithm. It is currently recognized as a cryptographic algorithm that can resist quantum attacks, such as CFS. signature scheme, but the existing CFS signature scheme has the problem of excessive key storage, which affects the practicability of this type of cryptosystem

Images