CN115694784B - Data security storage method - Google Patents
Data security storage method Download PDFInfo
- Publication number
- CN115694784B CN115694784B CN202211701190.0A CN202211701190A CN115694784B CN 115694784 B CN115694784 B CN 115694784B CN 202211701190 A CN202211701190 A CN 202211701190A CN 115694784 B CN115694784 B CN 115694784B
- Authority
- CN
- China
- Prior art keywords
- base
- base matrix
- matrix
- encrypted
- dimensional
- 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.)
- Active
Links
Images
Landscapes
- Image Processing (AREA)
Abstract
The invention relates to the field of electronic digital data processing for protecting data, in particular to a data security storage method, which comprises the following steps: converting gray values of all pixel points in a gray image of an image to be encrypted into eight-bit binary codes, converting the binary codes into base codes, and converting the gray image to be encrypted into a plurality of base matrixes; performing chaotic mapping on the chaotic sequence to obtain a key image, and generating a plurality of key two-dimensional base matrixes according to the key image; calculating the preference degree of the base matrix operation rule, and carrying out encryption operation on the base matrix according to the preference degree of the base matrix operation rule and the key two-dimensional base matrix to obtain an encrypted base matrix; performing inverse transformation on the encrypted base matrix to obtain an encrypted gray value; the encrypted image is decrypted according to the optimal operation rule corresponding to the chaotic sequence parameter and the base matrix, the difference between the encrypted image and the image before encryption is larger, the generated encryption matrix has stronger randomness, and the decryption difficulty of the secret key is improved.
Description
Technical Field
The invention relates to the field of electronic digital data processing for protecting data, in particular to a data security storage method.
Background
With the development of the internet, data stored and transmitted in the network are also increasing exponentially, wherein image data is one of main expression forms of data information, and a large amount of information such as identity information, geographical information and the like is contained in the image data, so that if the information is stolen or destroyed, serious economic loss is easily caused, and national security is seriously threatened. Therefore, for image data containing important information, such as remote sensing images and military training images, it is necessary to encrypt the image data when transmitting or storing the image data.
The traditional image encryption method is usually scrambling and replacing, wherein the scrambling is to scramble positions of pixel points in an image and destroy associated information among the pixel points so as to achieve the aim of encryption, but scrambling encryption only changes the position information of the pixel points, a gray level statistical histogram of the pixel points is not changed, and lawbreakers are likely to break the image through the distribution characteristics of the histogram and steal important information contained in the image; the replacement encryption is to replace gray values of pixel points in an image, so that original gray value information is changed, the purpose of encryption is achieved, and an encryption key for replacement encryption is difficult to manage.
Disclosure of Invention
In order to solve the above problems, the present invention provides a data security storage method, the method comprising:
s1: converting the gray level image to be encrypted into an initial base matrix;
s2, performing chaotic mapping on the gray image to be encrypted to obtain an initial key two-dimensional base matrix; grouping the initial base matrix and the initial key two-dimensional base matrix to respectively obtain a plurality of base matrixes and a plurality of key two-dimensional base matrixes;
s3, calculating the two-dimensional base matrix of each key and the pixel value in the base matrix by using four operation rules respectively to obtain the operation result of each operation rule, and marking the operation rule with the largest difference between the operation result and the pixel value in the gray image to be encrypted as the optimal operation rule of each pixel point; obtaining the preference degree of each operation rule in each base matrix according to the number of pixel points corresponding to each optimal operation rule; obtaining an optimal operation rule of each base matrix according to the preference degree of the operation rule in each base matrix;
s4, calculating each base matrix by adopting the corresponding optimal operation rule and each key two-dimensional base matrix to obtain each encrypted base matrix, splicing all the encrypted base matrixes, then carrying out inverse transformation to obtain an encrypted image of the gray image to be encrypted, and storing chaotic sequence parameters of the encrypted image and the corresponding optimal operation rule of all the base matrixes;
s5: and decrypting the encrypted image according to the stored chaotic sequence parameters and the optimal operation rule corresponding to the base matrix to obtain the gray image to be encrypted before encryption.
Further, the step of converting the gray-scale image to be encrypted into the initial base matrix includes:
converting the gray values of all pixel points in the gray image to be encrypted into binary codes, using a base A to represent 00, a base T to represent 11, a base G to represent 01 and a base C to represent 10, mapping the binary coding sequence into DNA bases to obtain base codes, and converting the gray image to be encrypted into an initial base matrix.
Further, the step of performing chaotic mapping on the gray-scale image to be encrypted to obtain the initial key two-dimensional base matrix comprises the following steps:
according to the chaotic model mapping, a chaotic sequence between [0,1] is obtained, each number in the chaotic sequence between [0,1] is multiplied by 255 and is rounded downwards to obtain a chaotic sequence of [0,255], the chaotic sequence of [0,255] is converted into a two-dimensional matrix with the size of M multiplied by N, the two-dimensional matrix is used as a key image, all values in the two-dimensional matrix are subjected to eight-bit binary conversion, and the eight-bit binary coding is converted into base coding to obtain an initial key two-dimensional base matrix; m and N are the length and width of the gray scale image to be encrypted.
Further, the step of grouping the initial base matrix and the initial key two-dimensional base matrix to obtain a plurality of base matrices and a plurality of key two-dimensional base matrices respectively includes:
extracting the first base of each pixel point in the initial base matrix, and marking the first base of all the pixel points as a group as a first base matrix; extracting the second base of each pixel point in the initial base matrix, and marking the second base of all the pixel points as a group as a second base matrix; extracting the third base of each pixel point in the initial base matrix, and marking the third base of all the pixel points as a group as a third base matrix; extracting the fourth base of each pixel point in the initial base matrix, and marking the fourth base of all the pixel points as a group as a fourth base matrix;
extracting the first base of each pixel point in the initial key two-dimensional base matrix, and marking the first base of all the pixel points as a group as a first key two-dimensional base matrix; extracting the second base of each pixel point in the initial key two-dimensional base matrix, and marking the second bases of all the pixel points as a group as a second key two-dimensional base matrix; extracting the third base of each pixel point in the initial key two-dimensional base matrix, and marking the third base of all the pixel points as a group as a third key two-dimensional base matrix; extracting the fourth base of each pixel point in the initial key two-dimensional base matrix, and marking the fourth base of all the pixel points as a group as a fourth key two-dimensional base matrix.
Further, the step of obtaining the preference degree of each operation rule in each base matrix according to the number of pixel points corresponding to each optimal operation rule includes:
acquisition of the first
The formula of the preference degree of the calculation rule k of the base matrix is as follows:
in the method, in the process of the invention,
the base matrix calculation rule is expressed as
Is the degree of preference of the arithmetic rule of (1), wherein
Is a positive integer and
the maximum value of 4 is taken out,
representing the addition operation of the data processing system,
representing the subtraction operation,
representing an exclusive-or operation,
representing an exclusive nor operation is performed on the data,
the optimal operation rule in the base matrix is expressed as
Is used for the number of occurrences of the pixel,
the number of pixels in the first base matrix is represented.
Further, the step of obtaining the optimal operation rule for each base matrix according to the degree of preference of the operation rule in each base matrix includes:
and marking the operation rule corresponding to the maximum preference degree in each base matrix as the optimal operation rule of each base matrix.
Further, the step of obtaining the gray image to be encrypted before encryption includes:
generating a corresponding chaotic sequence according to the chaotic sequence parameters, converting the chaotic sequence into a two-dimensional matrix with M multiplied by N, performing eight-bit binary conversion on the two-dimensional matrix and the encrypted ciphertext, converting the two-dimensional matrix and the encrypted ciphertext into corresponding base matrixes, decrypting the corresponding base matrixes according to the operation rules of the corresponding base matrixes to obtain decrypted binary numbers, splicing the decrypted binary numbers to obtain corresponding eight-bit binary codes, and converting the eight-bit binary codes into 10 binary numbers to obtain an original gray image to be encrypted; m and N are the length and width of the gray scale image to be encrypted.
The embodiment of the invention has the following beneficial effects:
1. the binary codes of the gray values of the corresponding pixel points are obtained through binary conversion, and the difference between the converted binary codes and the original binary codes is large enough through obtaining the optimal operation rule, so that the effect of increasing the image privacy is achieved.
2. The method has the advantages that through chaotic mapping and the acquisition of the optimal operation rule, key management is simple, the number of coding bits of the key is small, encryption effect is far higher than scrambling encryption, meanwhile, through the acquisition of the optimal operation rule, encryption effect is controllable, the difference between an encrypted image and an image before encryption is as large as possible, meanwhile, the generated encryption matrix is strong in randomness, and the cracking difficulty of the key is greatly improved.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions and advantages of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are only some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of steps of a method for securely storing data according to an embodiment of the present invention;
FIG. 2 is a schematic diagram illustrating transcoding of a data security storage method according to an embodiment of the present invention;
FIG. 3 is a diagram showing the result of an encoding operation of a data security storage method according to an embodiment of the present invention;
fig. 4 is a schematic diagram of base matrix grouping of a data security storage method according to an embodiment of the present invention.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention to achieve the preset purpose, the following detailed description refers to specific embodiments, structures, features and effects of a data security storage method according to the present invention with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of the data security storage method provided by the invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart of steps of a method for securely storing data according to an embodiment of the present invention is shown, the method includes the steps of:
s001, converting the image to be encrypted into a gray image, and converting gray values of all pixel points in the image into eight-bit binary codes.
The acquired data are image data containing important information, the image to be encrypted is converted into a gray image, the gray value of a pixel point in the gray image to be encrypted is 0-255, 256 gray levels are added, so that the gray value of the pixel point is binary coded and converted, the gray value is converted into 8-bit binary codes because the gray level interval is 0-255, and the gray value of each pixel point after the binary conversion consists of an eight-bit binary data string. For example: the pixel point with the gray value of 1 is coded by eight-bit binary conversion as follows: 00000001, the encoding of the pixel point with the gray value of 54 after eight-bit binary conversion is as follows: 00110110, the encoding of the pixel point with the gray value of 234 after eight-bit binary conversion is as follows: 11101010. each pixel after the binary conversion is composed of an eight-bit binary data string, and the conversion effect is shown in fig. 2.
S002, converting the binary code into base code, and converting the gray image to be encrypted into an initial base matrix according to the base code.
For an eight-bit binary digit string, the values of the characters in the digit string are only 0 and 1, and 0 and 1 in the binary are considered to be complementary. Four bases are present in human DNA and are also in a complementary state, i.e., adenine (A) and thymine (T) are complementary, and guanine (G) is complementary to cytosine (C). The binary coding sequence is mapped into DNA bases by reference to the complementary rule of DNA. The specific mapping process is as follows: the binary codes are 00 and 11 complementary and 01 and 10 complementary, and the DNA is A and T complementary and G and C complementary, so that A can be used to represent 00, T for 11, G for 01 and C for 10. For example: the pixel with the gray value of 54 is coded by eight-bit binary conversion: 00110110, after conversion by a transcoding method of a 00, t 11, g 01, and c 10, the pixel with a gray value of 54 can be expressed as: after each pixel point performs base coding conversion, the ATGC can convert the image to be encrypted into a base matrix, and this embodiment marks the base matrix as an initial base matrix, and the conversion effect is shown in fig. 2.
S003, performing chaotic mapping according to the chaotic sequence to obtain a key image, and performing binary coding on the key image to generate an initial key two-dimensional base matrix.
A chaotic map is adopted to generate a key image with the same size as the image to be encrypted,
the mapping is a typical chaotic mapping, and the model is as follows:
wherein the method comprises the steps of
As a function of the parameters to be controlled,
the nth number in the chaotic sequence is represented. When coefficient of
When the system enters a chaotic state, the generation of
Chaotic sequence in between, will
Chaotic mapping model iteration
And twice. The chaotic sequence acquired at this time is
The chaos sequence between the two is projected to a value interval of gray values, namely: multiplying each number of the obtained chaotic sequence by
And rounding down to obtain a range of intervals of
Is a chaotic sequence of (a).
At this time, the chaotic sequence is converted into a sequence of the size
The two-dimensional matrix is a key image, the gray value in the key image is converted into eight-bit binary code, and the eight-bit binary code is converted into base code, so that the initial key two-dimensional base matrix is finally obtained. For example: the 1 st number in the generated chaotic sequence is 88, and after binary conversion, the 1 st number is: 01011000, after being converted by the transcoding method of a representing 00, t representing 11, g representing 01, and c representing 10, the pixel point with a gray value of 88 in the generated two-dimensional matrix can be expressed as: GGCA. M and N are the length and width of the gray scale image to be encrypted
S004, calculating the optimization degree of the base matrix operation rule according to the initial key two-dimensional base matrix and the initial base matrix.
The initial base matrix of the original image to be encrypted is grouped.
Since S003 converts the gray value of the pixel point of the image to be encrypted into 4 bases, the image to be encrypted is divided into 4 groups each having
The grouping rules are: extracting the first base of each pixel point in the initial base matrix, and marking the first base of all the pixel points as a group as a first base matrix; extracting the second base of each pixel point in the initial base matrix, wherein the second base of all the pixel points forms a single baseA group, denoted as a second base matrix; extracting the third base of each pixel point in the initial base matrix, and marking the third base of all the pixel points as a group as a third base matrix; the fourth base of each pixel point in the initial base matrix is extracted, the fourth bases of all the pixel points form a group, the group is marked as a fourth base matrix, and the grouping effect is shown in figure 4.
The initial key two-dimensional base matrix is grouped.
Extracting the first base of each pixel point in the initial key two-dimensional base matrix, and marking the first base of all the pixel points as a group as a first key two-dimensional base matrix; extracting the second base of each pixel point in the initial key two-dimensional base matrix, and marking the second bases of all the pixel points as a group as a second key two-dimensional base matrix; extracting the third base of each pixel point in the initial key two-dimensional base matrix, and marking the third base of all the pixel points as a group as a third key two-dimensional base matrix; extracting the fourth base of each pixel point in the initial key two-dimensional base matrix, and marking the fourth base of all the pixel points as a group as a fourth key two-dimensional base matrix.
And calculating the preference degree of the base matrix operation rule.
Will be the first
The first base matrix
Base and first pixel
The first key in the two-dimensional base matrix
The bases of the pixel points are sequentially subjected to addition, subtraction, exclusive OR and exclusive OR operations, binary number operation results are shown in figure 3, and each operation result isConversion to decimal result values
The result of each operation is calculated
And the first image to be encrypted
Comparing the gray values of the pixel points, and marking the corresponding operation rule as the first operation rule when the difference is maximum
The optimal operation rule of each pixel point is that the larger the difference value is, the larger the difference between the gray value of the pixel point corresponding to the ciphertext position and the gray value of the pixel point corresponding to the plaintext position is, so that the information carried by the plaintext is destroyed, and the information contained between the pixel points is destroyed, thereby ensuring the safety of the ciphertext. The rule is prevented from being found from the ciphertext, and the difficulty of ciphertext cracking is increased.
Acquisition of the first
The formula of the preference degree of the calculation rule k of the base matrix is as follows:
in the method, in the process of the invention,
the base matrix calculation rule is expressed as
Is the degree of preference of the arithmetic rule of (1), wherein
Is a positive integer and
the maximum value of 4 is taken out,
representing the addition operation of the data processing system,
representing the subtraction operation,
representing an exclusive-or operation,
representing an exclusive nor operation is performed on the data,
the optimal operation rule in the base matrix is expressed as
Is used for the number of occurrences of the pixel,
the number of pixels in the first base matrix is represented.
Of which the degree of preference
The larger the value of (2) is, the better the ciphertext encryption effect after the two-dimensional base matrix encryption operation is, and the larger the difference between the encrypted image and the original image is, so that the operation rule corresponding to the maximum optimization degree is selected as the first
Optimum operation rule of each base matrix.
The optimal operation rules of the first base matrix, the second base matrix, the third base matrix, and the fourth base matrix are calculated by using this method.
S005, carrying out encryption operation on the base matrix according to the preference degree of the base matrix operation rule and the key two-dimensional base matrix to obtain an encrypted base matrix; and carrying out inverse transformation on the encrypted base matrix to obtain an encrypted ciphertext, and storing the encrypted ciphertext in a memory.
For the first
The base matrix is calculated by adopting an optimal operation rule and a corresponding key two-dimensional base matrix to obtain a corresponding first base matrix
The matrix of encrypted bases, i.e. the first
The first of the encrypted base matrices
The value of each pixel point is
The first encrypted base matrix, the second encrypted base matrix, the third encrypted base matrix and the fourth encrypted base matrix are spliced to form a combined encrypted base matrix, and the splicing method comprises the following steps: the eight-bit binary code is formed according to the reverse process of the 1 step in S004, and the conventional operation for transforming the binary code data according to the base inverse transformation is not described in detail. And carrying out inverse transformation on all bases in the combined encrypted base matrix to form an eight-bit binary code, and carrying out decimal conversion on the eight-bit binary code to obtain an encrypted ciphertext of the gray level image.
The encrypted ciphertext is stored in the memory, and the encryption key is stored in the same way, but it is worth explaining that the storage of the encryption key needs to be encrypted, the encryption method of the encryption key can select the existing AES encryption algorithm to encrypt, and AES encryption is the prior art, and is not summarized in detail here.
S006, reading data from the memory, and decrypting the encrypted image according to the optimal operation rule corresponding to the chaotic sequence parameter and the base matrix.
The key consists of parameters generated by the chaotic sequence and corresponding operation rules, and controllable parameters of the chaotic sequence are as follows:
wherein
The initial value of the generated chaotic sequence is shown, and four groups of base matrixes correspond to four optimal operation rules, so that the key is 6 bits.
It should be noted that: when data is read from the memory, the corresponding encryption key needs to be acquired first, and if the encryption key is stored in the memory together with the ciphertext, the encryption key part is preferably read from the memory, and the corresponding key is acquired by adopting an AES decryption operation.
Generating a corresponding chaotic sequence according to the chaotic sequence parameters, and converting the chaotic sequence into
And (3) performing eight-bit binary conversion on the two-dimensional matrix and the encrypted ciphertext to generate a corresponding base matrix, decrypting through an operation rule of the corresponding base matrix to obtain decrypted binary numbers, and splicing to obtain corresponding eight-bit binary codes, wherein the eight-bit binary codes are converted into 10 binary numbers to obtain an original image to be encrypted.
In summary, the binary coding is performed on the gray value of the gray image pixel point of the image to be encrypted, so that the binary coding and the base coding are converted, the difference between the binary coding after conversion and the original binary coding is large enough by acquiring the optimal operation rule, the effect of increasing the image privacy is achieved, the key management is simple by acquiring the chaotic mapping and the optimal operation rule, the encryption effect is far higher than the scrambling encryption, meanwhile, the encryption effect is controllable by acquiring the optimal operation rule, the difference between the encrypted image and the image before encryption is larger, the generated encryption matrix has stronger randomness, and the cracking difficulty of the key is greatly improved.
It should be noted that: the sequence of the embodiments of the present invention is only for description, and does not represent the advantages and disadvantages of the embodiments. And the foregoing description has been directed to specific embodiments of this specification. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments.
The above embodiments are only for illustrating the technical solution of the present application, and are not limiting thereof; 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 scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the 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 method for securely storing data, the method comprising:
s1: converting the gray level image to be encrypted into an initial base matrix;
s2, performing chaotic mapping on the gray image to be encrypted to obtain an initial key two-dimensional base matrix; grouping the initial base matrix and the initial key two-dimensional base matrix to respectively obtain a plurality of base matrixes and a plurality of key two-dimensional base matrixes;
s3, calculating the two-dimensional base matrix of each key and the pixel value in the base matrix by using four operation rules respectively to obtain the operation result of each operation rule, and marking the operation rule with the largest difference between the operation result and the pixel value in the gray image to be encrypted as the optimal operation rule of each pixel point; obtaining the preference degree of each operation rule in each base matrix according to the number of pixel points corresponding to each optimal operation rule; obtaining an optimal operation rule of each base matrix according to the preference degree of the operation rule in each base matrix;
s4, calculating each base matrix by adopting the corresponding optimal operation rule and each key two-dimensional base matrix to obtain each encrypted base matrix, splicing all the encrypted base matrixes, then carrying out inverse transformation to obtain an encrypted image of the gray image to be encrypted, and storing chaotic sequence parameters of the encrypted image and the corresponding optimal operation rule of all the base matrixes;
s5: and decrypting the encrypted image according to the stored chaotic sequence parameters and the optimal operation rule corresponding to the base matrix to obtain the gray image to be encrypted before encryption.
2. The method for securely storing data according to claim 1, wherein said step of converting the gray-scale image to be encrypted into the initial base matrix comprises:
converting the gray values of all pixel points in the gray image to be encrypted into binary codes, using a base A to represent 00, a base T to represent 11, a base G to represent 01 and a base C to represent 10, mapping the binary coding sequence into DNA bases to obtain base codes, and converting the gray image to be encrypted into an initial base matrix.
3. The method for securely storing data according to claim 1, wherein the step of performing chaotic mapping on the gray-scale image to be encrypted to obtain the initial key two-dimensional base matrix comprises:
according to the chaotic model mapping, a chaotic sequence between [0,1] is obtained, each number in the chaotic sequence between [0,1] is multiplied by 255 and is rounded downwards to obtain a chaotic sequence of [0,255], the chaotic sequence of [0,255] is converted into a two-dimensional matrix with the size of M multiplied by N, the two-dimensional matrix is used as a key image, all values in the two-dimensional matrix are subjected to eight-bit binary conversion, and the eight-bit binary coding is converted into base coding to obtain an initial key two-dimensional base matrix; m and N are the length and width of the gray scale image to be encrypted.
4. The method for securely storing data according to claim 1, wherein the step of grouping the initial base matrix and the initial key two-dimensional base matrix to obtain a plurality of base matrices and a plurality of key two-dimensional base matrices, respectively, comprises:
extracting the first base of each pixel point in the initial base matrix, and marking the first base of all the pixel points as a group as a first base matrix; extracting the second base of each pixel point in the initial base matrix, and marking the second base of all the pixel points as a group as a second base matrix; extracting the third base of each pixel point in the initial base matrix, and marking the third base of all the pixel points as a group as a third base matrix; extracting the fourth base of each pixel point in the initial base matrix, and marking the fourth base of all the pixel points as a group as a fourth base matrix;
extracting the first base of each pixel point in the initial key two-dimensional base matrix, and marking the first base of all the pixel points as a group as a first key two-dimensional base matrix; extracting the second base of each pixel point in the initial key two-dimensional base matrix, and marking the second bases of all the pixel points as a group as a second key two-dimensional base matrix; extracting the third base of each pixel point in the initial key two-dimensional base matrix, and marking the third base of all the pixel points as a group as a third key two-dimensional base matrix; extracting the fourth base of each pixel point in the initial key two-dimensional base matrix, and marking the fourth base of all the pixel points as a group as a fourth key two-dimensional base matrix.
5. The method for securely storing data according to claim 1, wherein the step of obtaining the preference degree of each operation rule in each base matrix according to the number of pixels corresponding to each optimal operation rule comprises:
acquisition of the first
The formula of the preference degree of the calculation rule k of the base matrix is as follows:
in the method, in the process of the invention,
the arithmetic rule of the basic matrix is +.>
Is the degree of preference of the arithmetic rule of (1), wherein>
Is a positive integer and->
Maximum of 4->
Representing addition, ∈>
Representing subtraction operation +.>
Representing exclusive OR operation, ++>
Representing the exclusive OR operation, < >>
Represents a baseThe optimal operation rule in the base matrix is +.>
The number of occurrences of pixels, +.>
Indicate->
The number of pixels in the matrix of bases.
6. The method of claim 1, wherein the step of obtaining the optimal operation rule for each base matrix according to the degree of preference of the operation rule in each base matrix comprises:
and marking the operation rule corresponding to the maximum preference degree in each base matrix as the optimal operation rule of each base matrix.
7. The method for securely storing data according to claim 1, wherein said step of obtaining a gray-scale image to be encrypted before encryption comprises:
generating a corresponding chaotic sequence according to the chaotic sequence parameters, converting the chaotic sequence into a two-dimensional matrix with M multiplied by N, performing eight-bit binary conversion on the two-dimensional matrix and the encrypted ciphertext, converting the two-dimensional matrix and the encrypted ciphertext into corresponding base matrixes, decrypting the corresponding base matrixes according to the operation rules of the corresponding base matrixes to obtain decrypted binary numbers, splicing the decrypted binary numbers to obtain corresponding eight-bit binary codes, and converting the eight-bit binary codes into 10 binary numbers to obtain an original gray image to be encrypted; m and N are the length and width of the gray scale image to be encrypted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211701190.0A CN115694784B (en) | 2022-12-29 | 2022-12-29 | Data security storage method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211701190.0A CN115694784B (en) | 2022-12-29 | 2022-12-29 | Data security storage method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115694784A CN115694784A (en) | 2023-02-03 |
| CN115694784B true CN115694784B (en) | 2023-05-02 |
Family
ID=85055232
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211701190.0A Active CN115694784B (en) | 2022-12-29 | 2022-12-29 | Data security storage method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115694784B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115861034B (en) * | 2023-02-20 | 2023-06-20 | 深圳市欣博跃电子有限公司 | Wireless routing data intelligent management system |
| CN116055046B (en) * | 2023-03-31 | 2023-06-09 | 山东政信大数据科技有限责任公司 | Online safe transaction system for agricultural products |
| CN116260566B (en) * | 2023-05-10 | 2023-07-14 | 山东爱福地生物股份有限公司 | Safe storage method for fertilizer production and processing data |
| CN117156061B (en) * | 2023-08-31 | 2024-10-11 | 重庆赛力斯新能源汽车设计院有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN116861468B (en) * | 2023-09-04 | 2023-11-24 | 苏州宏存芯捷科技有限公司 | Design data encryption method for PCB |
| CN117390712B (en) * | 2023-10-31 | 2024-05-17 | 深圳沃咔曼科技有限公司 | Docking station data security protection method |
| CN117278325B (en) * | 2023-11-17 | 2024-01-26 | 临沂大学 | Computer network big data safety protection method and system |
| CN117394984B (en) * | 2023-11-28 | 2024-06-25 | 安雾信息技术(重庆)有限公司 | Sensitive information security protection method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107590842A (en) * | 2017-09-05 | 2018-01-16 | 山东师范大学 | Intersect the image encryption method and device of dynamic chaos password based on pixel and DNA |
| CN108365947A (en) * | 2018-03-05 | 2018-08-03 | 郑州轻工业学院 | A kind of image encryption method based on Feistel networks Yu dynamic DNA encoding |
| CN111147594A (en) * | 2019-12-30 | 2020-05-12 | 曲阜师范大学 | Internet of things data transmission system, key generation method and data transmission method thereof |
| CN113129196A (en) * | 2021-04-07 | 2021-07-16 | 中国人民解放军海军工程大学 | Image encryption method based on DNA sequence and memristor chaos |
| CN113297607A (en) * | 2021-06-25 | 2021-08-24 | 燕山大学 | Image compression encryption and decryption method based on compressed sensing and DNA coding |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6763148B1 (en) * | 2000-11-13 | 2004-07-13 | Visual Key, Inc. | Image recognition methods |
-
2022
- 2022-12-29 CN CN202211701190.0A patent/CN115694784B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107590842A (en) * | 2017-09-05 | 2018-01-16 | 山东师范大学 | Intersect the image encryption method and device of dynamic chaos password based on pixel and DNA |
| CN108365947A (en) * | 2018-03-05 | 2018-08-03 | 郑州轻工业学院 | A kind of image encryption method based on Feistel networks Yu dynamic DNA encoding |
| CN111147594A (en) * | 2019-12-30 | 2020-05-12 | 曲阜师范大学 | Internet of things data transmission system, key generation method and data transmission method thereof |
| CN113129196A (en) * | 2021-04-07 | 2021-07-16 | 中国人民解放军海军工程大学 | Image encryption method based on DNA sequence and memristor chaos |
| CN113297607A (en) * | 2021-06-25 | 2021-08-24 | 燕山大学 | Image compression encryption and decryption method based on compressed sensing and DNA coding |
Non-Patent Citations (1)
| Title |
|---|
| 朱珍 等.方波曲线耦合零交叉边缘检测的图像加密算法.计算机工程与设计.2018,(第10期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115694784A (en) | 2023-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115694784B (en) | Data security storage method | |
| CN115242475B (en) | Big data safety transmission method and system | |
| CN107220923B (en) | Digital picture feedback encryption method based on image network | |
| CN113194213B (en) | PNG image information hiding and recovering method based on secret sharing and chaotic mapping | |
| CN116032474B (en) | Safety protection system based on big data computer network | |
| CN110535624B (en) | Medical image privacy protection method applied to DICOM format | |
| CN115277978B (en) | Image information security management method based on state coding table | |
| CN112906043B (en) | Image encryption method based on chaotic mapping and chaotic S-box substitution | |
| CN114549266B (en) | Image encryption method based on DNA replacement rule and chaotic system | |
| CN116155620B (en) | Transaction data secure transmission method for card reader | |
| CN115695675B (en) | Video encryption method for network data secure exchange | |
| CN112769545A (en) | Image encryption method based on adjacent pixel Joseph transformation and Mealy state machine | |
| CN113114869A (en) | Ciphertext domain high-capacity image reversible data hiding method based on MSB prediction | |
| CN114579993A (en) | Image encryption method based on quantum key distribution and pixel scrambling | |
| Jangid et al. | Hybrid approach of image encryption using DNA cryptography and TF Hill Cipher Algorithm | |
| Almayyahi et al. | High-security image steganography technique using XNOR operation and fibonacci algorithm | |
| Swain et al. | A dynamic approach to image steganography using the three least significant bits and extended hill cipher | |
| CN115103080B (en) | Image encryption method and system based on DNA triploid variation | |
| Jain et al. | Adaptive key length based encryption algorithm using DNA approach | |
| CN115834021A (en) | Cloud medical image encryption method based on neural network and half tensor product | |
| JP2024536063A (en) | Artificial intelligence quantum-resistant encryption method and device | |
| Sanghvi et al. | BITSAT: an efficient approach to modern image cryptography | |
| CN110061832B (en) | Method for realizing symmetric cipher algorithm using Chinese character as cipher | |
| CN117057804B (en) | Financial transaction data secure storage method and system based on hash sequence | |
| KADHIM et al. | Hidden encrypted text based on secrete map equation and bioinformatics techniques |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230919 Address after: Ocean Business Building, No. 105 Futian Road, Yiwu City, Jinhua City, Zhejiang Province, 322000 Patentee after: Zhejiang China Commodity City Group Co.,Ltd. Address before: No. J4, 17/F, No. 1, Zhongguancun Street, Haidian District, Beijing, 100000 Patentee before: Beijing Houfang Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right |