论文信息 - Improvement of signature scheme based on factoring and discrete logarithms

Improvement of signature scheme based on factoring and discrete logarithms

Laih and Kuo proposed two efficient signature schemes based on discrete logarithms and factorization. However, their schemes require many keys for a signing document. In this article, we shall propose an improvement of Laih and Kuo's signature schemes. The improved scheme will outperform their schemes in the number of keys.

[1] C. Laih,et al. New Signature Schemes Based on Factoring and Discrete Logarithms (Special Section on Cryptography and Information Security) , 1997 .

[2] Min-Shiang Hwang,et al. Cryptanalysis of the Batch Verifying Multiple RSA Digital Signatures , 2000, Informatica.

[3] Chin-Chen Chang,et al. Parallel computation of the generating keys for RSA cryptosystems , 1996 .

[4] Chin-Chen Chang,et al. An ElGamal-Like Cryptosystem for Enciphering Large Messages , 2002, IEEE Trans. Knowl. Data Eng..

[5] Cheng-Chi Lee,et al. Traceability on RSA-based partially signature with low computation , 2003, Appl. Math. Comput..

[6] Eric Jui-Lin Lu,et al. Cryptanalysis of the Batch Verifying Multiple DSA-Type Digital Signature , 2001 .

[7] Taher ElGamal,et al. A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[8] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[9] Tzonelih Hwang,et al. On the traceability on RSA-based partially signature with low computation , 2005, Appl. Math. Comput..