Improved digital signature schemes based on dual-complexities

Kai Chain, Jar-Ferr Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In the electronic commerce and e-government era, digital signature has become more and more important recently. Digital signature algorithms can be categorized based on one of security suppositions, discrete logarithm and factorization hard-problems, which are currently believed to be unsolvable in a reasonable time-period. In other words, if the discrete logarithm or factorization problem can be broken, the corresponding digital signature scheme will become insecure any more. Therefore, to enhance the system security, the adoption of a digital signature algorithm based on both assumptions is a possible choice. In this paper, by referring to Laih and Kuo's architecture [1], we propose a new digital signature algorithm based on both discrete logarithm and factorization problems. We also propose another digital signature scheme. After analyses, the proposed scheme used less key length can achieve the similar security purposes. We also prove that the security of the proposed scheme is based on both discrete logarithm and factoring problems.

Original languageEnglish
Title of host publicationProceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012
Pages102-107
Number of pages6
Publication statusPublished - 2012
Event2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012 - Taipei, Taiwan
Duration: 2012 Oct 232012 Oct 25

Other

Other2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012
CountryTaiwan
CityTaipei
Period12-10-2312-10-25

Fingerprint

Electronic document identification systems
Factorization
Electronic commerce
Security systems

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Software

Cite this

Chain, K., & Yang, J-F. (2012). Improved digital signature schemes based on dual-complexities. In Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012 (pp. 102-107). [6528414]
Chain, Kai ; Yang, Jar-Ferr. / Improved digital signature schemes based on dual-complexities. Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012. 2012. pp. 102-107
@inproceedings{78a9b5b937014d8381db981cc5ca90d8,
title = "Improved digital signature schemes based on dual-complexities",
abstract = "In the electronic commerce and e-government era, digital signature has become more and more important recently. Digital signature algorithms can be categorized based on one of security suppositions, discrete logarithm and factorization hard-problems, which are currently believed to be unsolvable in a reasonable time-period. In other words, if the discrete logarithm or factorization problem can be broken, the corresponding digital signature scheme will become insecure any more. Therefore, to enhance the system security, the adoption of a digital signature algorithm based on both assumptions is a possible choice. In this paper, by referring to Laih and Kuo's architecture [1], we propose a new digital signature algorithm based on both discrete logarithm and factorization problems. We also propose another digital signature scheme. After analyses, the proposed scheme used less key length can achieve the similar security purposes. We also prove that the security of the proposed scheme is based on both discrete logarithm and factoring problems.",
author = "Kai Chain and Jar-Ferr Yang",
year = "2012",
language = "English",
isbn = "9788994364193",
pages = "102--107",
booktitle = "Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012",

}

Chain, K & Yang, J-F 2012, Improved digital signature schemes based on dual-complexities. in Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012., 6528414, pp. 102-107, 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012, Taipei, Taiwan, 12-10-23.

Improved digital signature schemes based on dual-complexities. / Chain, Kai; Yang, Jar-Ferr.

Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012. 2012. p. 102-107 6528414.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Improved digital signature schemes based on dual-complexities

AU - Chain, Kai

AU - Yang, Jar-Ferr

PY - 2012

Y1 - 2012

N2 - In the electronic commerce and e-government era, digital signature has become more and more important recently. Digital signature algorithms can be categorized based on one of security suppositions, discrete logarithm and factorization hard-problems, which are currently believed to be unsolvable in a reasonable time-period. In other words, if the discrete logarithm or factorization problem can be broken, the corresponding digital signature scheme will become insecure any more. Therefore, to enhance the system security, the adoption of a digital signature algorithm based on both assumptions is a possible choice. In this paper, by referring to Laih and Kuo's architecture [1], we propose a new digital signature algorithm based on both discrete logarithm and factorization problems. We also propose another digital signature scheme. After analyses, the proposed scheme used less key length can achieve the similar security purposes. We also prove that the security of the proposed scheme is based on both discrete logarithm and factoring problems.

AB - In the electronic commerce and e-government era, digital signature has become more and more important recently. Digital signature algorithms can be categorized based on one of security suppositions, discrete logarithm and factorization hard-problems, which are currently believed to be unsolvable in a reasonable time-period. In other words, if the discrete logarithm or factorization problem can be broken, the corresponding digital signature scheme will become insecure any more. Therefore, to enhance the system security, the adoption of a digital signature algorithm based on both assumptions is a possible choice. In this paper, by referring to Laih and Kuo's architecture [1], we propose a new digital signature algorithm based on both discrete logarithm and factorization problems. We also propose another digital signature scheme. After analyses, the proposed scheme used less key length can achieve the similar security purposes. We also prove that the security of the proposed scheme is based on both discrete logarithm and factoring problems.

UR - http://www.scopus.com/inward/record.url?scp=84880966068&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880966068&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9788994364193

SP - 102

EP - 107

BT - Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012

ER -

Chain K, Yang J-F. Improved digital signature schemes based on dual-complexities. In Proceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012. 2012. p. 102-107. 6528414