Applications of tripled chaotic maps in cryptography
Sohrab Behnia, Afshin Akhshani, Amir Akhavan, Hadi Mahmodi

TL;DR
This paper introduces a new symmetric key block cipher based on tripled chaotic maps, enhancing security and complexity for multimedia data protection through increased key space and coupling parameters.
Contribution
The paper proposes a novel cryptosystem using tripled chaotic maps with two coupling parameters, improving security and complexity over existing chaotic-based encryption methods.
Findings
The algorithm achieves acceptable speed and complexity.
The ciphertext distribution is flat and matches plaintext size.
The method demonstrates high security in theoretical and experimental tests.
Abstract
Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period. However, many of them fundamentally were flawed by a lack of robustness and security. For getting higher security and higher complexity, in the current paper, we introduce a new kind of symmetric key block cipher algorithm that is based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two coupling parameters, as well as the increased complexity of the cryptosystem, make a contribution to the development of cryptosystem with higher security. In order to increase the security of the proposed algorithm, the size of key space and the computational complexity of the coupling parameters should be increased as well. Both the theoretical and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
