Threshold cryptosystem based on factoring and discrete logarithm problems

Mohd Saiful Adli Mohamad, Eddie Shahril Ismail

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

Abstract

Recently, the development of cryptosystem based on two problems has increased, since it is proved that the cryptosystem based on two problems is more secure than the cryptosystem based on single problem. Meanwhile, the concept of group-oriented cryptography, known as threshold cryptography, gave a new dimension in development of cryptosystems. In this paper we propose a new threshold cryptosystem based on two number theoretical problems; factoring and discrete logarithms. Other than the scheme, we also show that our cryptosystem is secure against some possible attack and requires reasonable time in encryption and decryption phases.

Original languageEnglish
Title of host publicationAIP Conference Proceedings
Pages1020-1023
Number of pages4
Volume1571
DOIs
Publication statusPublished - 2013
Event2013 UKM Faculty of Science and Technology Post-Graduate Colloquium - Selangor
Duration: 3 Jul 20134 Jul 2013

Other

Other2013 UKM Faculty of Science and Technology Post-Graduate Colloquium
CitySelangor
Period3/7/134/7/13

Fingerprint

cryptography
logarithms
thresholds
attack

Keywords

  • Cryptography
  • Discrete logarithm
  • Factoring
  • Threshold cryptosystem

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Mohamad, M. S. A., & Ismail, E. S. (2013). Threshold cryptosystem based on factoring and discrete logarithm problems. In AIP Conference Proceedings (Vol. 1571, pp. 1020-1023) https://doi.org/10.1063/1.4858787

Threshold cryptosystem based on factoring and discrete logarithm problems. / Mohamad, Mohd Saiful Adli; Ismail, Eddie Shahril.

AIP Conference Proceedings. Vol. 1571 2013. p. 1020-1023.

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

Mohamad, MSA & Ismail, ES 2013, Threshold cryptosystem based on factoring and discrete logarithm problems. in AIP Conference Proceedings. vol. 1571, pp. 1020-1023, 2013 UKM Faculty of Science and Technology Post-Graduate Colloquium, Selangor, 3/7/13. https://doi.org/10.1063/1.4858787
Mohamad, Mohd Saiful Adli ; Ismail, Eddie Shahril. / Threshold cryptosystem based on factoring and discrete logarithm problems. AIP Conference Proceedings. Vol. 1571 2013. pp. 1020-1023
@inproceedings{93f6436ca2414e62b715fdf894cdeb37,
title = "Threshold cryptosystem based on factoring and discrete logarithm problems",
abstract = "Recently, the development of cryptosystem based on two problems has increased, since it is proved that the cryptosystem based on two problems is more secure than the cryptosystem based on single problem. Meanwhile, the concept of group-oriented cryptography, known as threshold cryptography, gave a new dimension in development of cryptosystems. In this paper we propose a new threshold cryptosystem based on two number theoretical problems; factoring and discrete logarithms. Other than the scheme, we also show that our cryptosystem is secure against some possible attack and requires reasonable time in encryption and decryption phases.",
keywords = "Cryptography, Discrete logarithm, Factoring, Threshold cryptosystem",
author = "Mohamad, {Mohd Saiful Adli} and Ismail, {Eddie Shahril}",
year = "2013",
doi = "10.1063/1.4858787",
language = "English",
isbn = "9780735411999",
volume = "1571",
pages = "1020--1023",
booktitle = "AIP Conference Proceedings",

}

TY - GEN

T1 - Threshold cryptosystem based on factoring and discrete logarithm problems

AU - Mohamad, Mohd Saiful Adli

AU - Ismail, Eddie Shahril

PY - 2013

Y1 - 2013

N2 - Recently, the development of cryptosystem based on two problems has increased, since it is proved that the cryptosystem based on two problems is more secure than the cryptosystem based on single problem. Meanwhile, the concept of group-oriented cryptography, known as threshold cryptography, gave a new dimension in development of cryptosystems. In this paper we propose a new threshold cryptosystem based on two number theoretical problems; factoring and discrete logarithms. Other than the scheme, we also show that our cryptosystem is secure against some possible attack and requires reasonable time in encryption and decryption phases.

AB - Recently, the development of cryptosystem based on two problems has increased, since it is proved that the cryptosystem based on two problems is more secure than the cryptosystem based on single problem. Meanwhile, the concept of group-oriented cryptography, known as threshold cryptography, gave a new dimension in development of cryptosystems. In this paper we propose a new threshold cryptosystem based on two number theoretical problems; factoring and discrete logarithms. Other than the scheme, we also show that our cryptosystem is secure against some possible attack and requires reasonable time in encryption and decryption phases.

KW - Cryptography

KW - Discrete logarithm

KW - Factoring

KW - Threshold cryptosystem

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

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

U2 - 10.1063/1.4858787

DO - 10.1063/1.4858787

M3 - Conference contribution

AN - SCOPUS:84897772848

SN - 9780735411999

VL - 1571

SP - 1020

EP - 1023

BT - AIP Conference Proceedings

ER -