Audio scrambling method based on windmill transform

Through the audio scrambling method based on windmill transformation, the problem of insufficient security and efficiency of audio files in the network transmission process in the prior art is solved. The audio data dimensionality upgrade and chaotic sequence sorting generates scrambling audio, achieving high efficiency of audio files Encrypted and secure transmission.

CN114999504BActive Publication Date: 2024-11-26CHINA UNIV OF MINING & TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210513359.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-05-12
Publication Date
2024-11-26
Estimated Expiration
2042-05-12

AI Technical Summary

Technical Problem

Existing audio encryption technology has shortcomings in improving the security and efficiency of audio files during network transmission, and it is difficult to effectively protect audio information from being stolen.

Method used

The audio chaos method based on windmill transformation is adopted, and the audio data is dimensionalized, the chaotic sequence is generated, the center point is calculated and the scanning path is designed. The chaotic sequence is used for windmill transformation to scramble the audio files to generate scrambled audio.

Benefits of technology

It improves the encryption security and efficiency of audio files during network transmission, protects audio information from being stolen, and the experimental results show that the visual effect and degree of chaos are good.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114999504B_ABST
    Figure CN114999504B_ABST
Patent Text Reader

Abstract

At present, the activities of transmitting audio files and communicating with voice on the Internet are becoming more and more frequent. In order to protect the security of audio content, a windmill transform is designed and an audio scrambling method based on the windmill transform is proposed. First, the four center points of the original square matrix are calculated, and they are all regarded as the starting points of the windmill transform; secondly, four scanning paths are designed to traverse all the elements of the original square matrix; thirdly, the vectors generated by the four scanning paths are connected in the order of chaos generation to form a large vector, which is the transformation result. The windmill transform is used to realize the scrambling operation of the original audio. The experimental results show that the new method has achieved good results in terms of visual effects and scrambling degree.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to an audio scrambling method, which mainly performs scrambling on a single audio file. Background Art

[0002] In recent years, with the development of big data technology and the popularization of 5G, people are increasingly relying on mobile phones, the Internet and other tools for communication and exchange. At the same time, there are great risks in the network. Problems such as information leakage and malicious tampering are emerging in an endless stream, so information encryption technology is becoming more and more important. Among them, audio encryption uses the matrix characteristics of digital audio to scramble or diffuse according to specific transformation rules, making the original audio information "chaotic".

[0003] Audio encryption mainly includes two methods: phoneme scrambling and phoneme diffusion. The purpose of phoneme scrambling is to adjust the position of phonemes; the purpose of phoneme diffusion is to change the value of phonemes. In order to improve the security and efficiency of audio encryption and ensure the safe and efficient transmission of audio, an audio scrambling method based on windmill transformation is designed. This method uses windmill transformation to effectively protect the security of audio file network transmission and storage, lays the foundation for further audio encryption, and improves the security and efficiency of the scrambling process. Summary of the invention

[0004] The purpose of the present invention is to protect audio information from being stolen and to improve the security and efficiency of encryption during network transmission. An audio scrambling method based on windmill transformation is proposed.

[0005] Technical solution of the present invention: To achieve the above-mentioned purpose of the invention, the technical solution adopted is an audio scrambling method based on windmill transformation, and the scrambling steps are described in detail as follows:

[0006] Step 1: Upscaling audio data: Let the interactive audio file be F 1 , whose size is m ×1, m is the number of phonemes, 1 means the audio file is mono; F 1 Convert to a s × s The matrix F 2 ,in, s is a positive even number, m = s × s ;

[0007] Step 2: Generate chaotic sequence: Logistic mapping is:

[0008] x n+1 =rx n (1+ x n ), (1)

[0009] in, r ∈[3.57, 4) is the control parameter, x n ∈(0, 1); randomly selected r and initial value x 0, iterate formula (1) 4 times to get a chaotic sequence with a length of 4 K 1 ;

[0010] Step 3: Chaotic sequence sorting: Use formula (2) to sort K 1 To sort,

[0011] [ K 2 , H ] =sort ( k 1 ( i )), i= 1, 2, … , d , (2)

[0012] in, sort (•) is the ascending sort function, k 1 ( i )∈ K 1 , K 2 is the new sequence after sorting, H yes K 2 The index value of

