Threshold cryptosystem with factoring and elliptic curve discrete logarithm problems

Mohd Saiful Adli Mohamad1, Eddie Shahril Ismail

Research output: Contribution to journalArticle

Abstract

Recently, the development of cryptosystems based on multiple hard problems attracts attention from mathematicians and computer scientists as it is believed that such systems provide long-term security. In another side, the concept of threshold cryptography gives benefit in group-oriented community. For these reasons, in this paper we propose a new threshold cryptosystem based on factoring and elliptic curve discrete logarithm problems. We show that our scheme is heuristically secure against some cryptographic attack. From the efficiency analysis, it can be seen that our scheme requires reasonable time complexity in encryption and decryption phases.

Original languageEnglish
Pages (from-to)34974-34977
Number of pages4
JournalInternational Journal of Applied Engineering Research
Volume10
Issue number14
Publication statusPublished - 2015

Fingerprint

Cryptography

Keywords

  • Elliptic curve discrete logarithm problem
  • Factoring problem
  • Threshold cryptosystem

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Threshold cryptosystem with factoring and elliptic curve discrete logarithm problems. / Mohamad1, Mohd Saiful Adli; Ismail, Eddie Shahril.

In: International Journal of Applied Engineering Research, Vol. 10, No. 14, 2015, p. 34974-34977.

Research output: Contribution to journalArticle

@article{1e50557993ef47c7a8ac33a38e53f2d5,
title = "Threshold cryptosystem with factoring and elliptic curve discrete logarithm problems",
abstract = "Recently, the development of cryptosystems based on multiple hard problems attracts attention from mathematicians and computer scientists as it is believed that such systems provide long-term security. In another side, the concept of threshold cryptography gives benefit in group-oriented community. For these reasons, in this paper we propose a new threshold cryptosystem based on factoring and elliptic curve discrete logarithm problems. We show that our scheme is heuristically secure against some cryptographic attack. From the efficiency analysis, it can be seen that our scheme requires reasonable time complexity in encryption and decryption phases.",
keywords = "Elliptic curve discrete logarithm problem, Factoring problem, Threshold cryptosystem",
author = "Mohamad1, {Mohd Saiful Adli} and Ismail, {Eddie Shahril}",
year = "2015",
language = "English",
volume = "10",
pages = "34974--34977",
journal = "International Journal of Applied Engineering Research",
issn = "0973-4562",
publisher = "Research India Publications",
number = "14",

}

TY - JOUR

T1 - Threshold cryptosystem with factoring and elliptic curve discrete logarithm problems

AU - Mohamad1, Mohd Saiful Adli

AU - Ismail, Eddie Shahril

PY - 2015

Y1 - 2015

N2 - Recently, the development of cryptosystems based on multiple hard problems attracts attention from mathematicians and computer scientists as it is believed that such systems provide long-term security. In another side, the concept of threshold cryptography gives benefit in group-oriented community. For these reasons, in this paper we propose a new threshold cryptosystem based on factoring and elliptic curve discrete logarithm problems. We show that our scheme is heuristically secure against some cryptographic attack. From the efficiency analysis, it can be seen that our scheme requires reasonable time complexity in encryption and decryption phases.

AB - Recently, the development of cryptosystems based on multiple hard problems attracts attention from mathematicians and computer scientists as it is believed that such systems provide long-term security. In another side, the concept of threshold cryptography gives benefit in group-oriented community. For these reasons, in this paper we propose a new threshold cryptosystem based on factoring and elliptic curve discrete logarithm problems. We show that our scheme is heuristically secure against some cryptographic attack. From the efficiency analysis, it can be seen that our scheme requires reasonable time complexity in encryption and decryption phases.

KW - Elliptic curve discrete logarithm problem

KW - Factoring problem

KW - Threshold cryptosystem

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

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

M3 - Article

AN - SCOPUS:84940118741

VL - 10

SP - 34974

EP - 34977

JO - International Journal of Applied Engineering Research

JF - International Journal of Applied Engineering Research

SN - 0973-4562

IS - 14

ER -