New Digital Signature Schemes Based on Factoring and Discrete Logarithms
Yin Yuan
Abstract
Yin Yuan
Abstract
A new digital signature scheme is given, in which the security is based on the difficulties of computing discrete logarithms and factoring; its performance and security are consequently better than those of the signature schemes which are based on the difficulty of a single problem.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
A new digital signature scheme is given, in which the security is based on the difficulties of computing discrete logarithms and factoring; its performance and security are consequently better than those of the signature schemes which are based on the difficulty of a single problem.
Key concepts: Factoring, Discrete logarithm, Digital signature, Signature (topology), ElGamal signature scheme, Schnorr signature, Logarithm, Blind signature