A cryptosystem based on chaotic maps and factoring problems

Nedal Tahat, Eddie Shahril Ismail, Ashraf H. Aljammal

Research output: Contribution to journalArticle

Abstract

A cryptosystem allows a sender to send any confidential or private message using a receiver's public key and the receiver next confirms the integrity and validity of the received message using his own secret key. Cryptosystem algorithms can be categorised based on the type of security suppositions, for example discrete logarithm, factorisation, and elliptic curve hard problems, which are all currently believed to be unsolvable in a reasonable time of period. Recently, cryptosystems based on chaotic maps have been proposed. Due to some subtle and close relationship between the properties of traditional cryptosystems and chaotic-based systems, the idea of using chaotic in cryptography has received a great deal of attention from many cryptography's researchers. Therefore, to enhance system security, we explore the implementation of a cryptosystem algorithm based on both cryptographic and chaotic system characteristics. We also provide security against known cryptographic attacks and discuss the performance analysis of the developed system.

Original languageEnglish
Pages (from-to)55-64
Number of pages10
JournalInternational Journal of Mathematics in Operational Research
Volume15
Issue number1
DOIs
Publication statusPublished - 1 Jan 2019

Fingerprint

Chaotic Map
Factoring
Cryptosystem
Cryptography
Receiver
Discrete Logarithm
Public key
Period of time
Elliptic Curves
Chaotic System
Integrity
Performance Analysis
Factorization
Chaotic systems
Attack
Security systems
Computer systems

Keywords

  • Chaotic maps
  • Cryptography
  • Cryptosystem
  • Factorisation

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Modelling and Simulation

Cite this

A cryptosystem based on chaotic maps and factoring problems. / Tahat, Nedal; Ismail, Eddie Shahril; Aljammal, Ashraf H.

In: International Journal of Mathematics in Operational Research, Vol. 15, No. 1, 01.01.2019, p. 55-64.

Research output: Contribution to journalArticle

@article{59bdb0a0ac8a4026b7778a7f2c82882f,
title = "A cryptosystem based on chaotic maps and factoring problems",
abstract = "A cryptosystem allows a sender to send any confidential or private message using a receiver's public key and the receiver next confirms the integrity and validity of the received message using his own secret key. Cryptosystem algorithms can be categorised based on the type of security suppositions, for example discrete logarithm, factorisation, and elliptic curve hard problems, which are all currently believed to be unsolvable in a reasonable time of period. Recently, cryptosystems based on chaotic maps have been proposed. Due to some subtle and close relationship between the properties of traditional cryptosystems and chaotic-based systems, the idea of using chaotic in cryptography has received a great deal of attention from many cryptography's researchers. Therefore, to enhance system security, we explore the implementation of a cryptosystem algorithm based on both cryptographic and chaotic system characteristics. We also provide security against known cryptographic attacks and discuss the performance analysis of the developed system.",
keywords = "Chaotic maps, Cryptography, Cryptosystem, Factorisation",
author = "Nedal Tahat and Ismail, {Eddie Shahril} and Aljammal, {Ashraf H.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1504/IJMOR.2019.101612",
language = "English",
volume = "15",
pages = "55--64",
journal = "International Journal of Mathematics in Operational Research",
issn = "1757-5850",
publisher = "Inderscience Publishers",
number = "1",

}

TY - JOUR

T1 - A cryptosystem based on chaotic maps and factoring problems

AU - Tahat, Nedal

AU - Ismail, Eddie Shahril

AU - Aljammal, Ashraf H.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - A cryptosystem allows a sender to send any confidential or private message using a receiver's public key and the receiver next confirms the integrity and validity of the received message using his own secret key. Cryptosystem algorithms can be categorised based on the type of security suppositions, for example discrete logarithm, factorisation, and elliptic curve hard problems, which are all currently believed to be unsolvable in a reasonable time of period. Recently, cryptosystems based on chaotic maps have been proposed. Due to some subtle and close relationship between the properties of traditional cryptosystems and chaotic-based systems, the idea of using chaotic in cryptography has received a great deal of attention from many cryptography's researchers. Therefore, to enhance system security, we explore the implementation of a cryptosystem algorithm based on both cryptographic and chaotic system characteristics. We also provide security against known cryptographic attacks and discuss the performance analysis of the developed system.

AB - A cryptosystem allows a sender to send any confidential or private message using a receiver's public key and the receiver next confirms the integrity and validity of the received message using his own secret key. Cryptosystem algorithms can be categorised based on the type of security suppositions, for example discrete logarithm, factorisation, and elliptic curve hard problems, which are all currently believed to be unsolvable in a reasonable time of period. Recently, cryptosystems based on chaotic maps have been proposed. Due to some subtle and close relationship between the properties of traditional cryptosystems and chaotic-based systems, the idea of using chaotic in cryptography has received a great deal of attention from many cryptography's researchers. Therefore, to enhance system security, we explore the implementation of a cryptosystem algorithm based on both cryptographic and chaotic system characteristics. We also provide security against known cryptographic attacks and discuss the performance analysis of the developed system.

KW - Chaotic maps

KW - Cryptography

KW - Cryptosystem

KW - Factorisation

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

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

U2 - 10.1504/IJMOR.2019.101612

DO - 10.1504/IJMOR.2019.101612

M3 - Article

VL - 15

SP - 55

EP - 64

JO - International Journal of Mathematics in Operational Research

JF - International Journal of Mathematics in Operational Research

SN - 1757-5850

IS - 1

ER -