Digital signature method based on strong rivest-shamir-adleman (RSA) hypothesis

Abstract

The invention discloses a digital signature method based on strong rivest-shamir-adleman (RSA) hypothesis. The method comprises the following steps: 1) a signature server generates a public key (PK) and a secret key (SK) based on the strong RSA hypothesis according to the safe parameter k, index length l, message length 1cm and parameter length le (le is greater than 1m); 2) a signature (upsilon, e, s) is generated by using the secrete key aiming at the message m required to be transmitted, wherein upsilon=b gamma modn, lambda=gamma*e- beta, b is a random element, n is an RSA modulus, gamma and beta which are respectively an element of a set of R [0, 21) are random numbers, e is a random prime number with the length of le, s=lambda- alpha*m, and alpha which is an element of the set of R [0, 21) is an random number; 3) the signature (u, e, s) corresponding to the message m is transmitted to a receiving server; and 4) the receiving server verifies the signature (u, e, s), and the public key is used to judge that whether the signature is valid.

Description

technical field [0001] The invention mainly relates to a digital signature method for information security, in particular to an efficient digital signature method based on a strong RSA assumption. Background technique [0002] With the continuous development of network technology, the interaction of network information is becoming more and more frequent. Only encrypted information is far from meeting the demand, and the application of digital signatures has become more and more extensive. [0003] Digital signatures are a fundamental primitive in modern cryptography. In a signature scheme, the signer generates a key pair including a signing key and a verification key. The signing key is kept secret by the signer, and the verification key is made public to potential verifiers. For a message, the signer uses the signature function and the signing key to generate a string, which is called the signature of the message. The verifier can then use the verification function and v...

AI Technical Summary

Problems solved by technology

In 2000, Cramer and Shoup proposed a secure signature scheme under the standard model, but the scheme is based on a stronger assumption - the strong RSA assumption

The main advantage of these schemes is that they all have security proofs under the standard model. The main disadvantage is that they need to pay more computational cost compared to the RSA scheme.

Images