[0013] Step 4: Calculate the 4 center points: a =0.5× s ,calculate F 2 The four center points are: A The coordinates of point 0 are: a , a +1), B The coordinates of point 0 are: a +1, a +1), C The coordinates of point 0 are: a +1, a ), D The coordinates of point 0 are: a , a), are regarded as the starting points of the windmill transformation;

[0014] Step 5: Design 4 scanning paths: Scanning path 1: A 0 is the starting point, and the order is right, down, left, and up. F 2 The phoneme values ​​in are scanned in the following order: a , a +1)→( a , a +2)→( a +1, a +2)→( a +2, a +2)→( a +3, a +2)→( a +3, a +1)→( a +3, a )→( a +3, a -1)→( a +3, a -2)→( a +3, a -3)→( a +2, a -3)→( a +1, a -3)→( a , a -3)→( a -1, a -3)→( a -2, a -3)→( a -3, a -3)→( a -4, a -3), ..., until scanning to F 2 The outermost phoneme value is saved in sequence to the vector L 1 In; The second scanning path: B 0 is the starting point, and the order is downward, left, upward, and right. F 2 The phoneme values ​​in are scanned in the following order: a +1, a +1)→( a +2, a +1)→( a +2, a )→( a +2,a -1)→( a +2, a -2)→( a +1, a -2)→( a , a -2)→( a -1, a -2)→( a -2, a -2)→( a -3, a -2)→( a -3, a -1)→( a -3, a )→( a -3, a +1)→( a -3, a +2)→( a -3, a +3)→( a -3, a +4)→( a -3, a +5), ..., until scanning to F 2 The outermost phoneme value is saved in sequence to the vector L 2 In; The third scanning path: C 0 is the starting point, and the order is left, up, right, and down. F 2 The phoneme values ​​in are scanned in the following order: a +1, a )→( a +1, a -1)→( a , a -1)→( a -1, a -1)→( a -2, a -1)→( a -2, a )→( a -2, a +1)→( a -2, a +2)→( a -2, a +3)→( a -2, a +4)→( a -1, a +4)→(a , a +4)→( a +1, a +4)→( a +2, a +4)→( a +3, a +4)→( a +4, a +4)→( a +5, a +4), ..., until scanning to F 2 The outermost phoneme value is saved in sequence to the vector L 3 In; the fourth scanning path: D 0 is the starting point, and the order is upward, right, down, and left. F 2 The phoneme values ​​in are scanned in the following order: a , a )→( a -1, a )→( a -1, a +1)→( a -1, a +2)→( a -1, a +3)→( a , a +3)→( a +1, a +3)→( a +2, a +3)→( a +3, a +3)→( a +4, a +3)→( a +4, a +2)→( a +4, a +1)→( a +4, a )→( a +4, a -1)→( a +4, a -2)→( a +4, a -3)→( a +4, a -4), ..., until scanning to F 2 The outermost phoneme value is saved in sequence to the vectorL 4 middle;

[0015] Step 6: Generate scrambled audio: Use windmill transform to F 2 All the phoneme values ​​in are scrambled; the specific operation is: using the sorting sequence generated by chaos, L 1 , L 2 , L 3 , L 4 According to formula (3),

[0016] F 3 = L H(1) , L H(2) , L H(3) , L H(1) , (3)

[0017] in, H ( i )∈ H , i =1, 2, 3, 4, connected to form a length of m Large vector F 3 , which is scrambled audio.

[0018] Furthermore, the method described in step 4 is characterized in that: the windmill transformation means: first, calculating the four center points of the original square matrix, all of which are regarded as the starting points of the windmill transformation; second, designing four scanning paths to traverse all elements of the original square matrix; third, connecting the vectors generated by the four scanning paths in the order of chaos generation to form a large vector, which is the transformation result; the windmill transformation is only applicable to the case of a square matrix with an even number of rows and columns.

[0019] In the audio decryption process, the inverse scrambling process is the reverse process of scrambling.

[0020] Beneficial effects: In order to protect audio information from being stolen and to improve the security and efficiency of encryption during network transmission, an audio scrambling method based on windmill transform is proposed. The main contributions are as follows: (1) Inspired by the windmill, a windmill transform is designed for audio scrambling; (2) Using the windmill transform, an audio scrambling method based on windmill transform is proposed to achieve the scrambling operation on the original audio; (3) Experimental results show that the audio scrambling method based on windmill transform of the present invention has achieved good results in terms of visual effects, scrambling degree, etc. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 : Audio scrambling flow chart;

[0022] Figure 2 : Time domain waveform of the original audio;

