URUK 4D DISCRETE CHAOTIC MAP FOR SECURE COMMUNICATION APPLICATIONS
Ali Akram Abdul-Kareem, Waleed A. Mahmoud Al‐Jawher
Abstract
In this paper, URUK, a discrete four-dimensional chaotic map, is proposed for secure communication. The 0-1 tests, the Lyapunov Exponent (LE) tests, and the National Institute of Standard and Technology (NIST) tests, which are typically used to verify the randomness of bits, are employed to evaluate the dynamic behavior of the system based on a variety of criteria. Based on the results of tests demonstrating the system's characteristic chaotic and random behavior, it is reliable for use in covert communications and image encryption.
Topics & Concepts
NISTRandomnessChaoticLyapunov exponentEncryptionSecure communicationCovertComputer scienceRandomness testsAlgorithmCHAOS (operating system)Tent mapCryptographyCommunications systemTheoretical computer scienceMathematicsArtificial intelligenceComputer securityStatisticsTelecommunicationsSpeech recognitionLinguisticsPhilosophyChaos-based Image/Signal Encryption