A New Digital Signature Scheme Based on Discrete Logarithms and Factoring
Yanjun Li
Abstract
Yanjun Li
Abstract
Analyzes the security of the signature scheme as put forward by Xinqiu Wu and proves that its security is only based on the difficulty of factoring on attacking the scheme. In succession a new digital signature scheme is given. Its operating speed is faster, and its security is strictly based on the difficulties of discrete logarithms and factoring. Properties of this new scheme and a comparison between the two schemes are also discussed in some detail.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Analyzes the security of the signature scheme as put forward by Xinqiu Wu and proves that its security is only based on the difficulty of factoring on attacking the scheme. In succession a new digital signature scheme is given. Its operating speed is faster, and its security is strictly based on the difficulties of discrete logarithms and factoring. Properties of this new scheme and a comparison between the two schemes are also discussed in some detail.
Key concepts: Factoring, Digital signature, Discrete logarithm, Scheme (mathematics), Signature (topology), Logarithm, ElGamal signature scheme, Schnorr signature