Title: A cryptosystem based on chaotic maps and factoring problems

Authors: Nedal Tahat; Eddie Shahril Ismail; Ashraf H. Aljammal

Addresses: Department of Mathematics, Faculty of Science, The Hashemite University, P.O.150459, Zarqa 13115, Jordan ' School of Mathematical Science, Faculty of Science and Technology, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor DE, Malaysia ' Department of Computer Science and its Applications, Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, The Hashemite University, Zarqa, Jordan

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.

DOI: 10.1504/IJMOR.2019.101612

International Journal of Mathematics in Operational Research, 2019 Vol.15 No.1, pp.55 - 64

Accepted: 28 Jan 2018
Published online: 14 Aug 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article