Abstract
The expanding significance of securing data over the network has promoted growth of strong encryption algorithms. To enhance the information protection in network communications, this paper presents a Random permutation, chaotic mapping and pseudo random binary scrambling. It involves transforming the intelligible speech signal into an unintelligible form to protect it from interrupters. In this report, suggest a simple and secure procedure to secure the speech signal. The speech scrambling process makes use of two Permutations. In the first step, Random permutation algorithm is used to swap the rows of the original speech followed by swapping of rows using chaotic Bernoulli mapping. This produces an intermediary scrambled speech. In the second measure, pseudo random binary generator is used to make the final scrambled signal. Various analysis tests are then executed to determine the quality of the encrypted image. The test results determine the efficiency of the proposed speech scrambling process.
Highlights
A day’s transfer of information is essential for communication in everyday life.Today the vast sum of multimedia data such as video, text and image is exchanged over various networks
The early application of chaotic application sequences was to encrypt the text messages by using a key sequence which was generated by using a Bernoulli map
The proposed scheme is based on the combination of three permutations, random permutation(RP), chaotic Bernoulli mapping (CM) and pseudo random binary scrambling (PRBS)
Summary
A day’s transfer of information is essential for communication in everyday life. Today the vast sum of multimedia data such as video, text and image is exchanged over various networks. Many of the researchers are applied chaos sequences for encryption of the speech signals. The early application of chaotic application sequences was to encrypt the text messages by using a key sequence which was generated by using a Bernoulli map. Apart from the text messages, the Bernoulli map chaos functions are practiced to generate key sequences in encrypting the speech signals and images. The generated key sequences are applied for scrambling of speech signal. Let x represent a vector which contains speech, samples of length N and F represents the N*N Fast Fourier transform matrix [3,4,5]. The inverse transformation F-1is applying on v gives a scrambled speech signal y [5]: y= F-1. We extend a secure method to provide better quality of the speech signal
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 callMore From: APTIKOM Journal on Computer Science and Information Technologies
Disclaimer: 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.
