CN117955736A - Network large-scale data security storage method - Google Patents
Network large-scale data security storage method Download PDFInfo
- Publication number
- CN117955736A CN117955736A CN202410345600.5A CN202410345600A CN117955736A CN 117955736 A CN117955736 A CN 117955736A CN 202410345600 A CN202410345600 A CN 202410345600A CN 117955736 A CN117955736 A CN 117955736A
- Authority
- CN
- China
- Prior art keywords
- data
- encrypted
- sequence
- group
- chaotic
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000000739 chaotic effect Effects 0.000 claims abstract description 104
- 238000006073 displacement reaction Methods 0.000 claims abstract description 15
- 238000000926 separation method Methods 0.000 claims description 3
- 238000011166 aliquoting Methods 0.000 claims description 2
- 238000002955 isolation Methods 0.000 abstract description 7
- 238000012545 processing Methods 0.000 abstract description 5
- 238000013500 data storage Methods 0.000 abstract description 4
- 238000010606 normalization Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 238000007306 functionalization reaction Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/001—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- General Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Storage Device Security (AREA)
Abstract
The invention relates to the technical field of data processing, in particular to a network large-scale data security storage method, which comprises the following steps: obtaining a binary data sequence corresponding to the network large-scale data, wherein the binary data sequence comprises a plurality of groups of data to be encrypted, obtaining a total chaotic sequence according to the binary data sequence, obtaining a displacement demand index and standard isolation prominence degree of each group of data to be encrypted according to the data of each group of data to be encrypted in the total chaotic sequence, obtaining the displacement necessity of each group of data to be encrypted, obtaining ciphertext of each group of data to be encrypted according to the displacement necessity of all groups of data to be encrypted, and storing the ciphertext of all groups of data to be encrypted in a block chain. According to the invention, the new chaotic sequence corresponding to the data to be encrypted is selected in a self-adaptive manner, so that the encryption complexity is increased, and the security of large-scale data storage of the network is improved.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a network large-scale data security storage method.
Background
The secure storage demand of network large-scale data comes from the explosive growth of data, wherein with the development of cloud computing, internet of things and artificial intelligence technology, a large amount of data containing sensitive information such as personal privacy, business confidentiality and scientific research technology is continuously generated, and the encryption demand of the network large-scale data is generated for the secure storage of the large-scale data. The block chain is a decentralization storage technology, and by constructing a plurality of nodes and storing data to be stored to all the block chain nodes, the safe storage of large-scale data of the network can be ensured without malicious tampering and attack because more than half of nodes need to be agreed to be obtained for data modification. The blockchain needs to broadcast the data of each node to all nodes of the blockchain so that the data is published to each blockchain node, thus creating a need for encryption of the blockchain data. The network large-scale data is encrypted by using a logics chaotic encryption algorithm.
The chaotic encryption algorithm is an algorithm which realizes encryption by giving an initial value and setting selection conditions so as to transform the numerical value or the data position of data, and has the advantages of simple calculation and random key selection compared with the traditional encryption algorithm when encrypting large-scale data.
The existing problems are as follows: because the chaotic encryption algorithm of logics has smaller given range of parameters and has only one dimension of key selectivity in the process of encrypting plaintext data by generating the chaotic sequence, the generated chaotic sequence has no higher complexity, namely the key space is smaller, so that the security of the encryption algorithm is greatly reduced, the possibility of being cracked exists, and the security of large-scale data storage of a network is reduced.
Disclosure of Invention
The invention provides a network large-scale data security storage method, which aims to solve the existing problems.
The invention relates to a network large-scale data security storage method which adopts the following technical scheme:
One embodiment of the present invention provides a network large-scale data security storage method, which includes the following steps:
Acquiring a binary data sequence corresponding to the network large-scale data; the binary data sequence comprises a plurality of groups of data to be encrypted, and each group of data to be encrypted consists of a plurality of binary numbers;
obtaining a total chaotic sequence according to the binary data sequence; obtaining a shift demand index of each group of data to be encrypted according to the data of each group of data to be encrypted corresponding to the total chaotic sequence;
Obtaining standard isolated prominence degree of each group of data to be encrypted according to the length of each group of data to be encrypted and the data of the data to be encrypted corresponding to the total chaotic sequence;
Obtaining the displacement necessity of each group of data to be encrypted according to the displacement demand index and the standard isolated prominence degree of each group of data to be encrypted;
Obtaining ciphertext of each group of data to be encrypted according to the shifting necessity of all groups of data to be encrypted; the ciphertext of all sets of data to be encrypted is stored in the blockchain.
Further, the method for obtaining the total chaotic sequence according to the binary data sequence comprises the following specific steps:
the normalized value of one decimal number converted from the first 8 digits in the binary data sequence is recorded as an initial value ；
According to the initial valuePreset parameters/>Iteration is carried out by using an iteration formula in a logistic chaotic encryption model, so that a length of/> isobtainedIs a pseudo-random number sequence of (a); said/>Is a preset cut-off number;
And obtaining the total chaotic sequence according to the size of the pseudo random number in the pseudo random number sequence.
Further, the method for obtaining the total chaotic sequence according to the size of the pseudo random number in the pseudo random number sequence comprises the following specific steps:
In the pseudo-random number sequence, the pseudo-random number larger than or equal to a preset judgment threshold value is recorded as 1, and the pseudo-random number smaller than the preset judgment threshold value is recorded as 0, so that a total chaotic sequence is formed.
Further, the step of obtaining the shift requirement index of each group of data to be encrypted according to the data of each group of data to be encrypted corresponding to the total chaotic sequence comprises the following specific steps:
Will be the first The sequence value of all binary numbers in the binary data sequence in the group of data to be encrypted is recorded as a target sequence value;
in the total chaotic sequence, the sequence formed by the data corresponding to all target sequence values is marked as the first A chaotic sequence of group data to be encrypted;
According to the first The number of 0 values in the chaotic sequence of the group of data to be encrypted and the maximum value of the length of the continuous 0 values are obtained to obtain the/>A shift requirement index for the set of data to be encrypted.
Further, according to the firstThe number of 0 values in the chaotic sequence of the group of data to be encrypted and the maximum value of the length of the continuous 0 values are obtained to obtain the/>The shift requirement index of the group data to be encrypted comprises the following specific steps:
Will be the first The maximum value of the length of continuous 0 values in the chaotic sequence of the group data to be encrypted is recorded as a first characteristic;
Calculate the first feature and the first feature The product of the number of 0 values in the chaotic sequence of the data to be encrypted is recorded as a normalized value of the productA shift requirement index for the set of data to be encrypted.
Further, according to the length of each group of data to be encrypted and the data of the data to be encrypted corresponding to the total chaotic sequence, the standard isolation prominence degree of each group of data to be encrypted is obtained, and the method comprises the following specific steps:
Will be the first Ordinal values of a first binary number in the group of data to be encrypted in a binary data sequence are recorded as first ordinal values;
In the total chaotic sequence, the statistics are performed sequentially from the first ordinal value A sequence formed by the data is marked as a reference sequence; wherein/>For a preset range coefficient,/>For/>A length of the group of data to be encrypted;
Aliquoting the reference sequence into A plurality of reference sequence segments;
Will be the first Number of 0 values in chaotic sequence of group data to be encrypted/>Is marked as a first ratio;
Counting the number of 0 values in each reference sequence segment, in which the reference sequence is to be preceded Average of the number of 0 values in each reference sequence segment and/>Is noted as a second ratio;
the absolute value of the difference between the first ratio and the second ratio is recorded as the first ratio Group data to be encrypted at/>The isolated degree of protrusion/>；
Will beAll/>, whenThe sequence formed is marked as an isolated salience sequence; said/>Is a preset convergence parameter sequence;
obtaining the first according to the data size in the isolated salience sequence Standard orphaned prominence of the group of data to be encrypted.
Further, the first step is obtained according to the data size in the isolated salience sequenceThe standard isolated prominence of the group of data to be encrypted comprises the following specific steps:
When the data which is larger than or equal to the preset judging threshold value exists in the isolated salient degree sequence, the first data which is larger than or equal to the preset judging threshold value in the isolated salient degree sequence is recorded as the first data Standard isolated prominence of the group of data to be encrypted;
When no data which is larger than or equal to a preset judging threshold value exists in the isolated salient degree sequence, the maximum value in the isolated salient degree sequence is recorded as the first Standard orphaned prominence of the group of data to be encrypted.
Further, the step of obtaining the shift necessity of each group of data to be encrypted according to the shift requirement index and the standard isolated prominence of each group of data to be encrypted comprises the following specific steps:
Calculate the first Normalized values of inverse proportion of standard isolated salience of the set of data to be encrypted, said normalized values being related to the/>The product of the shift requirement indexes of the set of data to be encrypted is denoted as/>The necessity of shifting the group of data to be encrypted.
Further, according to the shifting necessity of all the groups of data to be encrypted, ciphertext of each group of data to be encrypted is obtained, which comprises the following specific steps:
Among all groups of data to be encrypted, marking a group of data to be encrypted with the largest displacement necessity as standard data to be encrypted;
In the binary data sequence, statistics of Distance/>, of separation between group to-be-encrypted data and standard to-be-encrypted data；
Adding each target sequence value toThe sum of which is recorded as the value of each updated target sequence;
According to all updated target sequence values Group data to be encrypted to obtain the/>And (3) setting ciphertext of data to be encrypted.
Further, the method comprises updating the target sequence value according to all the updateGroup data to be encrypted to obtain the/>The ciphertext of the group data to be encrypted comprises the following specific steps:
In the total chaotic sequence, the sequence formed by the data corresponding to all the updated target sequence values is marked as the first A new chaotic sequence of the data to be encrypted;
For the first New chaotic sequence and/>, of group data to be encryptedPerforming exclusive OR operation on the group to-be-encrypted data to obtain the/>And (3) setting ciphertext of data to be encrypted.
The technical scheme of the invention has the beneficial effects that:
In the embodiment of the invention, a binary data sequence corresponding to large-scale data of a network is obtained, the binary data sequence comprises a plurality of groups of data to be encrypted, a total chaotic sequence is obtained according to the binary data sequence, a displacement demand index and standard isolation prominence degree of each group of data to be encrypted are obtained according to the data of each group of data to be encrypted corresponding to the total chaotic sequence, so that the displacement necessity of each group of data to be encrypted is obtained, the displacement necessity is analyzed according to the number of 0 values and the continuously occurring length in the chaotic sequence corresponding to the data to be encrypted, the specific good encryption effect of the displaced new chaotic sequence to the data to be encrypted is ensured, the encryption complexity is improved, the ciphertext of each group of data to be encrypted is obtained according to the displacement necessity of all groups of data to be encrypted, the encryption processing is carried out on the data to be encrypted by using the displaced new chaotic sequence, the safety of the ciphertext is improved, and the ciphertext of all groups of data to be encrypted is stored in a block chain. According to the invention, the new chaotic sequence corresponding to the data to be encrypted is selected in a self-adaptive manner, so that the encryption complexity is increased, and the security of large-scale data storage of the network is improved.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of steps of a method for secure storage of large-scale data in a network according to the present invention;
fig. 2 is a flowchart of ciphertext acquisition in the present embodiment.
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 implementation, structure, characteristics and effects of a network large-scale 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 network large-scale data security storage method provided by the invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart illustrating steps of a method for securely storing large-scale data in a network according to an embodiment of the present invention is shown, the method includes the following steps:
Step S001: acquiring a binary data sequence corresponding to the network large-scale data; the binary data sequence comprises a plurality of groups of data to be encrypted, and each group of data to be encrypted consists of a plurality of binary numbers.
The purpose of this embodiment is to encrypt the network large-scale data, so as to realize the secure storage of the network large-scale data, so that the embodiment needs to acquire the data to be encrypted first. Specifically, in this embodiment, the collected network large-scale data is first stored on the blockchain node, then the data to be encrypted and stored on the blockchain node is collected, the data is in a binary form at the blockchain node, each 8 binary is a byte, and the binary data is used as the data to be encrypted. The acquired binary data sequence corresponding to the network large-scale data is obtained, and the binary data sequence consists of a plurality of groups of data to be encrypted. The blockchain is a known technology, and specific methods are not described herein.
What needs to be described is: the cloud-end stored data are converted into binary forms of a plurality of bytes through encoding, each byte comprises 8-bit binary numbers, so that the binary forms of the plurality of bytes of the same data are recorded as a group of data to be encrypted, each group of data to be encrypted comprises a plurality of binary numbers, and the number of the binary numbers is a multiple of 8.
Step S002: obtaining a total chaotic sequence according to the binary data sequence; and obtaining the shift requirement index of each group of data to be encrypted according to the data of each group of data to be encrypted corresponding to the total chaotic sequence.
The known logics chaotic encryption algorithm changes the numerical value of plaintext data by carrying out exclusive-or operation on a chaotic sequence and plaintext, so as to encrypt the data, and the rule when carrying out exclusive-or on binary data is as follows: the 0 × 0=0, 1 × 1=0, 1 × 0=1, wherein the × sign is adopted, so that half of the exclusive-or result is possibly the same as the original data, if the binary value in each byte is excessively the same as the binary value of the chaotic sequence, the ciphertext encrypted by part of the bytes may be similar to or even the same as the plaintext, the ciphertext similar to or the same as the plaintext is used as the known correspondence between the plaintext and the ciphertext, and the known plaintext attack, the chosen plaintext attack and the network chosen plaintext attack algorithm are combined, and since the chaotic sequence of the logic chaotic encryption algorithm is generated iteratively, the secret key can be obtained by reversible pushing, therefore, the embodiment adaptively adjusts the chaotic sequence used by encryption of each byte according to the similarity between the plaintext of the data to be encrypted and the chaotic sequence, thereby improving the encryption security, and avoiding the ciphertext and the plaintext from being similar or the same. The logic chaotic encryption algorithm is a known technology, and a specific method is not described herein.
Known logics chaotic encryption model comprises initial valueSum parameter/>In this embodiment, the data obtained by converting the binary system of the first 8-bit byte in the binary data sequence into decimal system and normalizing is used as the initial value/>Wherein the normalization process is performed using a Norm () linear normalization function, the preset parameter/>, of the present embodimentPreset intercept numberPreset judgment threshold/>This is described as an example, but other values may be set in other embodiments, and the present example is not limited thereto. It is noted that the cut-off number/>Should be greater than the length of the binary data sequence, the length of the sequence representing the amount of data in the sequence. From the initial value/>Starting iteration, wherein an iteration formula of the pseudo-random number sequence is as follows:
Wherein the method comprises the steps of And/>For/>Sum/>Pseudo random number,/>For preset parameters,/>Is a preset cut-off number. Thereby obtaining a pseudo-random number sequence/>Wherein/>、/>/>The 1 st, 2 nd and nth pseudorandom numbers, respectively. In the pseudo-random number sequence, the pseudo-random number larger than or equal to a preset judgment threshold value is recorded as 1, and the pseudo-random number smaller than the preset judgment threshold value is recorded as 0, so that a total chaotic sequence is formed. The acquisition process of the pseudo random number sequence is a well-known process in the encryption process of the logistic chaotic encryption model. I.e. according to the initial/>Sum parameter/>And iterating by using an iteration formula in the logistic chaotic encryption model to obtain a pseudo-random number sequence.
When one pseudo random number in the total chaotic sequence is 0, the random number exists/>The ciphertext is identical to the plaintext, so that the embodiment judges the data to be encrypted according to the number of times that the data to be encrypted corresponds to 0 in the total chaotic sequence, obtains the data to be encrypted which meets the requirement that the plaintext is identical to the ciphertext, and obtains the data to be encrypted which needs to be shifted and replaced in the data to be encrypted according to the quantity and the distribution of the identical data to be encrypted.
Further, when a plurality of 0 s exist in the chaotic sequence corresponding to each group of data to be encrypted, more ciphertext is identical to plaintext, so that a coding 0 value corresponding to the total chaotic sequence corresponding to each group of data to be encrypted needs to be obtained first, and a shift requirement index of each group of data is obtained according to the number of the coding 0 values corresponding to each group of data to be encrypted in the total chaotic sequence.
In the first placeFor example, the group to be encrypted data will be the/>The sequence value of all binary numbers in the set of data to be encrypted in the binary data sequence is recorded as a target sequence value. In the total chaotic sequence, the sequence formed by data corresponding to all target sequence values is marked as the/>A chaotic sequence of sets of data to be encrypted.
From this, it can be seen thatThe calculation formula of the shift requirement index of the group of data to be encrypted is as follows:
Wherein, For/>Shift requirement index of group data to be encrypted,/>For/>Number of 0 values in chaotic sequence of group data to be encrypted,/>For/>Maximum value of continuous 0 value length in chaotic sequence of group data to be encrypted,/>For/>And the function is used for carrying out normalization processing on the data. First/>The greater the number of 0 values in the chaotic sequence of the set of data to be encrypted, the greater the number of 0 values in the chaotic sequence of the set of data to be encryptedThe more the group of data to be encrypted is encrypted by the chaotic sequence, the same number as the data to be encrypted is, namely the/>The higher the similarity of the ciphertext of the group of data to be encrypted and the plaintext is, the easier the ciphertext is to be cracked by the coincidental attack, so that the key shift of the chaotic sequence is required. First/>The longer the continuous 0 value in the chaotic sequence of the group of data to be encrypted is, the encrypted ciphertext is possibly identical with the plaintext after being subjected to inverse transformation coding, so that the easier the ciphertext is selected as the corresponding relation between the plaintext and the ciphertext of the coincidence attack, the attack resistance is reduced, and the larger the shifting requirement is.
What needs to be described is: if at firstThe chaos sequence of the group data to be encrypted is 00011010001001, the continuous 0 value length is 3, 1, 3 and 2 respectively, and/>3.
Step S003: and obtaining the standard isolation prominence degree of each group of data to be encrypted according to the length of each group of data to be encrypted and the data of the data to be encrypted corresponding to the total chaotic sequence.
Further, if the firstThe length of the group of data to be encrypted is shorter, and the encoding 0 value existing in the chaotic sequence of other groups of data to be encrypted adjacent to the group of data to be encrypted is smaller in all the data to be encrypted, so that the/>The group data to be encrypted is used as the special condition of the neighborhood, even if the group data to be encrypted is highly similar to the plaintext after being encrypted, the group data to be encrypted is not used as the continuous highly similar plaintext, so that the difficulty of selecting the corresponding relation of the plaintext and ciphertext as the coincidence attack is high, namely the difficulty of forced cracking is high, the shifting operation is not needed, and even if the shifting requirement index is high, the group data to be encrypted is needed to be abandoned to reduce the computational complexity of encryption and decryption.
Specifically, according to the similarity of the coding 0 value of each group of data to be encrypted and the adjacent data, an isolation penalty term of each group of data is obtained and is recorded as the isolation prominence degree of each group of data to be encrypted. Then the firstThe method for acquiring the isolated prominence of the group of data to be encrypted comprises the following steps:
Will be the first The ordinal value of the first binary number in the set of data to be encrypted in the binary data sequence is noted as the first ordinal value. In the total chaotic sequence, the statistics of the sequence from the first ordinal value are counted/>The sequence formed by the data is marked as a reference sequence, and the reference sequence is equally divided into/>Each reference sequence segment. Wherein/>For/>The length of the group of data to be encrypted, i.e./>The number of binary digits in the set of data to be encrypted. /(I)For the preset range coefficient, in this embodiment/>20, Preset convergence parameter sequence/>In the description of this example, other values may be set in other embodiments, and the present example is not limited thereto.
Then the firstGroup data to be encrypted at/>The following calculation formula of the isolated saliency is:
Wherein, For/>Group data to be encrypted at/>The degree of isolated protrusion,/>For a preset convergence parameter sequence,/>For a preset range coefficient,/>For/>Number of 0 values in chaotic sequence of group data to be encrypted,/>For/>Length of group data to be encrypted,/>For/>Number of 0 values in each reference sequence segment,/>As an absolute value function, it should be noted that, since the lengths of each group of data to be encrypted in the data to be encrypted are different, only the/>, is used in calculating the isolated saliencyThe length of the group of data to be encrypted is a dividing length, the chaotic sequence corresponding to the subsequent adjacent binary numbers is divided into a plurality of reference sequence segments, and the representation of convergence parameters is from the/>Group data to be encrypted backward/>And (4)/>And the chaotic sequence corresponding to other data to be encrypted with the same length as the group of data to be encrypted. /(I)Represents the/>Encoding a 0 value and a value in/>, in a chaotic sequence of the set of data to be encryptedIn the range below, the ratio difference of the numbers of coded 0 values indicates that the larger the value isThe group belongs to the individual approximate data to be encrypted, and the security of encryption is enhanced without shifting.
Thereby obtaining isolated salience degree sequencesWherein/>、/>/>Respectively represent the/>Group data to be encrypted is 1,2 and/>The degree of isolated prominence under.
Sequences of isolated salienceThe first one of (3) is greater than or equal to/>Is denoted as (I) >Standard isolated prominence/>, of group data to be encrypted; When the salience degree sequence/>Is not greater than/>Will isolate the saliency sequence/>The maximum value of (2) is denoted as (I)Standard isolated prominence/>, of group data to be encrypted. Wherein/>Is a preset judgment threshold value.
What needs to be described is: when (when)When describing convergence parameters/>Within the neighborhood of the lower part, the/>The group of data to be encrypted is outstanding compared to the data to be encrypted in the adjacent range, then no shift operation is needed, then/>; When (when)When describing convergence parameters/>Within the neighborhood of the lower part, the/>The value of the coding 0 in the chaotic sequence corresponding to the group of data to be encrypted and the data to be encrypted in the adjacent domain is approximate, namely the/>Group data to be encrypted at convergence parameter/>None of the neighborhood regions is highlighted, and the judgment is continuedThe degree of isolated protrusion under the condition of/>When the convergence is completed, none of the representations is highlighted, and the maximum value is taken as/>。
Step S004: and obtaining the displacement necessity of each group of data to be encrypted according to the displacement demand index and the standard isolated prominence degree of each group of data to be encrypted.
From this, it can be seen thatThe calculation formula of the shift necessity of the group data to be encrypted is:
Wherein, For/>Shift requirement index of group data to be encrypted,/>For/>Standard isolated prominence of group data to be encrypted,/>For/>Shift necessity of group data to be encrypted,/>The present embodiment uses/>, as an exponential function based on natural constantsTo present inverse proportion relation and normalization processing, and the implementer can set inverse proportion function and normalization function according to actual situation. What needs to be described is: taking the isolated salience degree as a penalty term of a shift requirement index to obtain shift necessity,/>The larger the more movement is required.
In the above manner, the necessity of shifting of each set of data to be encrypted is obtained.
Step S005: obtaining ciphertext of each group of data to be encrypted according to the shifting necessity of all groups of data to be encrypted; the ciphertext of all sets of data to be encrypted is stored in the blockchain.
And (3) among all the groups of data to be encrypted, marking the group of data to be encrypted with the largest shift necessity as standard data to be encrypted.
What needs to be described is: if there are multiple groups of data to be encrypted with the largest shift necessity, one group is selected as standard data to be encrypted.
In the binary data sequence, statistics ofDistance/>, of separation between group to-be-encrypted data and standard to-be-encrypted dataI.e. the number of binary numbers between the two.
Known as (i)Ordinal values of all binary numbers in the set of data to be encrypted in the binary data sequence are recorded as target ordinal values, and each target ordinal value is added with/>The sum of which is recorded as the value of each updated target sequence;
In the total chaotic sequence, the sequence formed by the data corresponding to all the updated target sequence values is marked as the first A new chaotic sequence of sets of data to be encrypted.
What needs to be described is: the closer the distance standard data to be encrypted is, namely the less the data need to be moved, the iteration is continued when the data quantity in the total chaotic sequence is insufficient, and the length of the total chaotic sequence is increased until the requirement is met.
For the firstNew chaotic sequence and/>, of group data to be encryptedPerforming exclusive OR operation on the group to-be-encrypted data to obtain the/>And (3) setting ciphertext of data to be encrypted. Wherein the exclusive-or operation is a well-known technique, and the specific method is not described herein.
And obtaining the ciphertext of each group of data to be encrypted according to the mode. The ciphertext obtaining flow is shown in fig. 2.
The ciphertext of all sets of data to be encrypted is stored in the blockchain.
What needs to be described is: the key includes an initial valuePreset parameters/>Preset judgment threshold/>And standard data to be encrypted in a binary data sequence. The decryption method is that according to the initial value/>Preset parameters/>Preset judgment thresholdGenerating a total chaotic sequence, acquiring a new chaotic sequence of each group of data to be encrypted in the total chaotic sequence according to the interval distance between each group of data to be encrypted and standard data to be encrypted in the binary data sequence and the ordinal value corresponding to binary numbers in each group of data to be encrypted, and performing decryption operation by using the new chaotic sequence and ciphertext.
The present invention has been completed.
In summary, in the embodiment of the present invention, a binary data sequence corresponding to large-scale data of a network is obtained, the binary data sequence includes a plurality of groups of data to be encrypted, a total chaotic sequence is obtained according to the binary data sequence, a shift requirement index and a standard isolation prominence degree of each group of data to be encrypted are obtained according to the data of each group of data to be encrypted corresponding to the total chaotic sequence, so that a shift necessity of each group of data to be encrypted is obtained, a ciphertext of each group of data to be encrypted is obtained according to the shift necessity of all groups of data to be encrypted, and the ciphertext of all groups of data to be encrypted is stored in a blockchain. According to the invention, the new chaotic sequence corresponding to the data to be encrypted is selected in a self-adaptive manner, so that the encryption complexity is increased, and the security of large-scale data storage of the network is improved.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the invention, but any modifications, equivalent substitutions, improvements, etc. within the principles of the present invention should be included in the scope of the present invention.
Claims (10)
1. A method for securely storing large-scale data in a network, the method comprising the steps of:
Acquiring a binary data sequence corresponding to the network large-scale data; the binary data sequence comprises a plurality of groups of data to be encrypted, and each group of data to be encrypted consists of a plurality of binary numbers;
obtaining a total chaotic sequence according to the binary data sequence; obtaining a shift demand index of each group of data to be encrypted according to the data of each group of data to be encrypted corresponding to the total chaotic sequence;
Obtaining standard isolated prominence degree of each group of data to be encrypted according to the length of each group of data to be encrypted and the data of the data to be encrypted corresponding to the total chaotic sequence;
Obtaining the displacement necessity of each group of data to be encrypted according to the displacement demand index and the standard isolated prominence degree of each group of data to be encrypted;
Obtaining ciphertext of each group of data to be encrypted according to the shifting necessity of all groups of data to be encrypted; the ciphertext of all sets of data to be encrypted is stored in the blockchain.
2. The method for safely storing the network large-scale data according to claim 1, wherein the step of obtaining the total chaotic sequence according to the binary data sequence comprises the following specific steps:
the normalized value of one decimal number converted from the first 8 digits in the binary data sequence is recorded as an initial value ；
According to the initial valuePreset parameters/>Iteration is carried out by using an iteration formula in a logistic chaotic encryption model, so that a length of/> isobtainedIs a pseudo-random number sequence of (a); said/>Is a preset cut-off number;
And obtaining the total chaotic sequence according to the size of the pseudo random number in the pseudo random number sequence.
3. The method for safely storing the network large-scale data according to claim 2, wherein the step of obtaining the total chaotic sequence according to the size of the pseudo random number in the pseudo random number sequence comprises the following specific steps:
In the pseudo-random number sequence, the pseudo-random number larger than or equal to a preset judgment threshold value is recorded as 1, and the pseudo-random number smaller than the preset judgment threshold value is recorded as 0, so that a total chaotic sequence is formed.
4. The method for securely storing large-scale data in a network according to claim 1, wherein the step of obtaining the shift requirement index of each group of data to be encrypted according to the data of each group of data to be encrypted corresponding to the total chaotic sequence comprises the following specific steps:
Will be the first The sequence value of all binary numbers in the binary data sequence in the group of data to be encrypted is recorded as a target sequence value;
in the total chaotic sequence, the sequence formed by the data corresponding to all target sequence values is marked as the first A chaotic sequence of group data to be encrypted;
According to the first The number of 0 values in the chaotic sequence of the group of data to be encrypted and the maximum value of the length of the continuous 0 values are obtained to obtain the/>A shift requirement index for the set of data to be encrypted.
5. The method for secure storage of network large-scale data according to claim 4, wherein said step ofThe number of 0 values in the chaotic sequence of the group of data to be encrypted and the maximum value of the length of the continuous 0 values are obtained to obtain the/>The shift requirement index of the group data to be encrypted comprises the following specific steps:
Will be the first The maximum value of the length of continuous 0 values in the chaotic sequence of the group data to be encrypted is recorded as a first characteristic;
Calculate the first feature and the first feature The product of the number of 0 values in the chaotic sequence of the data to be encrypted is recorded as a normalized value of the productA shift requirement index for the set of data to be encrypted.
6. The method for securely storing large-scale data in a network according to claim 1, wherein the obtaining the standard isolated prominence of each group of data to be encrypted according to the length of each group of data to be encrypted and the data of the data to be encrypted corresponding to the total chaotic sequence comprises the following specific steps:
Will be the first Ordinal values of a first binary number in the group of data to be encrypted in a binary data sequence are recorded as first ordinal values;
In the total chaotic sequence, the statistics are performed sequentially from the first ordinal value A sequence formed by the data is marked as a reference sequence; wherein/>For a preset range coefficient,/>For/>A length of the group of data to be encrypted;
Aliquoting the reference sequence into A plurality of reference sequence segments;
Will be the first Number of 0 values in chaotic sequence of group data to be encrypted/>Is marked as a first ratio;
Counting the number of 0 values in each reference sequence segment, in which the reference sequence is to be preceded Average of the number of 0 values in each reference sequence segment and/>Is noted as a second ratio;
the absolute value of the difference between the first ratio and the second ratio is recorded as the first ratio Group data to be encrypted at/>Degree of isolated protrusion under；
Will beAll/>, whenThe sequence formed is marked as an isolated salience sequence; said/>Is a preset convergence parameter sequence;
obtaining the first according to the data size in the isolated salience sequence Standard orphaned prominence of the group of data to be encrypted.
7. The method for securely storing large-scale data in a network according to claim 6, wherein the first data is obtained based on the size of the data in the isolated saliency sequenceThe standard isolated prominence of the group of data to be encrypted comprises the following specific steps:
When the data which is larger than or equal to the preset judging threshold value exists in the isolated salient degree sequence, the first data which is larger than or equal to the preset judging threshold value in the isolated salient degree sequence is recorded as the first data Standard isolated prominence of the group of data to be encrypted;
When no data which is larger than or equal to a preset judging threshold value exists in the isolated salient degree sequence, the maximum value in the isolated salient degree sequence is recorded as the first Standard orphaned prominence of the group of data to be encrypted.
8. The method for securely storing large-scale data in a network according to claim 1, wherein the step of obtaining the shift necessity of each group of data to be encrypted according to the shift requirement index and the standard isolated prominence of each group of data to be encrypted comprises the following specific steps:
Calculate the first Normalized values of inverse proportion of standard isolated prominence of the set of data to be encrypted, the normalized values being compared with a firstThe product of the shift requirement indexes of the set of data to be encrypted is denoted as/>The necessity of shifting the group of data to be encrypted.
9. The method for securely storing large-scale data in a network according to claim 4, wherein the step of obtaining ciphertext of each group of data to be encrypted according to the shift necessity of all groups of data to be encrypted comprises the following steps:
Among all groups of data to be encrypted, marking a group of data to be encrypted with the largest displacement necessity as standard data to be encrypted;
In the binary data sequence, statistics of Distance/>, of separation between group to-be-encrypted data and standard to-be-encrypted data；
Adding each target sequence value toThe sum of which is recorded as the value of each updated target sequence;
According to all updated target sequence values Group data to be encrypted to obtain the/>And (3) setting ciphertext of data to be encrypted.
10. The method of claim 9, wherein the updating the target sequence value and the first step are performed according to all the updated target sequence valuesGroup data to be encrypted to obtain the/>The ciphertext of the group data to be encrypted comprises the following specific steps:
In the total chaotic sequence, the sequence formed by the data corresponding to all the updated target sequence values is marked as the first A new chaotic sequence of the data to be encrypted;
For the first New chaotic sequence and/>, of group data to be encryptedPerforming exclusive OR operation on the group to-be-encrypted data to obtain the/>And (3) setting ciphertext of data to be encrypted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410345600.5A CN117955736B (en) | 2024-03-26 | 2024-03-26 | Network large-scale data security storage method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410345600.5A CN117955736B (en) | 2024-03-26 | 2024-03-26 | Network large-scale data security storage method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117955736A true CN117955736A (en) | 2024-04-30 |
| CN117955736B CN117955736B (en) | 2024-06-04 |
Family
ID=90794483
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410345600.5A Active CN117955736B (en) | 2024-03-26 | 2024-03-26 | Network large-scale data security storage method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117955736B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112187440A (en) * | 2020-09-24 | 2021-01-05 | 南京晓庄学院 | Hyperchaotic coupled signal modulation system and method based on double couplers and storage medium |
| CN114553391A (en) * | 2022-03-18 | 2022-05-27 | 南通大学 | Character string encryption method based on hierarchical shift |
| CN115622795A (en) * | 2022-11-15 | 2023-01-17 | 青岛以萨数据技术有限公司 | File encryption method based on chaotic encryption algorithm, electronic equipment and storage medium |
| US20230093437A1 (en) * | 2020-03-06 | 2023-03-23 | Intelligens Technológiák Kft. | Scrambler Apparatus And Method In Particular For Cryptographic Applications, And Descrambler Apparatus And Method Therefor |
-
2024
- 2024-03-26 CN CN202410345600.5A patent/CN117955736B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20230093437A1 (en) * | 2020-03-06 | 2023-03-23 | Intelligens Technológiák Kft. | Scrambler Apparatus And Method In Particular For Cryptographic Applications, And Descrambler Apparatus And Method Therefor |
| CN112187440A (en) * | 2020-09-24 | 2021-01-05 | 南京晓庄学院 | Hyperchaotic coupled signal modulation system and method based on double couplers and storage medium |
| CN114553391A (en) * | 2022-03-18 | 2022-05-27 | 南通大学 | Character string encryption method based on hierarchical shift |
| CN115622795A (en) * | 2022-11-15 | 2023-01-17 | 青岛以萨数据技术有限公司 | File encryption method based on chaotic encryption algorithm, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117955736B (en) | 2024-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115272502B (en) | Software research and development data security management method based on code conversion | |
| CN107578452B (en) | JPEG image encryption method with compatible format and invariable size | |
| CN115694784A (en) | Data safety storage method | |
| CN116775589A (en) | Data security protection method for network information | |
| CN115659409B (en) | Financial asset transaction data safe storage method | |
| CN112597519B (en) | Non-key decryption method based on convolutional neural network in OFDM encryption system | |
| CN110086600B (en) | Image encryption method based on hyperchaotic system and variable step length Joseph problem | |
| CN116522300B (en) | Intelligent management system for electronic seal | |
| CN111478885B (en) | Asymmetric encryption and decryption method, equipment and storage medium | |
| CN115426101B (en) | Data transmission method of cloud intercommunication platform | |
| CN115296862B (en) | Network data safety transmission method based on data coding | |
| CN106230578A (en) | A kind of three-dimensional Lorenz processed based on weighting maps the safe arithmetic coding method of binary system controlled | |
| CN116796354B (en) | Information security enhancement method for computer system | |
| CN114157433B (en) | Encryption method and system for chaotic optical communication system with secret key and plaintext associated | |
| CN117195274B (en) | Format file anti-fake method and system | |
| CN116996628B (en) | Network data transmission protection method | |
| CN117793267A (en) | Privacy protection method and system for passenger data | |
| CN117955736B (en) | Network large-scale data security storage method | |
| CN116720211B (en) | Dynamic monitoring data security encryption method for heart rehabilitation | |
| CN115333720B (en) | Data transmission method for call center | |
| CN115834062A (en) | Enterprise data transmission encryption method for data hosting service | |
| Chen et al. | Adaptive Coding and Ordered-Index Extended Scrambling Based RDH in Encrypted Images | |
| Abdoun | Design, implementation and analysis of keyed hash functions based on chaotic maps and neural networks | |
| CN115765963A (en) | Text image audit information recording and extracting method based on reversible steganography of ciphertext domain | |
| CN114726497A (en) | Fractal sequencing and DNA chaotic image encryption method based on multi-target mayflies optimization |
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 |