Skip to main navigation Skip to search Skip to main content

Security of generalized signature scheme based on discrete logarithms and factorization

  • Chien Lung Hsu*
  • , Yu Hao Chuang
  • , Wei Hua Heb
  • , So Lin Yen
  • , Chin Lung Tseng
  • , Chia Wen Chen
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings - 43rd Annual 2009 International Carnahan Conference on Security Technology, ICCST 2009
Pages245-247
Number of pages3
DOIs
StatePublished - 2009
Externally publishedYes
Event43rd Annual 2009 International Carnahan Conference on Security Technology, ICCST 2009 - Zurich, Switzerland
Duration: 05 10 200908 10 2009

Publication series

NameProceedings - International Carnahan Conference on Security Technology
ISSN (Print)1071-6572

Conference

Conference43rd Annual 2009 International Carnahan Conference on Security Technology, ICCST 2009
Country/TerritorySwitzerland
CityZurich
Period05/10/0908/10/09

Keywords

  • Discrete logarithm
  • Factorization
  • Generalized
  • Signature

Fingerprint

Dive into the research topics of 'Security of generalized signature scheme based on discrete logarithms and factorization'. Together they form a unique fingerprint.

Cite this