A cryptosystem based on chaotic maps and factoring problems
Nedal Tahat,
Eddie Shahril Ismail and
Ashraf H. Aljammal
International Journal of Mathematics in Operational Research, 2019, vol. 15, issue 1, 55-64
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: cryptography; cryptosystem; factorisation; chaotic maps. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=101612 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:15:y:2019:i:1:p:55-64
Access Statistics for this article
More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().