Applying and Comparison of Chaotic-Based Permutation Algorithms for Audio Encryption

This research presents, and clarifies the application of two permutation algorithms, based on chaotic map systems, applied to a file speech signals. They are Arnold cat map-based algorithm, Baker’s algorithm. Both algorithms implemented same signal sample. Then, both premier encrypted histograms documented plotted. The amplitude values with time signals original recorded plotted against decrypted files. Furthermore, is file, using spectrogram frequencies duration. These used shuffle positions files signals’ without any changes, produce an file. A comparative analysis introduced by some sundry statistical experimental analyses for procedures encryption decryption, e.g., procedures, audio histogram, correlation coefficient between specimens in signals, test Spectral Distortion (SD), Log-Likelihood Ratio (LLR) measures. outcomes different studies demonstrate that (Baker Arnold) sufficient providing efficient reliable voice solution. However, Arnold’s algorithm gives better results most cases as compared