[0023] Figure 3 : Time domain waveform of scrambled audio. DETAILED DESCRIPTION

[0024] The implementation process of the present invention is further described in detail below with reference to specific drawings and examples.

[0025] Figure 1 This is the audio scrambling flow chart of this method.

[0026] The programming software used is Matlab R2016a. An audio file with a size of 72900×1 is selected as the original audio. The time domain waveform of the original audio is as follows: Figure 2 As shown; using this method, the detailed process of scrambling the original audio is described as follows.

[0027] Step 1: Upscaling audio data: Let the interactive audio file be F 1 , whose size is 72900×1, m is the number of phonemes, 1 means the audio file is mono; F 1 Convert to a 270×270 matrix F 2 .

[0028] Step 2: Generate a chaotic sequence: Iterate formula (1) 4 times to obtain a chaotic sequence with a length of 100. K 1 .

[0029] Step 3: Integerization of chaotic sequence: Use formula (2) to K 1 Sorting can get the new sequence after sorting K 2 ,as well as K 2 The index value of H .

[0030] Step 4: Calculate the 4 center points: a =135, calculate F 2 The four center points are: A The coordinates of point 0 are: (135, 136), B The coordinates of point 0 are: (136, 136),C The coordinates of point 0 are: (136, 135), D The coordinates of point 0 are: (135, 135), which are regarded as the starting point of the windmill transformation.

[0031] Step 5: Design 4 scanning paths: Scanning path 1: A 0 is the starting point, and the order is right, down, left, and up. F 2 The specific order is: (135, 136)→(135, 137)→(136, 137)→(137, 137)→(138, 137)→(138, 136)→(138, 135)→(138, 134)→(138, 133)→(138,132)→(137, 132)→(136, 132)→(135, 132)→(134, 132)→(133, 132)→(132, 132)→(131, 132), ..., until the phoneme value in the scan is scanned. F 2 The outermost phoneme value is saved in sequence to the vector L 1 In; The second scanning path: B 0 is the starting point, and the order is downward, left, upward, and right. F 2 The specific order is: (136, 136)→(137, 136)→(137, 135)→(137, 134)→(137, 133)→(136, 133)→(135, 133)→(134, 133)→(133, 133)→(132, 133)→(132, 134)→(132,135)→(132, 136)→(132, 137)→(132, 138)→(132, 139)→(132, 140), ..., until the phoneme value is scanned to F 2 The outermost phoneme value is saved in sequence to the vector L 2 In; The third scanning path: C 0 is the starting point, and the order is left, up, right, and down. F 2The specific order is: (136, 135)→(136, 134)→(135, 134)→(134, 134)→(133, 134)→(133, 135)→(133, 136)→(133,137)→(133, 138)→(133, 139)→(134, 139)→(135, 139)→(136, 139)→(137, 139)→(138, 139)→(139, 139)→(140, 139), ..., until the phoneme value in the scan is scanned. F 2 The outermost phoneme value is saved in sequence to the vector L 3 In; the fourth scanning path: D 0 is the starting point, and the order is upward, right, down, and left. F 2 The specific order is: (135, 135)→(134, 135)→(134, 136)→(134,137)→(134, 138)→(135, 138)→(136, 138)→(137, 138)→(138, 138)→(139, 138)→(139, 137)→(139, 136)→(139, 135)→(139, 134)→(139, 133)→(139, 132)→(139, 131), ..., until the phoneme value in the first line is scanned. F 2 The outermost phoneme value is saved in sequence to the vector L 4 middle.

[0032] Step 6: Generate scrambled audio: Use windmill transform to F 2 All the phoneme values ​​in are scrambled; the specific operation is: using the sorting sequence generated by chaos, L 1 , L 2 , L 3 , L 4 According to formula (3), they are connected to form a large vector F 3 , which is the scrambled audio, the time domain waveform of the scrambled audio, such as Figure 3 shown.

[0033] In the audio decryption process, the inverse scrambling process is the reverse process of scrambling.

Claims

