Audio encryption method based on DNA convolution
By using a DNA convolution-based audio encryption method combined with chaos theory, the shortcomings of existing audio encryption methods in terms of security and efficiency are addressed, achieving efficient and secure protection of audio information during network transmission.
Patent Information
- Application Number
- CN202210514672.9
- 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
Existing audio encryption methods are insufficient in terms of security and efficiency, making it difficult to effectively protect the security of audio information during network transmission and storage.
An audio encryption method based on DNA convolution, combined with chaos theory, is adopted to encrypt and decrypt audio files through steps such as phoneme integerization, DNA encoding, chaotic sequence generation and integerization, DNA convolution operation and decoding.
It improves the security and encryption efficiency of audio information during network transmission, ensuring the security and recoverability of audio files.
Smart Images

Figure CN114882893B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to an audio encryption method, which mainly performs encryption 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. 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 disrupt 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 encryption method based on DNA convolution is designed using chaos theory. This method combines chaos and multiple DNA operations to effectively protect the security of audio file network transmission and storage. Summary of the invention
[0004] The purpose of the present invention is to protect the security of audio information and improve the efficiency of encryption. An audio encryption method based on DNA convolution 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 encryption method based on DNA convolution, and the encryption steps are described in detail as follows:
[0006] Step 1: Phoneme integerization: Let the interactive audio file be R 1 , whose size is m ×1, m is the number of phonemes, 1 means the audio file is mono; R 1 The range of elements in is [-1, 1]. Add 1 to all elements to make it range [0, 2]. Then multiply by the specified coefficient. d , so that each phoneme value is available n An even number of bits is represented in binary, that is,
[0007] t i 1 =( r i 1 +1)× d , i =1, 2, …, m , (1)
[0008] in, r i 1 ∈ R 1 , T 1 ={ t i 1} is a length of m The phoneme integer vector of ;
[0009] Step 2: Phoneme Matrix DNA Coding: Randomly Select a DNA Coding Rule r 1∈{1, 2, …, 8}, for T 1 DNA encoding can be obtained with a size of m ×( n / 2) DNA matrix T 2 ; The DNA coding rules are:
[0010]
[0011] Step 3: Generate chaotic sequence: Logistic mapping is:
[0012] x n+1 = rx n (1+ x n ), (2)
[0013] in, r ∈[3.57, 4) is the control parameter, x n ∈(0, 1); randomly selected r and initial value x 0, iterate formula (2) l Second-rate, l =( k × s × s ) / 4, k = ceil ( m / j × n / 2 j ) is the number of base nuclei, ceil (•) is the ceiling function, s × s is the size of the convolution kernel, j is the step length of the selection box translation and satisfies j ≤ s, we can get a length of l Chaotic sequence L 1 ;
[0014] Step 4: Integerization of chaotic sequence: Use formula (2) to convert L 1 Integerization,
[0015] L 2 = floor ( mod ( L 1 ×10 16 , 256)), (3)
[0016] in, mod (•) represents the modulo operation, floor (•) is the floor function, L 2 For a length of l Integer chaotic sequence of ;
[0017] Step 5: Chaotic sequence DNA coding: randomly select a DNA coding rule r 2∈{1, 2, …, 8}, for L 2 DNA encoding can be obtained with a length of 4 l DNA sequence L 3 ;
[0018] Step 6: DNA Convolution Operation: Utilizing L 3 The bases per s × s constitute a DNA convolution kernel, which can be composed of k DNA convolution kernel B 1, B 2, …, B k ; The size of the selection box is s × s , select the box in T 2 Move up to make the selected content A i , i =1, 2, …, k , then the DNA convolution operation is defined as:
[0019] C i = A i * Bi , i =1, 2, …, k , (4)
[0020] in, C i is the encrypted result after DNA convolution operation, and * indicates different DNA operation rules; the specific operation rules are determined by the most numerous base type in the convolution kernel: when the most numerous base type in the convolution kernel is A, A i and B i Perform DNA XOR operation; when the largest number of base types in the convolution kernel is T, A i and B i Perform DNA XOR operation; when the largest number of base types in the convolution kernel is C, A i and B i Perform DNA addition operation; when the largest number of base types in the convolution kernel is G, A i and B i Perform DNA subtraction operation; when the type of base with the largest number in the convolution kernel cannot be determined, A i Perform complementary operation; select the box according to the step size j Traversal T 2 After all bases in the DNA convolution operation, the encrypted DNA matrix can be obtained. T 3 ; The DNA convolution operation rule is:
[0021] , (5)
[0022] Among them, the DNA XOR operation rule is:
[0023]
[0024] The DNA OR operation rules are:
[0025]
[0026] The DNA addition operation rules are:
[0027]
[0028] The DNA subtraction operation rules are:
[0029]
[0030] The DNA complementation algorithm is as follows:
[0031]
[0032] Step 7: DNA decoding: randomly select a DNA decoding rule r 3∈{1, 2, …, 8}, for T 3 DNA decoding can be performed to obtain a length of m The encryption vector T 4 ;
[0033] Step 8: Decimalization of phonemes: T 4 The elements in are divided by d , then subtract 1 to make its range become [-1, 1], that is,
[0034] q i =( t i 4 -1) / d , i =1, 2, …, m , (6)
[0035] in, t i 4 ∈ T 4 , Q ={ q i} is a length of m Encrypted audio.
[0036] During the decryption process, the encrypted audio is decrypted using the same chaotic sequence to restore the original audio. The decryption process is the inverse of the encryption process.
[0037] 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 encryption method based on DNA convolution is proposed. The main contributions are as follows: (1) DNA convolution is defined to organically combine DNA operations with audio encryption; (2) The randomness of chaos is used to generate DNA convolution kernels for operation; (3) Experimental results and algorithm analysis verify the feasibility and security of the proposed method. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 : Encryption flow chart;
[0039] Figure 2 : Time domain waveform of the original audio;
[0040] Figure 3 : Time domain waveform of encrypted audio. DETAILED DESCRIPTION
[0041] The implementation process of the present invention is further described in detail below with reference to specific drawings and examples.
[0042] Figure 1 It is the encryption flow chart of this method.
[0043] The programming software used is Matlab R2016a. An audio file with a size of 73120×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 encrypting the original audio is described as follows.
[0044] Step 1: Phoneme integerization: Let the interactive audio file be R 1 , its size is 73120×1, 73120 is the number of phonemes, 1 means the audio file is mono; R 1 The range of elements in is [-1, 1]. Add 1 to all elements to make it range [0, 2]. Multiply it by the specified coefficient 1000 so that each phoneme value can be represented by 16 even-digit binary bits. A phoneme integer vector with a length of 73120 is obtained. T 1 .
[0045] Step 2: Phoneme Matrix DNA Coding: Randomly Select a DNA Coding Rule r 1∈{1, 2, …, 8}, for T 1 DNA encoding can be performed to obtain a DNA matrix of size 73120×8 T 2 .
[0046] Step 3: Generate chaotic sequence: randomly select r and initial value x 0, iterate formula (2) 146240 times, and you can get a chaotic sequence with a length of 146240 L 1 .
[0047] Step 4: Integerization of chaotic sequence: Use formula (3) to convert L 1 Integerization can give an integer chaotic sequence with a length of 146240. L 2.
[0048] Step 5: Chaotic sequence DNA coding: randomly select a DNA coding rule r 2∈{1, 2, …, 8}, for L 2 DNA encoding can be performed to obtain a DNA sequence with a length of 584960 L 3 ;
[0049] Step 6: DNA Convolution Operation: Utilizing L 3 Each 8×8 bases in the convolution kernel form a DNA convolution kernel, which can form k DNA convolution kernel B 1, B 2, …, B k , k =9140; the size of the selection box is 8×8, and the selection box is I 2 Move up to make the selected content A i , i =1, 2, …, 9140, A i and B k Perform DNA convolution operation, C i The encrypted result obtained after DNA convolution operation is traversed in the selection box with a step length of 8 I 2 After all the bases in the DNA convolution operation, an encrypted DNA matrix of size 73120×8 can be obtained. T 3 .
[0050] Step 7: DNA decoding: randomly select a DNA decoding rule r 3∈{1, 2, …, 8}, for T 3 DNA decoding can be performed to obtain an encrypted vector with a length of 73120 T 4 ;
[0051] Step 8: Decimalization of phonemes: T 4 The elements in are divided by d , then subtract 1 to make its range [-1, 1], and we can get the encrypted audio Q , the time domain waveform of the encrypted audio, such as Figure 3 shown.
[0052] During the decryption process, the same chaotic sequence is used to encrypt the audio. Q The original audio can be restored by performing a decryption operation. The decryption process is the reverse process of the encryption process.
Claims
1. The audio encryption method based on DNA convolution is characterized in that: The encryption process includes the following steps: Step 1: Phoneme integerization: Let the interactive audio file be R 1 , whose size is m ×1, m is the number of phonemes, 1 means the audio file is mono; R 1 The range of elements in is [-1, 1]. Add 1 to all elements to make it range [0, 2]. Then multiply by the specified coefficient. d , so that each phoneme value is available n An even number of bits is represented in binary, that is, t i 1 =( r i 1 +1)× d , i =1, 2, …, m , (1) in, r i 1 ∈ R 1 , T 1 ={ t i 1 } is a length of m The phoneme integer vector of ; Step 2: Phoneme Matrix DNA Coding: Randomly Select a DNA Coding Rule r 1∈{1, 2, …, 8}, for T 1 DNA encoding can be obtained with a size of m ×( n / 2) DNA matrix T 2 ; The DNA coding rules are: Step 3: Generate chaotic sequence: Logistic mapping is: x n+1 = rx n (1+ x n ), (2) in, r ∈[3.57, 4) is the control parameter, x n ∈(0, 1); randomly selected r and initial value x 0, iterate formula (2) l Second-rate, l =( k × s × s ) / 4, k = ceil ( m / j × n / 2 j ) is the number of base nuclei, ceil (•) is the ceiling function, s × s is the size of the convolution kernel, j is the step length of the selection box translation and satisfies j ≤ s , we can get a length of l Chaotic sequence L 1 ; Step 4: Integerization of chaotic sequence: Use formula (2) to convert L 1 Integerization, L 2 = floor ( mod ( L 1 ×10 16 , 256)), (3) in, mod (•) represents the modulo operation, floor (•) is the floor function, L 2 For a length of l Integer chaotic sequence of ; Step 5: Chaotic sequence DNA coding: randomly select a DNA coding rule r 2∈{1, 2, …, 8}, for L 2 DNA encoding can be obtained with a length of 4 l DNA sequence L 3 ; Step 6: DNA Convolution Operation: Utilizing L 3 The bases per s × s constitute a DNA convolution kernel, which can be composed of k DNA convolution kernel B 1, B 2, …, B k ; The size of the selection box is s × s , select the box in T 2 Move up to make the selected content A i , i =1,2, …, k , then the DNA convolution operation is defined as: C i = A i * B i , i =1, 2, …, k , (4) in, C i is the encrypted result after DNA convolution operation, and * indicates different DNA operation rules; the specific operation rules are determined by the most numerous base type in the convolution kernel: when the most numerous base type in the convolution kernel is A, A i and B i Perform DNA XOR operation; when the largest number of base types in the convolution kernel is T, A i and B i Perform DNA XOR operation; when the largest number of base types in the convolution kernel is C, A i and B i Perform DNA addition operation; when the largest number of base types in the convolution kernel is G, A i and B i Perform DNA subtraction operation; when the type of base with the largest number in the convolution kernel cannot be determined, A i Perform complementary operation; select the box according to the step size j Traversal T 2 After all bases in the DNA convolution operation, the encrypted DNA matrix can be obtained. T 3 ; The DNA convolution operation rules are: ,(5) Among them, the DNA XOR operation rule is: The DNA OR operation rules are: The DNA addition operation rule is: The DNA subtraction operation rules are: The DNA complementation algorithm is as follows: Step 7: DNA decoding: randomly select a DNA decoding rule r 3∈{1, 2, …, 8}, for T 3 DNA decoding can be performed to obtain a length of m The encryption vector T 4 ; Step 8: Decimalization of phonemes: T 4 The elements in are divided by d , then subtract 1 to make its range become [-1, 1], that is, q i =( t i 4 -1) / d , i =1, 2, …, m , (6) in, t i 4 ∈ T 4 , Q ={ q i } is a length of m Encrypted audio.
Citation Information
Cited By
Audio data encryption method based on chaotic sequence and cosine mapping
CN120074792A
An Audio Data Encryption Method Based on Chaotic Sequences and Cosine Mapping
CN120074792B
