A Provably Secure Signature Scheme based on Factoring and Discrete Logarithms

Authors

Zuhua Shao, No. 210, Wulin Road, Hangzhou, Zhejiang, 310006, P. R. ChinaFollow
Yipeng Gao

Author Country (or Countries)

P. R. China

Abstract

To make users put much confidence in digital signatures, this paper proposes the first provably secure signature scheme based on both factoring and discrete logarithms. The new scheme incorporates both the Schnorr signature scheme and the PSS-Rabin signature scheme. Unless both the two cryptographic assumptions could be become solved simultaneously, anyone would not forge any signature. The proposed scheme is efficient since the computation requirement and the storage requirement are slightly larger than those for the Schnorr signature scheme and the PSS-Rabin signature scheme.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.12785/amis/080408

Recommended Citation

Shao, Zuhua and Gao, Yipeng (2014) "A Provably Secure Signature Scheme based on Factoring and Discrete Logarithms," Applied Mathematics & Information Sciences: Vol. 08: Iss. 4, Article 8.
DOI: http://dx.doi.org/10.12785/amis/080408
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss4/8