2002Journal of Beijing Institute of TechnologyRequires access

New Digital Signature Schemes Based on Factoring and Discrete Logarithms

Yin Yuan

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Factoring, Discrete logarithm, Digital signature, Signature (topology), ElGamal signature scheme, Schnorr signature, Logarithm, Blind signature

Related papers

Back to paper searchBrowse research topicsOriginal source
New Digital Signature Schemes Based on Factoring and Discrete Logarithms — Research Paper | ScholarLens