1. An audio scrambling method based on windmill transformation, characterized in that: The scrambling process includes the following steps: Step 1: Upscaling audio data: Let the interactive audio file be F 1 , whose size is m ×1, m is the number of phonemes, 1 means the audio file is mono; Will F 1 Convert to a s × s The matrix F 2 ,in, s is a positive even number, m = s × s ; Step 2: Generate chaotic sequence: Logistic mapping is: x n+1 = rx n (1+ x n ), (1) in, r ∈[3.57, 4) is the control parameter, x n ∈(0, 1); randomly selected r and initial value x 0, iterate formula (1) 4 times to get a chaotic sequence with a length of 4 K 1 ; Step 3: Chaotic sequence sorting: Use formula (2) to sort K 1 To sort, [ K 2 , H ] =sort ( k 1 ( i )), i= 1, 2, … , d , (2) in, sort (•) is the ascending sort function, k 1 ( i )∈ K 1 , K 2 is the new sequence after sorting, H yes K 2 The index value of Step 4: Calculate the 4 center points: a =0.5× s ,calculate F 2 The four center points are: A The coordinates of point 0 are: a , a +1), B The coordinates of point 0 are: a +1, a +1), C The coordinates of point 0 are: a +1, a ), D The coordinates of point 0 are: a , a ), are regarded as the starting points of the windmill transformation; Step 5: Design 4 scanning paths: Scanning path 1: A 0 is the starting point, and the order is right, down, left, and up. F 2 The phoneme values ​​in are scanned in the following order: a , a +1)→( a , a +2)→( a +1, a +2)→( a +2, a +2)→( a +3, a +2)→( a +3, a +1)→( a +3, a )→( a +3, a -1)→( a +3, a -2)→( a +3, a -3)→( a +2, a -3)→( a +1, a -3)→( a , a -3)→( a -1, a -3)→( a -2, a -3)→( a -3, a -3)→( a -4, a -3), ..., until scanning to F 2 The outermost phoneme value is saved in sequence to the vector L 1 In; The second scanning path: B 0 is the starting point, and the order is downward, left, upward, and right. F 2 The phoneme values ​​in are scanned in the following order: a +1, a +1)→( a +2, a +1)→( a +2, a )→( a +2, a -1)→( a +2, a -2)→( a +1, a -2)→( a , a -2)→( a -1, a -2)→( a -2, a -2)→( a -3, a -2)→( a -3, a -1)→( a -3, a )→( a -3, a +1)→( a -3, a +2)→( a -3, a +3)→( a -3, a +4)→( a -3, a +5), ..., until scanning to F 2 The outermost phoneme value is saved in sequence to the vector L 2 In; The third scanning path: C 0 is the starting point, and the order is left, up, right, and down. F 2 The phoneme values ​​in are scanned in the following order: a +1, a )→( a +1, a -1)→( a , a -1)→( a -1, a -1)→( a -2, a -1)→( a -2, a )→( a -2, a +1)→( a -2, a +2)→( a -2, a +3)→( a -2, a +4)→( a -1, a +4)→( a , a +4)→( a +1, a +4)→( a +2, a +4)→( a +3, a +4)→( a +4, a +4)→( a +5, a +4), ..., until scanning to F 2 The outermost phoneme value is saved in sequence to the vector L 3 In; the fourth scanning path: D 0 is the starting point, and the order is upward, right, down, and left. F 2 The phoneme values ​​in are scanned in the following order: a , a )→( a -1, a )→( a -1, a +1)→( a -1, a +2)→( a -1, a +3)→( a , a +3)→( a +1, a +3)→( a +2, a +3)→( a +3, a +3)→( a +4, a +3)→( a +4, a +2)→( a +4, a +1)→( a +4, a )→( a +4, a -1)→( a +4, a -2)→( a +4, a -3)→( a +4, a -4), ..., until scanning to F 2 The outermost phoneme value is saved in sequence to the vector L 4 middle; Step 6: Generate scrambled audio: Use windmill transform to F 2 All the phoneme values ​​in are scrambled; the specific operation is: using the sorting sequence generated by chaos, L 1 , L 2 , L 3 , L 4 According to formula (3), F 3 = L H(1) , L H(2) , L H(3) , L H(1) , (3) in, H ( i )∈ H , i =1, 2, 3, 4, connected to form a length of m Large vector F 3 , which is scrambled audio.

2. The method according to claim 1, characterized in that: In step 4, the windmill transformation means: first, calculating the four center points of the original square matrix, all of which are regarded as the starting points of the windmill transformation; second, designing four scanning paths to traverse all elements of the original square matrix; third, connecting the vectors generated by the four scanning paths in the order of chaos generation to form a large vector, which is the transformation result; the windmill transformation is only applicable to the case of a square matrix with an even number of rows and columns.