Security of generalized signature scheme based on discrete logarithms and factorization

Author

Hsu, Chien-Lung ; Chuang, Yu-Hao ; He, Wei-Hua ; So-Lin Yen ; Tseng, Chin-Lung ; Chen, Chia-Wen

Author_Institution

Dept. of Inf. Manage., Chang Gung Univ., Taoyuan, Taiwan

fYear

2009

fDate

5-8 Oct. 2009

Firstpage

245

Lastpage

247

Abstract

In 2005, Pon et al. proposed a generalized signature scheme based on the intractability of solving two well-known cryptographic assumptions, the factorization (FAC) and the discrete logarithm problem (DLP). They claimed that their scheme is still secure, provided that one of these two assumptions is solved. This paper, however, will show that Pon et al.´s scheme is insecure against the universal forgery attack if the adversary can solve the DLP.

Keywords

cryptography; digital signatures; cryptography; discrete logarithm problem; factorization; generalized signature scheme security; universal forgery attack; Computer science; Computer security; Forgery; Handwriting recognition; Information management; Information security; Mathematics; Public key; Public key cryptography; Zirconium; Signature; discrete logarithm; factorization; generalized;

fLanguage

English

Publisher

ieee

Conference_Titel

Security Technology, 2009. 43rd Annual 2009 International Carnahan Conference on

Conference_Location

Zurich

Print_ISBN

978-1-4244-4169-3

Electronic_ISBN

978-1-4244-4170-9

Type

conf

DOI

10.1109/CCST.2009.5335530

Filename

5335530

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2432065