A new digital signature scheme based on factoring and discrete logarithms

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Problem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes appear secure, one day in a near future they may be exploded if one finds a solution of the single hard problem. Approach: To overcome this problem, in this study, we proposed a new signature scheme based on multiple hard problems namely factoring and discrete logarithms. We combined the two problems into both signing and verifying equations such that the former depends on two secret keys whereas the latter depends on two corresponding public keys. Results: The new scheme was shown to be secure against the most five considering attacks for signature schemes. The efficiency performance of our scheme only requires 1203Tmul+Th time complexity for signature generation and 1202Tmul+Th time complexity for verification generation and this magnitude of complexity is considered minimal for multiple hard problems-like signature schemes. Conclusions: The new signature scheme based on multiple hard problems provides longer and higher security level than that scheme based on one problem. This is because no enemy can solve multiple hard problems simultaneously.

Original languageEnglish
Pages (from-to)222-225
Number of pages4
JournalJournal of Mathematics and Statistics
Volume4
Issue number4
DOIs
Publication statusPublished - 2008

Fingerprint

Discrete Logarithm
Digital Signature
Factoring
Signature Scheme
Time Complexity
Signature
Discrete Logarithm Problem
Public key
Elliptic Curves
Attack
Electronics

Keywords

  • Cryptography
  • Cryptology
  • Digital signature
  • Discrete logarithms
  • Factoring

ASJC Scopus subject areas

  • Mathematics(all)
  • Statistics and Probability

Cite this

A new digital signature scheme based on factoring and discrete logarithms. / Ismail, Eddie Shahril; Tahat, N. M F; Ahmad, Rokiah @ Rozita.

In: Journal of Mathematics and Statistics, Vol. 4, No. 4, 2008, p. 222-225.

Research output: Contribution to journalArticle

@article{62cc1cada7fe4263996e9eb36ab8f21f,
title = "A new digital signature scheme based on factoring and discrete logarithms",
abstract = "Problem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes appear secure, one day in a near future they may be exploded if one finds a solution of the single hard problem. Approach: To overcome this problem, in this study, we proposed a new signature scheme based on multiple hard problems namely factoring and discrete logarithms. We combined the two problems into both signing and verifying equations such that the former depends on two secret keys whereas the latter depends on two corresponding public keys. Results: The new scheme was shown to be secure against the most five considering attacks for signature schemes. The efficiency performance of our scheme only requires 1203Tmul+Th time complexity for signature generation and 1202Tmul+Th time complexity for verification generation and this magnitude of complexity is considered minimal for multiple hard problems-like signature schemes. Conclusions: The new signature scheme based on multiple hard problems provides longer and higher security level than that scheme based on one problem. This is because no enemy can solve multiple hard problems simultaneously.",
keywords = "Cryptography, Cryptology, Digital signature, Discrete logarithms, Factoring",
author = "Ismail, {Eddie Shahril} and Tahat, {N. M F} and Ahmad, {Rokiah @ Rozita}",
year = "2008",
doi = "10.3844/jmssp.2008.222.225",
language = "English",
volume = "4",
pages = "222--225",
journal = "Journal of Mathematics and Statistics",
issn = "1549-3644",
publisher = "Science Publications",
number = "4",

}

TY - JOUR

T1 - A new digital signature scheme based on factoring and discrete logarithms

AU - Ismail, Eddie Shahril

AU - Tahat, N. M F

AU - Ahmad, Rokiah @ Rozita

PY - 2008

Y1 - 2008

N2 - Problem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes appear secure, one day in a near future they may be exploded if one finds a solution of the single hard problem. Approach: To overcome this problem, in this study, we proposed a new signature scheme based on multiple hard problems namely factoring and discrete logarithms. We combined the two problems into both signing and verifying equations such that the former depends on two secret keys whereas the latter depends on two corresponding public keys. Results: The new scheme was shown to be secure against the most five considering attacks for signature schemes. The efficiency performance of our scheme only requires 1203Tmul+Th time complexity for signature generation and 1202Tmul+Th time complexity for verification generation and this magnitude of complexity is considered minimal for multiple hard problems-like signature schemes. Conclusions: The new signature scheme based on multiple hard problems provides longer and higher security level than that scheme based on one problem. This is because no enemy can solve multiple hard problems simultaneously.

AB - Problem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes appear secure, one day in a near future they may be exploded if one finds a solution of the single hard problem. Approach: To overcome this problem, in this study, we proposed a new signature scheme based on multiple hard problems namely factoring and discrete logarithms. We combined the two problems into both signing and verifying equations such that the former depends on two secret keys whereas the latter depends on two corresponding public keys. Results: The new scheme was shown to be secure against the most five considering attacks for signature schemes. The efficiency performance of our scheme only requires 1203Tmul+Th time complexity for signature generation and 1202Tmul+Th time complexity for verification generation and this magnitude of complexity is considered minimal for multiple hard problems-like signature schemes. Conclusions: The new signature scheme based on multiple hard problems provides longer and higher security level than that scheme based on one problem. This is because no enemy can solve multiple hard problems simultaneously.

KW - Cryptography

KW - Cryptology

KW - Digital signature

KW - Discrete logarithms

KW - Factoring

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

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

U2 - 10.3844/jmssp.2008.222.225

DO - 10.3844/jmssp.2008.222.225

M3 - Article

AN - SCOPUS:65449178856

VL - 4

SP - 222

EP - 225

JO - Journal of Mathematics and Statistics

JF - Journal of Mathematics and Statistics

SN - 1549-3644

IS - 4

ER -