CN115664630A - Network security communication method - Google Patents
Network security communication method Download PDFInfo
- Publication number
- CN115664630A CN115664630A CN202211277839.0A CN202211277839A CN115664630A CN 115664630 A CN115664630 A CN 115664630A CN 202211277839 A CN202211277839 A CN 202211277839A CN 115664630 A CN115664630 A CN 115664630A
- Authority
- CN
- China
- Prior art keywords
- matrix
- chaotic
- data
- unstructured data
- sequence
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000004891 communication Methods 0.000 title claims abstract description 33
- 238000000034 method Methods 0.000 title claims abstract description 33
- 239000011159 matrix material Substances 0.000 claims abstract description 181
- 230000000739 chaotic effect Effects 0.000 claims abstract description 142
- 230000002441 reversible effect Effects 0.000 claims abstract description 84
- 238000000638 solvent extraction Methods 0.000 claims abstract description 16
- 230000003044 adaptive effect Effects 0.000 claims description 11
- 238000013507 mapping Methods 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 230000008030 elimination Effects 0.000 claims description 2
- 238000003379 elimination reaction Methods 0.000 claims description 2
- 230000009467 reduction Effects 0.000 description 7
- 230000000903 blocking effect Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 241001391944 Commicarpus scandens Species 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Landscapes
- Storage Device Security (AREA)
Abstract
The invention relates to the technical field of computer network security, in particular to a network security communication method, which comprises the following steps: acquiring encoded data; converting the encoded data into unstructured data; scrambling unstructured data by using the chaotic sequence; partitioning the scrambled unstructured data; constructing a chaotic data matrix, and partitioning the chaotic data matrix to obtain chaotic sub-blocks; obtaining a first basic second-order reversible matrix and a second basic second-order reversible matrix of the chaotic sub-block by using the median number and the mean number of the chaotic sub-block, and further obtaining a self-adaptive fourth-order reversible matrix of the chaotic sub-block; obtaining an encryption matrix of the scrambled unstructured data block by using the character number matrix of the scrambled unstructured data block and the self-adaptive four-order reversible matrix of the chaotic subblock; and encrypting the data by using the encryption matrix of the scrambled unstructured data block to obtain encrypted communication data. The method is used for encrypting the communication data, and can improve the safety of the data.
Description
Technical Field
The invention relates to the technical field of computer network security, in particular to a network security communication method.
Background
With the rapid development of computers and information technologies, data information has become the most critical resource of the whole society, and enterprises and public institutions need to share and access more and more data information and are more and more important. Therefore, how to ensure the information security of the private data during network sharing has become a major issue to be urgently solved.
At present, a data encryption method is mainly adopted to ensure the information security of private data during network sharing. In a traditional encryption algorithm such as asymmetric encryption, a pair of keys of a public key and a private key needs to be generated, and user information is authenticated and verified through a third party, so that the effect of data encryption is achieved, but a third party organization is not credible, and the problem of key leakage is easily caused; in the traditional scrambling encryption, a scrambling rule is obtained to perform scrambling operation on data, but the one-dimensional data relevance is weak, and meanwhile, only the position of the data is changed, so that an attacker can very easily break an encrypted ciphertext through the relationship among certain data points, and meanwhile, the scrambling encryption cannot resist plaintext attack. Therefore, a method for improving information security of private data during network sharing is needed.
Disclosure of Invention
The invention provides a network security communication method, which aims to solve the problem of low information security of the existing private data during network sharing.
The invention provides a network security communication method, which comprises the following steps: acquiring encoded data; converting the encoded data into unstructured data; scrambling unstructured data by using the chaotic sequence; partitioning the scrambled unstructured data; constructing a chaotic data matrix, and partitioning the chaotic data matrix to obtain chaotic sub-blocks; obtaining a first basic second-order reversible matrix and a second basic second-order reversible matrix of the chaotic subblock by using the median number and the mean number of the chaotic subblock, and further obtaining an adaptive fourth-order reversible matrix of the chaotic subblock; obtaining an encryption matrix of the scrambled unstructured data block by using the character number matrix of the scrambled unstructured data block and the self-adaptive four-order reversible matrix of the chaotic subblock; compared with the prior art, the method comprises the steps of firstly constructing the unstructured data, then scrambling the unstructured data, and carrying out matrix operation on the scrambled unstructured data to obtain the encrypted ciphertext and generate the encrypted key. The invention can reduce the time complexity of the algorithm and simultaneously improve the information security of the private data during network sharing.
In order to achieve the above object, the present invention adopts the following technical solution, and a network security communication method includes:
acquiring coded data to be communicated;
arranging the coded data to be communicated to form a square matrix, and taking the data in the square matrix as unstructured data;
obtaining a chaotic sequence by using Logistic mapping, scrambling unstructured data by using the chaotic sequence to obtain scrambled unstructured data;
blocking the scrambled unstructured data to obtain scrambled unstructured data blocks;
constructing a chaotic data matrix according to the chaotic sequence, and partitioning the chaotic data matrix in a manner of partitioning the scrambled unstructured data to obtain chaotic sub-blocks;
acquiring a median number and a mean number of the chaotic sub-block, and acquiring a first basic second-order reversible matrix and a second basic second-order reversible matrix of the chaotic sub-block by using the median number and the mean number of the chaotic sub-block;
performing matrix tensor product operation on a first basic second-order reversible matrix and a second basic second-order reversible matrix of the chaotic subblock to obtain a self-adaptive fourth-order reversible matrix of the chaotic subblock;
calculating to obtain encryption matrixes of all scrambled unstructured data blocks by utilizing a character number matrix of the scrambled unstructured data blocks and an adaptive fourth-order reversible matrix of chaotic subblocks corresponding to the unstructured data blocks;
and encrypting the data to be communicated by using the encryption matrixes of all the scrambled unstructured data blocks to obtain the encrypted communication data.
Further, in the network security communication method, the coded data to be communicated is obtained as follows:
acquiring data to be communicated, and coding the acquired data to be communicated according to the following modes:
the corresponding codes of the numbers 0-9 in the data to be communicated are 0-9, the corresponding codes of the lower case letters a-Z are 10-35, the corresponding codes of the upper case letters A-Z are 36-61, and the corresponding codes of the special character #, and the blank space are 62 and 63.
Further, in the network security communication method, the unstructured data is obtained as follows:
acquiring the quantity of the encoded data, and setting the size of a square matrix according to the quantity of the encoded data, wherein the size of the square matrix is a multiple of 4;
filling the coded data into the square matrix in sequence, if the square matrix is not completely filled after the coded data are completely filled, filling the data with 0 until the square matrix is completely filled, acquiring the square matrix with the size of a multiple of 4, and taking the data in the square matrix with the size of the multiple of 4 as unstructured data.
Further, in the network security communication method, the chaotic sequence is obtained as follows:
acquiring the quantity of the unstructured data to be M multiplied by N;
generating a chaotic sequence with an interval range of [0,1] by using Logistic mapping;
multiplying each number of the chaotic sequences with the interval range of [0,1] by MxN, and rounding down to obtain the chaotic sequence with the interval range of [0, (MxN) ].
Further, in the network security communication method, the scrambled unstructured data is obtained as follows:
numbering the positions of the unstructured data to obtain the position numbers of the unstructured data;
enclosing the unstructured data into a circle according to the sequence of position numbers to obtain an unstructured data sequence before scrambling;
acquiring a position number corresponding to a first number in a chaotic sequence with an interval range of [0, (M multiplied by N) ], taking unstructured data corresponding to the position number as first-position unstructured data in the unstructured data sequence after scrambling, and removing the unstructured data corresponding to the position number from the unstructured data sequence before scrambling to obtain the unstructured data sequence before scrambling after first removal;
acquiring a position number corresponding to a second number in a chaotic sequence with an interval range of [0, (M multiplied by N) ], taking unstructured data corresponding to the position number as second-position unstructured data in the unstructured data sequence after scrambling, and removing the unstructured data corresponding to the position number from the unstructured data sequence before scrambling after first removal to obtain an unstructured data sequence before scrambling after second removal;
and scrambling each unstructured data in the unstructured data sequence before scrambling after the second elimination until all the unstructured data are scrambled, and obtaining the scrambled unstructured data.
Further, in the network security communication method, the chaotic sub-block is obtained as follows:
blocking the scrambled unstructured data to obtain all unstructured data blocks with the size of 4 multiplied by 4;
acquiring an initial parameter m, and generating a plurality of second-order reversible matrixes according to the initial parameter m;
sequencing all second-order reversible matrixes to obtain a second-order reversible matrix sequence;
arranging the chaotic sequences with the interval range of [0, (M multiplied by N) ] according to the generated sequence to obtain a chaotic data matrix with the same size as the scrambled unstructured data;
and partitioning the chaotic data matrix according to a block partitioning mode of the scrambled unstructured data to obtain all chaotic sub-blocks.
Further, in the network security communication method, the adaptive fourth-order invertible matrix of the chaotic sub-block is obtained as follows:
sequencing data in each chaotic sub-block to obtain the median of the chaotic sub-blocks;
numbering the positions of the second-order reversible matrixes in the second-order reversible matrix sequence to obtain the position numbers of the second-order reversible matrixes in the second-order reversible matrix sequence;
acquiring a position number corresponding to the median number of the chaotic sub-block, and taking a second-order reversible matrix in a second-order reversible matrix sequence corresponding to the position number as a first basic second-order reversible matrix of the chaotic sub-block;
calculating the mean value of the data in each chaotic sub-block to obtain the mean value number of the chaotic sub-blocks;
acquiring a position number corresponding to the mean value of the chaotic sub-block, and taking a second order reversible matrix in a second order reversible matrix sequence corresponding to the position number as a second basic second order reversible matrix of the chaotic sub-block;
and carrying out matrix tensor product operation on the first basic second-order reversible matrix and the second basic second-order reversible matrix of the chaotic subblock to obtain the self-adaptive fourth-order reversible matrix of the chaotic subblock.
Further, in the network security communication method, the encryption matrix of all scrambled unstructured data blocks is obtained as follows:
acquiring a character number matrix of the scrambled unstructured data block with the size of 4 multiplied by 4;
calculating to obtain an encryption matrix of the scrambled unstructured data block with the size of 4 multiplied by 4 by utilizing a character number matrix of the scrambled unstructured data block with the size of 4 multiplied by 4 and an adaptive four-order reversible matrix of a chaotic sub-block corresponding to the unstructured data block;
the encryption matrix for all 4 x 4 sized scrambled unstructured data blocks is obtained as described above.
The beneficial effects of the invention are: the method comprises the steps of firstly constructing unstructured data, then scrambling the unstructured data, and carrying out matrix operation on the scrambled unstructured data to obtain an encrypted ciphertext and generate an encrypted key. The invention can reduce the time complexity of the algorithm and simultaneously improve the information security of the private data during network sharing.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic flow chart of a network security communication method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of unstructured data according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Examples
An embodiment of a network security communication method according to the present invention, as shown in fig. 1, includes:
and S101, acquiring the coded data to be communicated.
In this embodiment, data to be communicated is first acquired. The types of network communication data are various, that is, the communication data includes numbers, english letters and special characters, in order to enhance the robustness of the encryption system and make it possible to process different types of communication data, so the numbers, english letters and special characters are encoded, and all the communication data are converted into numbers, that is: the numbers 0-9 correspond to the numbers 0-9, the lower case letters a-Z correspond to the numbers 10-35, the upper case letters a-Z correspond to the numbers 36-61, and the special character #, and the blank space correspond to the numbers 62, 63.
In addition, since time series data is generally one-dimensional data, and a character associated with a certain character in the series is only associated with characters adjacent to the left and right of the character, that is, the data is not strongly associated with each other, the one-dimensional series data is constructed as unstructured data in order to increase the data association and the security of encrypted ciphertext data. Scrambling is carried out on the unstructured data by constructing a chaotic sequence, and meanwhile matrix operation is carried out on the unstructured data to generate an encrypted ciphertext and a key. The traditional matrix encryption adopts a single encryption matrix to encrypt data, and because the matrix is single, an encryption ciphertext is easy to break, namely the security is low, meanwhile, the single matrix encryption has high selection requirement on the matrix, when the matrix is inappropriately selected, the privacy degree of the obtained encryption ciphertext is low, and the risk of exposing partial data plaintext exists, so that in order to enhance the security and the privacy of an encryption system, the encryption ciphertext is generated through scrambling and random matrix generation, and the security and the privacy of the data are enhanced.
S102, arranging the coded data to be communicated, enabling the coded data to be communicated to form a square matrix, and taking data in the square matrix as unstructured data.
Acquiring the quantity of the encoded data: in this embodiment, after the encoded data to be communicated is obtained, each character corresponds to a number, and the number of the encoded data is obtained.
Setting the size of a square matrix according to the quantity of the encoded data, wherein the size of the square matrix is a multiple of 4: converting the one-dimensional time sequence data to obtain unstructured data, and subsequently processing the unstructured data by adopting a four-order matrix, so that each subsequent character can be divided into the four-order matrix when the unstructured data is converted, and the size of the unstructured data conversion is as follows:
M×N＝(4c*4d)
where M × N represents the number of unstructured data, and c and d represent the number of matrices per row and column.
And arranging the coded data in sequence, filling the coded data into the square matrixes in sequence, filling the coded data with data 0 if the square matrixes are not completely filled after the coded data are completely filled, obtaining the square matrixes with the multiples of 4 until the square matrixes are completely filled, and taking the data in the square matrixes with the multiples of 4 as unstructured data. As shown in fig. 2, M × N =8 × 8= (4 × 2) × (4 × 2), and if the transmission data is insufficient to form a square matrix of the size 4c × 4d, 0-complementing operation is performed to complement the data to 0, and then the square matrix of the size 4c × 4d is formed.
And S103, obtaining a chaotic sequence by using Logistic mapping, and scrambling unstructured data by using the chaotic sequence to obtain scrambled unstructured data.
1. Generating a chaotic sequence: the Logistic mapping is a typical chaotic mapping, and the model is as follows:
x n-1 ＝μx n (1-x n )
where μ is a controllable parameter, x n Represents the nth number in the chaotic sequence. When the coefficient is 3.57<When mu is less than or equal to 4, the system enters a chaotic state to generate [0,1]]The Logistic chaotic mapping model is iterated (M multiplied by N) -1+ p times. In order to prevent the chaos sequence from having high similarity with the original sequence, the first p items of the chaos sequence are removed. The chaos sequence obtained at this time is [0,1]]The chaotic sequence in between, which is projected into the interval applicable to unstructured data, namely: multiplying each number of the obtained chaotic sequences by MxN and rounding downwards to obtain an interval range of [0, (MxN)]Of the chaotic sequence of (a).
2. Data scrambling: the method comprises the steps of numbering unstructured data, namely numbering the unstructured data, namely the position number of the original data, scrambling the unstructured data through a chaotic sequence, wherein the chaotic sequence contains the same number, for example, the chaotic sequence is 3, 1, 3, 2 and 3, at the moment, if the chaotic sequence and the number are in one-to-one correspondence, one-to-many situations exist, in order to prevent the one-to-many situations, the numbered data are surrounded into a circle, the data corresponding to the numbering position corresponding to the first number in the chaotic sequence are placed at the first position, the scrambled data are removed, the remaining numbered data are surrounded into a circle, the data corresponding to the numbering position corresponding to the second number in the chaotic sequence are placed at the second position, and the operations are repeated until all the numbered data are scrambled.
For example: the numbered data sequence is: 4. 24, 2, 42, 44, the chaotic sequence is: 3. 1, 3, 2, and 3, if the first number of the chaotic sequences is 3, the 3 rd number in the numbered data sequences is placed at the first position, and at this time, the numbered data sequences become: 4. 24, 42, 44, the scrambled sequence being: 2. -, -; continuing scrambling, if the second number of the chaotic sequences is 1, placing the 1 st number in the numbered data sequences at the second position of the scrambled sequences, and at this time, changing the numbered data sequences into: 24. 42 and 44, the scrambled sequence is as follows: 2. 4, -; continuing the above operation, the final scrambled sequence is: 2. 4, 44, 42, 24. The same principle is applied to reduction. The first number of the chaotic sequence is 3, and the first bit data of the sequence after final scrambling is placed at the third bit of the reduction sequence: and-, 2, -, the second number of the chaotic sequence is 1, and the second bit data of the finally scrambled sequence is placed at the 1 st bit of the left vacant position of the reduction sequence: 4. -, 2, -, continuing the above operation, a reduced sequence will be obtained.
And S104, partitioning the scrambled unstructured data to obtain scrambled unstructured data blocks.
The unstructured data is scrambled through the above operation, but only the position of the character number is changed by the scrambling operation, and the scrambling operation is performed by generating a pseudo random number, and the encryption effect after scrambling cannot be quantized, that is, there is a problem that the similarity between the encrypted unstructured data and the original unstructured data is high, which causes the privacy of data encryption to be poor, so the unstructured data is partitioned on the basis of the above operation to obtain c × d unstructured data blocks with the size of 4 × 4, and the character number matrix of the unstructured data blocks with the size of 4 × 4 is denoted as W.
It should be noted that: the character number matrix is a matrix formed by data in each unstructured data block.
And S105, constructing a chaotic data matrix according to the chaotic sequence, and blocking the chaotic data matrix in a blocking mode of the scrambled unstructured data to obtain chaotic sub-blocks.
And arranging the chaotic sequences according to the generation sequence to obtain a chaotic data matrix with the same size as the unstructured data, wherein each character of the unstructured data corresponds to a chaotic sequence number, and a plurality of chaotic sub-blocks are obtained by partitioning the unstructured data.
It should be noted that: because the encryption secrecy performance of a single matrix is poor, the single matrix is easy to break through, so that data leakage is caused, meanwhile, the encryption effect of the single matrix is influenced by the selected reversible matrix, and if the selected matrix is not appropriate, the encryption effect is poor, so that the unstructured data matrix is expected to be encrypted by adopting different self-adaptive fourth-order reversible matrices, and the safety of the unstructured data matrix is greatly improved.
S106, obtaining the median number and the mean number of the chaotic sub-blocks, and obtaining a first basic second-order reversible matrix and a second basic second-order reversible matrix of the chaotic sub-blocks by using the median number and the mean number of the chaotic sub-blocks.
Sorting the numbers in the chaotic subblocks and rounding downwards to obtain a median value to obtain a chaotic median value number; numbering the positions of the second-order reversible matrixes in the second-order reversible matrix sequence to obtain the position numbers of the second-order reversible matrixes in the second-order reversible matrix sequence; subjecting a second order reversible matrix sequence L = (A) 1 ,A 2 ,A 3 …A y ) Enclosing into a circle, acquiring a position number corresponding to the median number of the chaotic subblock, and taking a second-order reversible matrix in a second-order reversible matrix sequence corresponding to the position number as a first basic second-order reversible matrix of the chaotic subblock; and (3) calculating the mean value of the chaos numbers in the chaos sub-blocks in the same way to obtain a second basic second-order reversible matrix, namely:
wherein Y represents the mean value of the chaos numbers in the chaos sub-block,
denotes rounding down, x i Representing the ith chaotic number in the chaotic sub-block.
And S107, performing matrix tensor product operation on the first basic second-order reversible matrix and the second basic second-order reversible matrix of the chaotic sub-block to obtain a self-adaptive fourth-order reversible matrix of the chaotic sub-block.
And carrying out matrix tensor product operation on the first basic second-order reversible matrix and the second basic second-order reversible matrix to obtain a self-adaptive fourth-order reversible matrix, and recording the self-adaptive fourth-order reversible matrix as V.
It should be noted that: the acquisition process of the second order invertible matrix is as follows: according to the theorem of the matrix, obtaining an initial parameter m, wherein m is a positive integer, then generating a plurality of second-order reversible matrixes, and sequencing the generated second-order reversible matrixes to obtain a second-order reversible matrix sequence, which is marked as L = (A) 1 ,A 2 ,A 3 …A y ) Wherein A is y Representing the y-th second order invertible matrix of the generated second order invertible matrices.
The fourth order matrix operation rule is as follows: it is known that the tensor product operation of two second-order matrices will result in a fourth-order matrix, such as a matrix
Matrix array
Then:
at this time, an adaptive fourth order invertible matrix can be obtained through the two second order invertible matrices.
And S108, calculating to obtain encryption matrixes of all scrambled unstructured data blocks by using the character number matrix of the scrambled unstructured data blocks and the fourth-order invertible matrix of the chaotic subblocks corresponding to the unstructured data blocks.
At this time, matrix operation is performed on the data according to the character number matrix and the adaptive fourth-order reversible matrix of the unstructured data blocks with different sizes of 4 × 4 to obtain an encrypted ciphertext, namely:
Z j ＝V j *W j
in the formula, Z j Representing the encrypted encryption matrix of the jth matrix operation, i.e. the encrypted ciphertext sub-block, V j Represents the adaptive fourth order invertible matrix, W, corresponding to the j-th chaotic sub-block j Indicating the character number moment of the jth unstructured data block of size 4 x 4And (5) arraying.
S109, encrypting the data to be communicated by using the encryption matrixes of all the scrambled unstructured data blocks to obtain encrypted communication data.
And performing the operation on all the subblocks to obtain a final encrypted ciphertext.
It should be noted that, the process of decrypting the encrypted ciphertext is as follows: the secret key is the chaos parameters mu and x 0 P, m. By chaotic parameters mu, x 0 Generating a chaotic sequence by the p value, constructing a chaotic data matrix through the chaotic sequence and obtaining chaotic sub-blocks, and obtaining a second-order reversible matrix sequence L = (A) through m 1 ,A 2 ,A 3 …A y ) Obtaining a first basic second-order reversible matrix and a second basic second-order reversible matrix through chaotic subblock calculation, obtaining a self-adaptive fourth-order reversible matrix V according to the two second-order reversible matrices, and performing inverse operation through encrypting the ciphertext subblock and the self-adaptive fourth-order reversible matrix V, namely:
in the formula, W j Character number matrix, Z, representing the jth unstructured data block of size 4 x 4 j Representing the encrypted encryption matrix of the jth matrix operation,
a transpose matrix of the adaptive fourth order invertible matrix corresponding to the j-th chaotic sub-block,
the upper superscript T of (a) denotes the transpose matrix.
And at the moment, restoring to obtain a scrambled unstructured data matrix, and restoring the position of data in the unstructured data matrix through the obtained chaotic sequence to obtain original data.
The reduction rule is as follows: for example: the numbered data sequence is: 4. 24, 2, 42, 44, the chaotic sequence is: 3. 1, 3, 2, and 3, if the first number of the chaotic sequences is 3, the 3 rd number in the numbered data sequences is placed at the first position, and at this time, the numbered data sequences become: 4. 24, 42, 44, the scrambled sequence is: 2. -, -; continuing scrambling, if the second number of the chaotic sequences is 1, placing the 1 st number in the numbered data sequences at the second position of the scrambled sequences, and at this time, changing the numbered data sequences into: 24. 42 and 44, the scrambled sequence is as follows: 2. 4, -; continuing the above operation, the final scrambled sequence is: 2. 4, 44, 42, 24. The same principle is applied to reduction. The first number of the chaotic sequence is 3, and the first bit data of the sequence after final scrambling is placed at the third bit of the reduction sequence: and-, 2, -, the second number of the chaotic sequence is 1, and the second bit data of the finally scrambled sequence is placed at the 1 st bit of the left vacant position of the reduction sequence: 4. -, 2, -, continuing the above operation, a reduced sequence will be obtained.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (8)
1. A method for network secure communication, comprising:
acquiring coded data to be communicated;
arranging the coded data to be communicated to form a square matrix, and taking the data in the square matrix as unstructured data;
obtaining a chaotic sequence by using Logistic mapping, scrambling unstructured data by using the chaotic sequence to obtain scrambled unstructured data;
partitioning the scrambled unstructured data to obtain scrambled unstructured data blocks;
constructing a chaotic data matrix according to the chaotic sequence, and partitioning the chaotic data matrix in a manner of partitioning the scrambled unstructured data to obtain chaotic sub-blocks;
acquiring a median number and an average number of the chaotic sub-blocks, and acquiring a first basic second-order reversible matrix and a second basic second-order reversible matrix of the chaotic sub-blocks by using the median number and the average number of the chaotic sub-blocks;
performing matrix tensor product operation on a first basic second-order reversible matrix and a second basic second-order reversible matrix of the chaotic subblock to obtain a self-adaptive fourth-order reversible matrix of the chaotic subblock;
calculating to obtain encryption matrixes of all scrambled unstructured data blocks by utilizing the character number matrix of the scrambled unstructured data blocks and the adaptive four-order reversible matrix of the chaotic subblocks corresponding to the unstructured data blocks;
and encrypting the data to be communicated by utilizing the encryption matrixes of all the scrambled unstructured data blocks to obtain encrypted communication data.
2. The network security communication method according to claim 1, wherein the encoded data to be communicated is obtained as follows:
acquiring data to be communicated, and coding the acquired data to be communicated according to the following modes:
the corresponding codes of the numbers 0-9 in the data to be communicated are 0-9, the corresponding codes of the lower case letters a-Z are 10-35, the corresponding codes of the upper case letters A-Z are 36-61, and the corresponding codes of the special character #, and the blank space are 62 and 63.
3. The network security communication method of claim 1, wherein the unstructured data is obtained as follows:
acquiring the quantity of the coded data, and setting the size of a square matrix according to the quantity of the coded data, wherein the size of the square matrix is a multiple of 4;
filling the coded data into the square matrix in sequence, if the square matrix is not completely filled after the coded data are completely filled, filling the data with 0 until the square matrix is completely filled, acquiring the square matrix with the size of a multiple of 4, and taking the data in the square matrix with the size of the multiple of 4 as unstructured data.
4. The network security communication method according to claim 1, wherein the chaotic sequence is obtained as follows:
acquiring the quantity of unstructured data to be M multiplied by N;
generating a chaotic sequence with an interval range of [0,1] by using Logistic mapping;
multiplying each number of the chaotic sequences with the interval range of [0,1] by MxN, and rounding down to obtain the chaotic sequence with the interval range of [0, (MxN) ].
5. The network security communication method of claim 4, wherein the scrambled unstructured data is obtained as follows:
numbering the positions of the unstructured data to obtain the position numbers of the unstructured data;
enclosing the unstructured data into a circle according to the sequence of position numbers to obtain an unstructured data sequence before scrambling;
acquiring a position number corresponding to a first number in a chaotic sequence with an interval range of [0, (M multiplied by N) ], taking unstructured data corresponding to the position number as first-position unstructured data in the unstructured data sequence after scrambling, and removing the unstructured data corresponding to the position number from the unstructured data sequence before scrambling to obtain the unstructured data sequence before scrambling after first removal;
acquiring a position number corresponding to a second number in a chaotic sequence with an interval range of [0, (M multiplied by N) ], taking unstructured data corresponding to the position number as second-position unstructured data in the unstructured data sequence after scrambling, and removing the unstructured data corresponding to the position number from the unstructured data sequence before scrambling after first removal to obtain an unstructured data sequence before scrambling after second removal;
and scrambling each unstructured data in the unstructured data sequence before scrambling after the second elimination according to the above mode until all unstructured data are scrambled, and obtaining scrambled unstructured data.
6. The network security communication method of claim 1, wherein the chaotic sub-block is obtained as follows:
partitioning the scrambled unstructured data to obtain all unstructured data blocks with the size of 4 multiplied by 4;
acquiring an initial parameter m, and generating a plurality of second-order reversible matrixes according to the initial parameter m;
sequencing all second-order reversible matrixes to obtain a second-order reversible matrix sequence;
arranging the chaotic sequences with the interval range of [0, (M multiplied by N) ] according to the generated sequence to obtain a chaotic data matrix with the same size as the scrambled unstructured data;
and partitioning the chaotic data matrix according to a block partitioning mode of the scrambled unstructured data to obtain all chaotic sub-blocks.
7. The network security communication method according to claim 1, wherein the adaptive fourth-order invertible matrix of the chaotic sub-block is obtained as follows:
sequencing data in each chaotic sub-block to obtain a median of the chaotic sub-blocks;
numbering the positions of the second-order reversible matrix in the second-order reversible matrix sequence to obtain the position number of the second-order reversible matrix in the second-order reversible matrix sequence;
acquiring a position number corresponding to the median number of the chaotic sub-block, and taking a second-order reversible matrix in a second-order reversible matrix sequence corresponding to the position number as a first basic second-order reversible matrix of the chaotic sub-block;
calculating the mean value of the data in each chaotic sub-block to obtain the mean value number of the chaotic sub-blocks;
acquiring a position number corresponding to the mean value number of the chaotic subblock, and taking a second-order reversible matrix in a second-order reversible matrix sequence corresponding to the position number as a second basic second-order reversible matrix of the chaotic subblock;
and carrying out matrix tensor product operation on the first basic second-order reversible matrix and the second basic second-order reversible matrix of the chaotic subblock to obtain the self-adaptive fourth-order reversible matrix of the chaotic subblock.
8. The network security communication method of claim 1, wherein the encryption matrix of all scrambled unstructured data blocks is obtained as follows:
acquiring a character number matrix of the scrambled unstructured data block with the size of 4 multiplied by 4;
calculating to obtain an encryption matrix of the scrambled unstructured data block with the size of 4 multiplied by 4 by utilizing a character number matrix of the scrambled unstructured data block with the size of 4 multiplied by 4 and an adaptive four-order reversible matrix of a chaotic sub-block corresponding to the unstructured data block;
the encryption matrix of all 4 x 4 sized scrambled unstructured data blocks is obtained as described above.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211277839.0A CN115664630A (en) | 2022-10-19 | 2022-10-19 | Network security communication method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211277839.0A CN115664630A (en) | 2022-10-19 | 2022-10-19 | Network security communication method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115664630A true CN115664630A (en) | 2023-01-31 |
Family
ID=84990308
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211277839.0A Pending CN115664630A (en) | 2022-10-19 | 2022-10-19 | Network security communication method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115664630A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115834023A (en) * | 2023-02-21 | 2023-03-21 | 山东水发紫光大数据有限责任公司 | Data encryption method based on big data |
| CN116722991A (en) * | 2023-02-02 | 2023-09-08 | 浙江云马智慧科技有限公司 | Data transmission system used in physical isolation environment |
-
2022
- 2022-10-19 CN CN202211277839.0A patent/CN115664630A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116722991A (en) * | 2023-02-02 | 2023-09-08 | 浙江云马智慧科技有限公司 | Data transmission system used in physical isolation environment |
| CN116722991B (en) * | 2023-02-02 | 2023-11-17 | 浙江云马智慧科技有限公司 | Data transmission system used in physical isolation environment |
| CN115834023A (en) * | 2023-02-21 | 2023-03-21 | 山东水发紫光大数据有限责任公司 | Data encryption method based on big data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111105339B (en) | Image encryption method based on multidimensional chaotic system and Joseph scrambling | |
| Xingyuan et al. | An image encryption algorithm based on ZigZag transform and LL compound chaotic system | |
| CN110086601B (en) | Joseph traversal and hyperchaotic system image encryption method based on pixel value association | |
| CN115664630A (en) | Network security communication method | |
| CN109660696B (en) | New image encryption method | |
| CN116032474B (en) | Safety protection system based on big data computer network | |
| CN107094072B (en) | Mixed chaotic encryption method based on generalized Henon mapping | |
| CN105046161A (en) | DNA dynamic coding based colored image encryption method | |
| CN101706946A (en) | Digital image encryption method based on DNA sequence and multi-chaotic mapping | |
| CN110889877A (en) | Image encryption method based on L-F cascade chaos and 3D bit scrambling | |
| CN112202545B (en) | Image encryption method based on Y-type filling curve and variable-step Joseph traversal | |
| CN115314600B (en) | Chemical fertilizer production monitoring data management method | |
| CN113129196B (en) | Image encryption method based on DNA sequence and memristor chaos | |
| CN109768956B (en) | Big data safe storage system and method based on compressed sensing | |
| Fang et al. | A secure chaotic block image encryption algorithm using generative adversarial networks and DNA sequence coding | |
| CN110225222B (en) | Image encryption method based on 3D orthogonal Latin square and chaotic system | |
| CN115766962A (en) | Multi-key image encryption method based on five-dimensional conservative hyperchaotic system | |
| CN113300827B (en) | Latin square-based chaotic image encryption method | |
| CN112769545B (en) | Image encryption method based on adjacent pixel Joseph transformation and Mealy state machine | |
| CN115311118A (en) | Remote sensing image encryption method based on two-dimensional discrete memristor hyperchaotic mapping | |
| CN116016795A (en) | Image encryption method based on variable step length extraction random number and improved ZigZag conversion | |
| CN109559269A (en) | A kind of method and terminal of image encryption | |
| CN110944096B (en) | Image encryption method for meaningful ciphertext | |
| CN113837916A (en) | Chaos system based recombinant scrambled DNA coding image encryption algorithm | |
| Huang et al. | 3-image bit-level encryption algorithm based on 3D nonequilateral Arnold transformation and hyperchaotic system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20230131 |