CN115865431A - Network security sharing method for private data - Google Patents
Network security sharing method for private data Download PDFInfo
- Publication number
- CN115865431A CN115865431A CN202211460379.5A CN202211460379A CN115865431A CN 115865431 A CN115865431 A CN 115865431A CN 202211460379 A CN202211460379 A CN 202211460379A CN 115865431 A CN115865431 A CN 115865431A
- Authority
- CN
- China
- Prior art keywords
- block
- data
- sub
- blocks
- data block
- 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
- 238000000034 method Methods 0.000 title claims abstract description 37
- 239000011159 matrix material Substances 0.000 claims abstract description 56
- 238000012545 processing Methods 0.000 claims abstract description 21
- 108091026890 Coding region Proteins 0.000 claims abstract description 10
- 230000006835 compression Effects 0.000 claims abstract description 8
- 238000007906 compression Methods 0.000 claims abstract description 8
- 230000000739 chaotic effect Effects 0.000 claims description 54
- 238000013507 mapping Methods 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 230000005540 biological transmission Effects 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 8
- 238000005336 cracking Methods 0.000 abstract description 2
- 238000010606 normalization Methods 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 3
- 238000013523 data management Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000002427 irreversible effect Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005312 nonlinear dynamic Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to the technical field of digital data encryption processing, in particular to a network security sharing method of private data. Firstly, normalizing various types of private data into a uniform coding sequence by coding compression, and then structuring the uniform coding sequence into a two-dimensional matrix containing data blocks; and then scrambling each data block in the two-dimensional matrix, additionally arranging a noise-adding position sub-block in each data block to be replaced by a normal sub-block selected according to a rule, and scrambling all sub-blocks after replacement, wherein the sub-block scrambling prevents a cracker from determining the replacement condition of the noise-adding position sub-block and the normal sub-block and being incapable of cracking. The method improves the efficiency and effect of data encryption processing by normalizing and structuring the various data, and completes efficient and sufficient encryption of data by scrambling the data block in the generated two-dimensional matrix and by encrypting all sub-blocks after replacing the noise-added sub-blocks with the normal sub-blocks in the data block.
Description
Technical Field
The invention relates to the technical field of digital data encryption processing, in particular to a network security sharing method of private data.
Background
With the rapid development of computers and information technologies, especially network technologies, data information has become the most critical resource in the whole society, and enterprises and public institutions need to share and access more and more data information and more importantly. Therefore, how to ensure the information security of the private data during network sharing has become a major problem to be solved urgently. At present, in order to protect the security of private data based on network sharing, the following two methods are mainly adopted: one is to encrypt the data. The data is encrypted, stored and transmitted by adopting an encryption algorithm, so that the data is difficult to analyze and decipher, and the confidentiality and the safety of private data are realized. And secondly, setting access authority for the data and carrying out access control. Different access authorities are set for different users, and the identity of the user is legally verified before the user accesses the private data.
The traditional encryption algorithm such as Hash algorithm encryption generates a Hash code with a certain length for information, but the Hash code is irreversible, and can only be used as a label to achieve the purpose of tamper resistance, and the data encryption effect is general; asymmetric encryption needs to generate a pair of keys of a public key and a private key, and user information is verified through third party authentication, so that the effect of data encryption is achieved, but a third party organization is not trusted, so that the problem that data security cannot be guaranteed due to key leakage is easily caused.
Therefore, the prior art has the defect of low data encryption security, and the network security sharing requirement of private data cannot be well met.
Disclosure of Invention
In order to improve encryption security in the data transmission process and meet the network security sharing requirement of private data, the applicant provides a network security sharing method of private data, and the adopted technical scheme is as follows:
the invention discloses a network security sharing method of private data, which comprises the following steps:
acquiring data to be transmitted, and performing coding compression on various data in the data to be transmitted to generate corresponding coding sequences so as to finish the standardized processing of the data to be transmitted;
converting the coding sequence into two-dimensional data blocks, forming a two-dimensional matrix by all the two-dimensional data blocks to complete the structural processing of data to be transmitted, wherein the two-dimensional data blocks comprise at least one noise bit sub-block;
generating a chaotic sequence to carry out chaotic mapping on the two-dimensional matrix, and finishing scrambling operation of the two-dimensional data block in the two-dimensional matrix;
the noise-added sub-block in each two-dimensional data block is replaced with a selected normal sub-block in the two-dimensional data block, and then all sub-blocks in the two-dimensional data block after sub-block replacement are subjected to scrambling operation to obtain encrypted ciphertext data;
and transmitting the ciphertext data, and decrypting the ciphertext data after the transmission is finished.
The invention has the beneficial effects that:
the method of the invention firstly normalizes various types of private data into a uniform coding sequence by a coding compression method, then converts the obtained coding sequence into two-dimensional data blocks to complete structural processing, and then forms all the data blocks into two-dimensional matrix data, thereby completing the normalization processing of the private data and improving the relevance among the data, and leading the subsequent encryption and decryption to be more rapid and accurate; in the subsequent invention, each data block in the two-dimensional matrix is scrambled continuously, and simultaneously, a noise bit sub-block is added in the data block to be replaced with a normal sub-block selected according to a rule, and all the sub-blocks are scrambled after replacement. The data block scrambling completes the general encryption of the whole data, and the operation of scrambling after the sub-block with the noise position is replaced with the normal sub-block in the data block realizes the accurate encryption of the detail data, and the operation of replacing the sub-block first and then scrambling enables a cracker to be unable to determine the condition of replacing the sub-block with the noise position and the normal sub-block and to be unable to crack. The method improves the efficiency and effect of data encryption processing by standardizing and structuring the complex data, and completes efficient and sufficient encryption of the data by scrambling the data block in the generated two-dimensional matrix and by adding encryption measures of scrambling all sub-blocks after the noise-added sub-blocks are replaced with the normal sub-blocks in the data block, thereby meeting the network security sharing requirement of private data.
Further, the method for converting the coding sequence into the two-dimensional data block comprises the following steps:
where L represents the side length of a two-dimensional data block, L max Representing the longest code sequence among the code sequences generated after the code compression of the data to be transmitted,represents rounding up;
converting the coding sequence into a two-dimensional data block of l x l according to the determined side length l, wherein the two-dimensional data block comprises l 2 And (4) sub-blocks.
Further, the scrambling method of the two-dimensional data block in the two-dimensional matrix is as follows:
generating a chaotic mapping formula:
wherein mu and gamma represent chaotic parameters;
obtaining two groups of chaotic sequences according to the generated chaotic mapping formula, and removing the previous a items from the two groups of chaotic sequences:
X={x a ,x a+1 ,...x M×N+a+b }
Y={y a ,y a+1 ,...y M×N+a+b }
wherein, b represents the floating range value, a represents the number of removed terms in the chaotic sequence;
and resetting the position of each two-dimensional data block in the two-dimensional matrix by the two groups of obtained chaotic sequences to finish the scrambling of the two-dimensional data blocks in the two-dimensional matrix.
Further, the method for replacing the noise-added sub-block in each two-dimensional data block with the selected normal sub-block in the two-dimensional data block includes:
calculating the adjustment distance of the two-dimensional data block after scrambling:
wherein d represents the adjustment distance of the two-dimensional data block after scrambling, (x, y) represents the coordinate of the two-dimensional data block in the original two-dimensional matrix, (x) a ,y a ) Representing the scrambled location coordinates of a two-dimensional data block having coordinates (x, y),represents rounding up;
after all sub-blocks in the two-dimensional data block are sequenced, according to the obtained adjusting distance d, a normal sub-block and a noise bit sub-block are selected in the two-dimensional data block for replacement:
if d is less than l 2 Replacing the normal sub-block and the noise bit sub-block at the d-th position;
if d = l 2 Selecting the normal sub-block at the position of d +1 and the noise bit sub-block for replacement;
if d > l 2 Then the selected normal sub-blocks are:
s=d-nl 2
where s represents the position of the selected normal sub-block to be permuted and n represents a multiple relationship.
Further, the method for scrambling all sub-blocks in the two-dimensional data block after the sub-block replacement comprises:
and taking the two-dimensional data block as a central point, acquiring chaotic sequences of all lengths before and after the two-dimensional data block, sequencing the chaotic sequences from small to large, if the chaotic sequences have the same value, sequencing the chaotic sequences with the same value according to the sequence, and scrambling the positions of all sub-blocks according to the sequenced chaotic sequences.
Further, the keys used in the process of decrypting the ciphertext data are chaotic parameters μ, γ and a.
Furthermore, huffman coding is adopted to complete the coding compression.
Drawings
FIG. 1 is a flow chart of a method for secure sharing of private data over a network according to the present invention;
FIG. 2 is a schematic of a two-dimensional matrix of the present invention;
FIG. 3 is a schematic diagram of a data block in a two-dimensional matrix of the present invention;
FIG. 4 is a comparison of sub-blocks in a data block of the present invention before and after being replaced by noise;
fig. 5 is a schematic diagram of subblock sequence scrambling in a data block of the present invention.
Detailed Description
The conception of the invention is as follows: the relevance among data is enhanced by converting the traditional time sequence data into matrix data, and each element position in the matrix is a data block obtained by conversion based on the time sequence data; after the matrix data are obtained, scrambling operation is carried out on all data blocks in the generated matrix to change the position of each data block, meanwhile, noise adding and scrambling operation is carried out on each subblock in the data block, the value and the position of the subblock in the data block are changed, the effect of fully encrypting the private data needing to be shared through a network is achieved, and the network security sharing requirement of the private data is met.
The following describes a network security sharing method for private data according to the present invention in detail with reference to the accompanying drawings and embodiments.
The method comprises the following steps:
the embodiment of the network security sharing method for private data of the invention has the overall flow as shown in fig. 1, and the specific process is as follows:
the method comprises the steps of firstly, obtaining private data to be transmitted, conducting standardization processing on the private data to be transmitted, and then conducting structuralization processing on the private data to be transmitted to obtain two-dimensional matrix data.
Private data tends to be unstructured data and is of many types, such as bid text information, financial data, image logo design, and partial private video data within an enterprise. Because the types of data are many and complicated, if different encryption methods are adopted to carry out targeted encryption on different types of private data, the data confusion is inevitable, and meanwhile, the difficulty of data management is also aggravated, so that the different types of data need to be subjected to standardized processing, so that the purpose of adopting a uniform encryption mode on the different types of data is achieved, and the data management is convenient.
For text information and digital information, private data is usually partial data, namely the data volume is limited, so that the information is counted, and Huffman coding is adopted to code and compress the data to obtain coded data; the method comprises the steps of splitting image type data such as logo design and private video data, processing a single image, coding and compressing the data by adopting Huffman coding, wherein the statistic of the image type data is gray value information of pixel points, and the statistic of text information is the probability of single character or number.
In the embodiment, huffman coding is adopted to code and compress data, and in other embodiments, the data can be coded and compressed by using other existing coding and compressing modes to complete the normalization processing of the data to be transmitted.
Since time-series data is generally one-dimensional data, a character associated with a certain character in the sequence 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 and is easily broken when encrypted, the one-dimensional time-series data after huffman coding is constructed into a two-dimensional matrix in order to increase the association between data and the security of encrypted ciphertext data.
In this embodiment, each character in the private data after normalization processing is converted into a binary huffman code sequence of 0 and 1, and the lengths of the code sequences at this time are different, so that the binary huffman code sequence is subjected to fixed length processing for quick subsequent decryption and prevention of data scrambling.
Meanwhile, in order to increase the relevance among data, a fixed-length Huffman coding sequence which is obtained by correspondingly obtaining each character in original private data is converted into a two-dimensional data block:
whereinL denotes the side length of the data block, L max Indicating the length of the longest huffman code sequence corresponding to the characters in the private data,indicating rounding up, converting the coded sequence into data blocks of l x l according to the determined side length l, the data blocks including l 2 And (4) sub-blocks.
After all characters in the private data are converted into two-dimensional data blocks, the private data can be structurally processed by forming all the data blocks into a two-dimensional matrix shown in fig. 2, the relevance among the data is enhanced, each data block in the two-dimensional matrix obtained by conversion is a character in the original private data, a plane rectangular coordinate system is established by taking the upper left corner as the origin, and each data block corresponds to a coordinate (x, y).
Thus, the normalization and the structuralization processing of the private data to be transmitted are completed, and a two-dimensional matrix is obtained.
And step two, scrambling all data blocks in the two-dimensional matrix.
After the two-dimensional matrix is obtained, in order to increase the security of private data, the embodiment performs scrambling operation on all data blocks in the two-dimensional matrix, changes the position of each data block in the two-dimensional matrix, and the scrambling rule needs to conform to the properties of non-periodicity and non-convergence.
The embodiment performs mapping processing on a two-dimensional matrix by generating a chaotic sequence, and the chaotic mapping is a nonlinear dynamic system and has pseudo-randomness, sensitivity to initial conditions, non-periodicity and long-term unpredictability. Therefore, the encryption method can play a good encryption effect by taking the encryption method as a scrambling rule, namely:
in the formula, mu and gamma represent chaotic parameters.
According to the chaos mapping formula, two groups of chaos sequences are obtained, in order to prevent the initial chaos sequence from being similar to the original sequence, the first a items of the chaos sequence are removed, namely:
X={x a ,x a+1 ,...x M×N+a+b }
Y={y a ,y a+1 ,...y M×N+a+b }
wherein b represents a floating range value.
Generating coordinate information through the acquired chaos sequences X and Y, namely: (x) a ,y a )、(x a+1 ,y a+1 )、...(x M×N+a+b ,y M×N+a+b ) And corresponding the coordinates of the data block in the two-dimensional matrix with the generated chaotic coordinates, wherein (1, 1) (1, 2) and (1, 3). & gt (x, y) are the coordinate values of the data block in the two-dimensional matrix, and (15, 3) (33, 4) and (1, 6) & gt M×N+a ,y M×N+a ) And (3) moving a data block with the coordinate of (1, 1) position in the two-dimensional matrix to the coordinate position of (15, 3) to generate chaotic coordinates, moving a data block with the coordinate of (1, 2) position in the two-dimensional matrix to the coordinate position of (33, 4), moving a data block with the coordinate of (1, 3) position in the two-dimensional matrix to the coordinate position of (1, 6), if the chaotic coordinate positions are repeated, skipping repeated coordinates, for example, the chaotic coordinates occur twice (1, 6), the first time (1, 6) corresponds to (1, 3), when the second time (1, 6) occurs, the chaotic coordinates are repeated with (1, 3), when (1, 6) occurring the second time is skipped, the next pair of chaotic coordinates of (1, 6) is corresponding to the coordinates in the two-dimensional matrix, when b +1 occurs, because of repeated coordinates, the number of chaotic coordinates is more than that of data blocks in the two-dimensional matrix. If the chaotic coordinate cannot be corresponded in the two-dimensional matrix, for example, the maximum value of the coordinate in the two-dimensional matrix is (1024 ), and the chaotic coordinate appears (1025, 5), the coordinate is also skipped at this time, the next coordinate is corresponded to the chaotic coordinate, and similarly, b +1 is matched at this time until all data blocks in the two-dimensional matrix are matched after scrambling operation is completed.
And step three, carrying out noise addition permutation and scrambling operation on the subblocks in each data block of the two-dimensional matrix.
After scrambling operation is completed on all data blocks in the two-dimensional matrix, the two-dimensional matrix after scrambling only changes the positions of the data blocks in the matrix, information in the data blocks is not changed, redundant data exists in private data, and scrambling is performed according to a pseudo-random number sequence during scrambling, namely, the effect after scrambling is unpredictable, so that the situation that data after scrambling is similar to original two-dimensional matrix data exists, scrambling only changes the positions of the data blocks, the information contained in the data blocks is the same, namely, the privacy of encrypted data obtained through scrambling and encryption is not strong, and therefore in order to increase the privacy of the data, an attacker is prevented from obtaining part of information of the private data through a region with a low degree of partial scrambling in the scrambled data, the embodiment continues to achieve a mode of changing the information of the data blocks through adding noise on the basis of the scrambling operation of the two-dimensional matrix data blocks, and the effect of further enhancing the privacy of the data is achieved.
From the calculation formula of the side length of the data blockThe size of the determined data block can be known, at least 1 noise bit sub-block is reserved in the data block except the sub-block containing data information, namely +1 in the formula, and the adjusted distance of the data block is calculated:
wherein d represents the adjusted distance of the data block, (x, y) represents the coordinate of the data block in the original two-dimensional matrix, (x) a ,y a ) Representing the scrambled location coordinates of a block of data having coordinates (x, y),indicating rounding up.
Searching in the data block according to the calculated d value, and sorting the sub-blocks in the data block, as shown in fig. 3, where the gray sub-block is a noise bit, and if the value of d is less than l 2 Then, the value of the sub-block at the d-th position is permutated, for example, d =7, and the original value of the 7-th sub-block is 1, then the permutated value is setThe value of the 7 th sub-block after the conversion is 0; if d = l 2 Selecting the value of the subblock at the position of d +1 for replacement; if d is greater than l 2 Then the positions of the substitutions are:
s=d-nl 2
wherein s represents the position of the sub-block to be replaced, d represents the linear distance of the data block adjustment, n represents the multiple relation, l 2 Representing the number of sub-blocks in the data block.
And determining the noise adding condition of the noise adding bit according to the replacing condition of the sub-block value at the replacing position, namely determining the value of the sub-block at the replacing position, and setting the value of the noise adding bit to be the same value. As shown in fig. 4, the left side of the graph is an image without noise, and the right side of the graph is an image with noise, it can be found that, after the sub-blocks in the data block are subjected to the noise processing, the values of the sub-blocks in the data block change, but the statistics of the sub-block values in the data block are not changed, so that even if an attacker obtains partial information of a region with a low degree of disorder in the scrambled data by a certain rule, the data obtained by the decryption of the data is not the original data, that is, is not correct data.
After the data block is subjected to the noise adding processing, although the values in the sub-blocks in the data block are changed, the data sequences in the sub-blocks are still similar to the data sequences in the original sub-blocks, in order to further increase the difficulty of cracking the data, the embodiment continues to scramble the positions of the sub-blocks in the data block, that is, to scramble the sub-blocks in the data block.
Obtaining length l according to position of data block 2 The chaotic sequence of (1) length before and after the data block is obtained by taking the data block as a center point, the chaotic sequence is sequenced from small to large, if the same value exists, the chaotic sequence is sequenced according to the sequence, the positions of the sub-blocks are scrambled according to the chaotic sequence, as shown in figure 5, the sequence value of the sub-blocks is 10110, the original chaotic sequence is 3, 2, 5, 7 and 4, the sequence of the chaotic sequence sequenced from small to large is 2, 3,4, 5 and 7, the chaotic sequence generates the change of the sequence position according to the sequencing process from small to large, and according to the change of the sequence position, the sub-blocks are sequentially sequenced from small to largeThe sequence value of the block is changed from 10110 to 01101 after scrambling, thereby changing the position of each sub-block in the data block and realizing scrambling of the sub-blocks in the data block.
And performing the operation on all the data blocks to obtain a final encrypted ciphertext, and thus completing the safe encryption of the private data to be transmitted, namely to be shared by the network.
And step four, transmitting the encrypted data, and decrypting the data after receiving the data.
The secret key is the chaos parameters mu, gamma and a. Generating a chaotic sequence through chaotic parameters mu and gamma values, restoring the position of each data block in the two-dimensional matrix through the chaotic sequence, and acquiring the length l according to the position of the restored data block 2 The sequence of each sub-block in the data block is restored according to the chaotic sequence; and obtaining a distance d value according to the position of the restored data block and the position of the data block in the ciphertext, obtaining the position of the displaced sub-block according to the value d, displacing and restoring the value of the sub-block in the data block, and finally removing the last bit of the data block sequence, namely the noise adding bit to obtain a restored matrix, namely the original matrix, so as to finish decryption.
The above-mentioned embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.
Claims (7)
1. A network security sharing method of private data is characterized by comprising the following steps:
acquiring data to be transmitted, and performing coding compression on various data in the data to be transmitted to generate corresponding coding sequences so as to finish the standardized processing of the data to be transmitted;
converting the coding sequence into two-dimensional data blocks, forming a two-dimensional matrix by all the two-dimensional data blocks to complete the structural processing of data to be transmitted, wherein the two-dimensional data blocks comprise at least one noise bit sub-block;
generating a chaotic sequence to carry out chaotic mapping on the two-dimensional matrix, and finishing scrambling operation of the two-dimensional data block in the two-dimensional matrix;
the noise-added sub-block in each two-dimensional data block is replaced with a selected normal sub-block in the two-dimensional data block, and then all sub-blocks in the two-dimensional data block after sub-block replacement are subjected to scrambling operation to obtain encrypted ciphertext data;
and transmitting the ciphertext data, and decrypting the ciphertext data after the transmission is finished.
2. The method for sharing private data over network security according to claim 1, wherein the method for converting the encoded sequence into a two-dimensional data block comprises:
where L represents the side length of a two-dimensional data block, L max Representing the longest code sequence among the code sequences generated after the code compression of the data to be transmitted,represents rounding up;
converting the coding sequence into a two-dimensional data block of l x l according to the determined side length l, wherein the two-dimensional data block comprises l 2 And (4) sub-blocks.
3. The method for network security sharing of private data according to claim 2, wherein the scrambling method of the two-dimensional data block in the two-dimensional matrix is:
generating a chaotic mapping formula:
wherein mu and gamma represent chaotic parameters;
obtaining two groups of chaotic sequences according to the generated chaotic mapping formula, and removing a front item a from the two groups of chaotic sequences:
X={x a ,x a+1 ,...x M×N+a+b }
Y={y a ,y a+1 ,...y M×N+a+b }
wherein, b represents the floating range value, a represents the number of removed terms in the chaotic sequence;
and resetting the position of each two-dimensional data block in the two-dimensional matrix by using the two groups of obtained chaotic sequences to finish the scrambling of the two-dimensional data blocks in the two-dimensional matrix.
4. The method of claim 3, wherein the replacing the noisy bit sub-block in each two-dimensional data block with the selected normal sub-block in the two-dimensional data block comprises:
calculating the adjustment distance of the two-dimensional data block after scrambling:
wherein d represents the adjustment distance of the two-dimensional data block after scrambling, (x, y) represents the coordinate of the two-dimensional data block in the original two-dimensional matrix, (x) a ,y a ) Representing the scrambled location coordinates of a two-dimensional data block having coordinates (x, y),represents rounding up;
after all sub-blocks in the two-dimensional data block are sequenced, according to the obtained adjusting distance d, a normal sub-block and a noise bit sub-block are selected in the two-dimensional data block for replacement:
if d is less than l 2 Replacing the normal sub-block and the noise bit sub-block at the d-th position;
if d = l 2 Selecting the normal sub-block at the position of d +1 and the noise bit sub-block for replacement;
if d > l 2 Then the selected normal sub-blocks are:
s=d-nl 2
where s represents the position of the selected normal sub-block to be permuted and n represents a multiple relationship.
5. The method according to claim 4, wherein the method for scrambling all sub-blocks in the two-dimensional data block after sub-block permutation comprises:
and taking the two-dimensional data block as a central point, acquiring chaotic sequences of all lengths before and after the two-dimensional data block, sequencing the chaotic sequences from small to large, if the chaotic sequences have the same value, sequencing the chaotic sequences with the same value according to the sequence, and scrambling the positions of all sub-blocks according to the sequenced chaotic sequences.
6. The method according to claim 5, wherein the keys used in decrypting the ciphertext data are chaotic parameters μ, γ, and a.
7. A method for secure sharing of private data over a network according to any of claims 1 to 6, wherein the encoding compression is done using Huffman encoding.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202211460379.5A CN115865431A (en) | 2022-11-17 | 2022-11-17 | Network security sharing method for private data |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202211460379.5A CN115865431A (en) | 2022-11-17 | 2022-11-17 | Network security sharing method for private data |
Publications (1)
Publication Number | Publication Date |
---|---|
CN115865431A true CN115865431A (en) | 2023-03-28 |
Family
ID=85664594
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202211460379.5A Pending CN115865431A (en) | 2022-11-17 | 2022-11-17 | Network security sharing method for private data |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115865431A (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116320044A (en) * | 2023-05-25 | 2023-06-23 | 深圳市力博实业有限公司 | Intelligent encoding and storing system for data of ATM (automatic teller machine) of bank |
CN116545771A (en) * | 2023-07-05 | 2023-08-04 | 上海伯镭智能科技有限公司 | Intelligent storage method and system for intelligent driving system test data |
CN116933298A (en) * | 2023-09-18 | 2023-10-24 | 广东省科技基础条件平台中心 | Encryption processing method, device, storage medium and equipment for scientific and technological achievement data |
CN118354307A (en) * | 2024-04-25 | 2024-07-16 | 杭州一目倾诚网络科技有限公司 | Cloud computing-based wireless communication network data security transmission method and system |
-
2022
- 2022-11-17 CN CN202211460379.5A patent/CN115865431A/en active Pending
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116320044A (en) * | 2023-05-25 | 2023-06-23 | 深圳市力博实业有限公司 | Intelligent encoding and storing system for data of ATM (automatic teller machine) of bank |
CN116320044B (en) * | 2023-05-25 | 2023-07-21 | 深圳市力博实业有限公司 | Intelligent encoding and storing system for data of ATM (automatic teller machine) of bank |
CN116545771A (en) * | 2023-07-05 | 2023-08-04 | 上海伯镭智能科技有限公司 | Intelligent storage method and system for intelligent driving system test data |
CN116545771B (en) * | 2023-07-05 | 2023-09-15 | 上海伯镭智能科技有限公司 | Intelligent storage method and system for intelligent driving system test data |
CN116933298A (en) * | 2023-09-18 | 2023-10-24 | 广东省科技基础条件平台中心 | Encryption processing method, device, storage medium and equipment for scientific and technological achievement data |
CN116933298B (en) * | 2023-09-18 | 2024-02-09 | 广东省科技基础条件平台中心 | Encryption processing method, device, storage medium and equipment for scientific and technological achievement data |
CN118354307A (en) * | 2024-04-25 | 2024-07-16 | 杭州一目倾诚网络科技有限公司 | Cloud computing-based wireless communication network data security transmission method and system |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Yuen et al. | A chaos-based joint image compression and encryption scheme using DCT and SHA-1 | |
Ahmad et al. | A new algorithm of encryption and decryption of images using chaotic mapping | |
CN115865431A (en) | Network security sharing method for private data | |
CN112202984B (en) | Ciphertext domain reversible information hiding method based on error correction redundancy | |
Chen et al. | Compression-unimpaired batch-image encryption combining vector quantization and index compression | |
Hua et al. | Reversible data hiding in encrypted images using cipher-feedback secret sharing | |
Gafsi et al. | Efficient encryption system for numerical image safe transmission | |
Qin et al. | JPEG image encryption with adaptive DC coefficient prediction and RS pair permutation | |
Chanu et al. | A survey paper on secret image sharing schemes | |
Hua et al. | Matrix-based secret sharing for reversible data hiding in encrypted images | |
Meghrajani et al. | Secure and efficient arithmetic-based multi-secret image sharing scheme using universal share | |
Islam et al. | Denoising and error correction in noisy AES-encrypted images using statistical measures | |
CN105357537B (en) | A kind of multistage tree set partitioning coded image encryption method based on chaos | |
CN113382128B (en) | Bit plane compressed encrypted image reversible information hiding method | |
Saha et al. | Secret image sharing schemes: A comprehensive survey | |
CN117527984A (en) | Image encryption method based on sine and cosine two-dimensional chaotic system | |
Budiman et al. | A Combination of Block-Based Chaos with Dynamic Iteration Pattern and Stream Cipher for Color Image Encryption. | |
Cao et al. | Low-complexity reversible data hiding in encrypted image via MSB hierarchical coding and LSB compression | |
CN115442492B (en) | Visual security image encryption method based on one-dimensional sine chaotic mapping and discrete U-transformation embedding mode | |
Chaudhary et al. | A novel hybrid security mechanism for data communication networks | |
Bansal et al. | An efficient hybrid security mechanism based on chaos and improved BPCS | |
Chen et al. | Adaptive Coding and Ordered-Index Extended Scrambling Based RDH in Encrypted Images | |
Chai et al. | TPE-AP: thumbnail-preserving encryption based on adjustable precision for JPEG images | |
Ariyanto et al. | Performance Analysis of LSB Image Steganography Combined with Blowfish-RC4 Encryption in Various File Extensions | |
Yan et al. | Design of image confusion-diffusion cryptosystem based on vector quantization and cross chaotic map |
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: 20230328 |
|
WD01 | Invention patent application deemed withdrawn after publication |