Abstract
Transferring multimedia files like audio is a common problem with information security. Therefore, various encryption technologies are needed to protect these contents. This paper proposes a new audio encryption scheme that provides a high degree of security. The novelty of this scheme is the use of chaotic systems and DNA coding to confuse and diffuse audio data. The initial value of the chaotic system is controlled by the hash value of the audio, making the chaotic trajectory unpredictable. Comparison experiments using different types of audio show that the algorithm works well and is secure enough to withstand many common attacks and can be recommended for multi-channel audio processing.
Highlights
The fast updating of mobile devices and multimedia technologies have increasingly high requirements on security technology
Because chaos has the characteristics of initial value sensitivity, no periodicity, pseudo-randomness, and ergodicity of chaotic sequences, chaotic systems are more effectively applied to practical applications [3]–[5]
Sheu proposed a speech encryption method based on fractional chaotic system [7]
Summary
The fast updating of mobile devices and multimedia technologies have increasingly high requirements on security technology. Combining with the advantages of DNA coding and chaos, this paper proposes an effective and secure audio encryption algorithm. An audio encryption based on DNA coding and chaotic system is proposed. The DNA matrix generated by dynamic coding is XORed with the key DNA matrix generated by the chaotic sequence to achieve diffusion, dynamic decoding to get encrypted audio. Su: Audio Encryption Algorithm Based on DNA Coding and Chaotic System. The SHA-256 algorithm can convert the information of the signal into a 256-bit hash value to obtain the required key K. Step 2: The five elements tj, bj, cj, dj and ej are randomly selected from the obtained sequences T , B, C, D and E to generate an initial value of the system used in the encryption process. Do the following for the j(1 ≤ j ≤ c) column of the matrix f3: If j is even number, it is cyclically shifted up by lj times; If j is odd number, it is cyclically shifted down by lj times; After all the columns are scrambled, a new matrix f4 is obtained and the scrambling process ends
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
