CN113328859B - Information dispersion processing method - Google Patents
Information dispersion processing method Download PDFInfo
- Publication number
- CN113328859B CN113328859B CN202110428242.0A CN202110428242A CN113328859B CN 113328859 B CN113328859 B CN 113328859B CN 202110428242 A CN202110428242 A CN 202110428242A CN 113328859 B CN113328859 B CN 113328859B
- Authority
- CN
- China
- Prior art keywords
- information
- processing
- node
- block
- processed
- 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
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000010130 dispersion processing Methods 0.000 title claims description 18
- 230000000903 blocking effect Effects 0.000 claims abstract description 18
- 239000006185 dispersion Substances 0.000 claims abstract description 12
- 230000008569 process Effects 0.000 claims abstract description 12
- 238000003672 processing method Methods 0.000 claims abstract description 11
- 230000005540 biological transmission Effects 0.000 claims description 39
- 230000011218 segmentation Effects 0.000 claims description 31
- 239000013598 vector Substances 0.000 claims description 22
- 230000000739 chaotic effect Effects 0.000 claims description 16
- 101100457838 Caenorhabditis elegans mod-1 gene Proteins 0.000 claims description 9
- 101150110972 ME1 gene Proteins 0.000 claims description 9
- 230000007704 transition Effects 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 6
- 125000004432 carbon atom Chemical group C* 0.000 claims description 3
- 239000000284 extract Substances 0.000 claims description 3
- 238000011084 recovery Methods 0.000 claims description 3
- 238000004458 analytical method Methods 0.000 abstract description 3
- 230000009286 beneficial effect Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 4
- 230000010365 information processing Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000009466 transformation Effects 0.000 description 1
Images
Classifications
-
- 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
- H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides a processing method for information dispersion, which comprises the following steps: determining processing nodes with scattered information; the distribution node performs information blocking processing on the information to be processed; when information blocking processing is carried out, the adopted irreducible polynomial and the digits of the irreducible polynomial are determined by random selection; and respectively transmitting the obtained information blocks to corresponding processing nodes, and processing by the processing nodes. The processing method for information dispersion provides a more variable processing method for realizing information dispersion, and the scheme adopts random selection of irreducible polynomial digits and irreducible polynomial types to disperse information, so that the processing process is more complicated and variable, the analysis difficulty of an attacker is increased, and the information dispersion safety is improved.
Description
Technical Field
The invention relates to the technical field of information dispersion processing, in particular to a processing method for information dispersion.
Background
The existing information dispersion processing method generally adopts a Shamir encryption sharing technology to perform dispersion processing on information, and generally performs transformation processing on data through a fixed linear equation set, wherein the Shamir encryption sharing technology specifically comprises the following steps:
if for n sharing nodes { U1，U2，…，UnT as threshold value, s as encryption, p as a large prime number, X1，X2，…，XnBesides encryption s, other parameter information is disclosed for the identity information of the corresponding sharing node (processing node); when in encryption distribution, the encryption distribution node D randomly selects a t-1 degree polynomial f (x) a on GF (p)0+a1x+a2x2+…+at-1xt- 1modp，aiE.g. GF (p), meets the requirement f (0) ═ a0The distributing node D computes an encrypted share si＝f(xi) I is 1, 2 …, n, and s isiDistribute to participating nodes Ui(ii) a When the encryption is recovered, assume t participating nodes { U1，U2，…，UtAnd (4) trying to recover encryption, distributing own encryption share by the participating nodes and constructing by utilizing a Lagrange interpolation polynomial algorithm:
the encryption is calculated to yield:
the encryption sharing scheme of Shamir meets basic threshold requirements:
(1) participating nodes holding t or more than t encrypted shares may recover the encryption;
(2) less than t, encryption cannot be obtained.
However, when the existing information dispersion is calculated by using a fixed linear equation set, the information processing method is single, irreducible polynomials are fixed, and binary domain bits are fixed, so that the attack is easy to occur.
Disclosure of Invention
In order to solve the above technical problem, the present invention provides an information dispersion processing method, including:
determining processing nodes with scattered information;
the distribution node performs information blocking processing on the information to be processed; when information blocking processing is carried out, the adopted irreducible polynomial and the digits of the irreducible polynomial are determined by random selection;
and respectively transmitting the obtained information blocks to corresponding processing nodes, and processing by the processing nodes.
Optionally, the information blocking process includes the following steps:
when information is processed in a blocking mode, the distribution node extracts data characteristics of information to be processed, and performs data dispersion processing on the information to be processed according to the data characteristics by using a preset segmentation rule to obtain information blocks;
selecting a corresponding random number for the information block; forming a filled prefabricated factor according to the selected random number; carrying out XOR operation on the information block and the prefabricated factor to obtain a data combination block;
selecting random factors for the processing nodes according to the preset filling rule; and after matching operation is carried out on the random factors and the prefabricated factors, the data combination blocks obtained by information block processing are transmitted to the processing nodes of the corresponding random factors according to the operation matching result.
Optionally, after receiving the encrypted information block, the processing node determines whether the received information block is valid by checking whether the equality is satisfied, and if the equality is not satisfied, the received information block is invalid and the transmission of the information block is performed again; if the checking equation is established, the information block is effective, and then the information to be processed is calculated and recovered by using a preset algorithm.
Optionally, in the process of recovering the information to be processed, each processing node can asynchronously disclose the encrypted component information.
Optionally, the following processing is performed before the information block is transmitted:
the distribution node is in a linear subspace GF (p)t) Upper random selection vector u ═ u (u)1，u2，…，ut-1) For information vector, satisfy s ═ ug0mod p, the distribution node calculates the encryption share S ═ S1，s2，…，sn) G mod p, s ═ s0The distribution nodes respectively send siI 1, 2 …, n is transmitted as an information block;
if processing node { U1，U2，…，UmRecovering the information to be processed, then
When m ═ t, the processing nodes each compute an identity vector (x)1，x2，…，xm) So that g is0＝(g1，g2，…，gm)(x1，x2，…，xm)Tmod p, processing node exposed component information ci＝siximod p, calculating to obtain information to be processed:
wherein t represents the number of terms of the irreducible polynomial determined in a random manner, and s represents the encrypted share of the information to be processed when m is t; m represents the number of processing nodes receiving the information block transmission; c. CiRepresenting processing node i disclosuresComponent information of (a); mod represents the remainder operation; p represents a large prime number;
when m is>t, the processing nodes each compute an identity vector (x)1′，x2′，…，xm') make g0＝(g1，g2，…，gt)(x1′，x2′，…，xm′)Tmod p, each processing node transmits the identity vector to the other processing nodes, each processing node calculates:
in the above formula, x1，x2，…，xmAn identity vector representing the corresponding processing node when m equals t; m represents the number of processing nodes receiving the information block transmission; x is the number of1′，x2′，…，xm' means when m>t is the identity vector of the corresponding processing node;
the processing nodes disclose respective component information ci＝siximod p, calculating the encrypted share of the information to be processed:
in the above formula, s' represents when m>t is the encrypted share of the information to be processed; m represents the number of processing nodes receiving the information block transmission; c. CjRepresenting component information disclosed by processing node j; mod represents the remainder operation; p represents a large prime number.
Optionally, the random factor is introduced into an SHA-256 hash function to obtain a corresponding hash value;
taking the obtained hash value as an encryption key K, and decomposing the K into sub-keys KiThen, there are:
K＝k1,k2,k3…k32；
the random sequence output by introducing the two-dimensional chaotic system comprises:
xi＝sin(πτ(yi-1+3)xi-1(1-xi-1))
yi＝sin(πτ(xi+3)yi-1(1-yi-1))
wherein x isiAnd yiTwo-dimensional chaotic coordinate, x, representing ith processing nodei-1And yi-1Represents the two-dimensional chaotic coordinates of the i-1 th processing node, tau represents the system parameter, and 0<τ≤1；
Using subkey kiTo set three transition parameters V1，V2，V3Then, there are:
wherein,
represents an exclusive or operation, mod represents a remainder operation;
obtaining the transition parameter V according to calculation1，V2，V3Is calculated by presetting the parameters tau, x, y0，x0，y0Then, there are:
τ0＝(τ+V3)mod1
x0＝(x+V2)mod1
y0＝(y+V1)mod1
according to the initial value tau obtained by calculation0，x0，y0Substituting the random sequence into a random sequence output by the two-dimensional chaotic system, and performing nonlinear operation to satisfy the following conditions:
wherein,
representing the encrypted data combination block,
denotes a decryption key, j is an encryption method, and j is 1, 2, 3.
Optionally, after receiving the encrypted information block, the processing node decrypts and restores the encrypted information block, and then processes the restored information block, where the processing includes one or more processing contents of storage, conversion, transmission, and release.
Optionally, the segmentation rule adopts a combination mode of firstly performing vertical segmentation and then performing horizontal segmentation, a plurality of segmentation blocks are formed after the vertical segmentation, segmentation adjustment is performed on each segmentation block according to a logical relationship of information to be processed, and the adjusted segmentation block is an information block.
Optionally, the check equation adopts the following equation:
in the above formula, the first and second carbon atoms are,
represents a commitment to a broadcast message of an ith item information block, and t represents the number of items of an irreducible polynomial determined in a random manner; biA broadcast message representing an ith item information block of the distribution node; mod represents the remainder operation; q represents a large prime number.
Optionally, the transmission method of the information block is as follows:
acquiring a connection channel between a first processing node and the distribution node based on the identification information of the distribution node;
acquiring each information block determined to be transmitted;
determining file type information of an information block based on parameters of the information block needing to be transmitted to a first processing node, determining to adopt a first transmission mode, and transmitting the corresponding information block to the first processing node based on the first transmission mode and the connection channel;
and forming mirror image channels for connecting other processing nodes with the distribution node by the connecting channel in a channel mirror image mode, determining to adopt a second transmission mode, wherein the second transmission mode is different from the first transmission mode, and transmitting other information blocks to the corresponding processing nodes.
The information dispersion processing method provides a more variable processing method for realizing information dispersion. According to the scheme, the irreducible polynomial digits and irreducible polynomial types are randomly selected to disperse information, so that the processing process is more complicated and changeable, the analysis difficulty of an attacker is increased, and the information dispersion safety is improved.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
fig. 1 is a flowchart of a processing method for information dispersion according to an embodiment of the present invention.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it will be understood that they are described herein for the purpose of illustration and explanation and not limitation.
As shown in fig. 1, an embodiment of the present invention provides an information dispersion processing method, including:
s100, determining processing nodes with scattered information;
s200, the distribution node performs information blocking processing on information to be processed; when information blocking processing is carried out, the adopted irreducible polynomial and the digits of the irreducible polynomial are determined by random selection;
and S300, respectively transmitting the obtained information blocks to corresponding processing nodes, and processing by the processing nodes.
The working principle and the beneficial effects of the technical scheme are as follows: when the scheme is used for processing information in a blocking mode, the number of bits of the irreducible polynomial and the irreducible polynomial are randomly selected and determined, a more variable processing method is provided for realizing information dispersion, the processing process is more complicated and changeable, the difficulty of encryption and decryption is improved, the analysis difficulty of an attacker is increased, and the safety of information dispersion transmission and processing is further improved.
In one embodiment, the information blocking process is as follows:
when information is processed in a blocking mode, the distribution node extracts data characteristics of information to be processed, and performs data dispersion processing on the information to be processed according to the data characteristics by using a preset segmentation rule to obtain information blocks;
selecting a corresponding random number for the information block; forming a filled prefabricated factor according to the selected random number; carrying out XOR operation on the information block and the prefabricated factor to obtain a data combination block;
selecting random factors for the processing nodes according to the preset filling rule; and after matching operation is carried out on the random factors and the prefabricated factors, the data combination blocks obtained by information block processing are transmitted to the processing nodes of the corresponding random factors according to the operation matching result.
The working principle and the beneficial effects of the technical scheme are as follows: when information is processed in a blocking mode, the data characteristics of the information to be processed are extracted, and the information to be processed is decomposed into a plurality of blocks, namely information blocks, by combining preset segmentation rules; selecting corresponding random numbers for each information block one by one to form filled prefabricated factors, and performing XOR operation to obtain a data combination block; selecting a random factor for a processing node, performing matching operation on the random factor and a prefabricated factor, and transmitting a data combination block obtained by information blocking processing to the processing node of the corresponding random factor according to an operation matching result; the matching of the random factor and the prefabricated factor has sporadic property, so that the decoding difficulty is improved, and the safety and the reliability of information dispersion processing are further enhanced.
In one embodiment, after receiving the encrypted information block, the processing node determines whether the received information block is valid by checking whether an equation is satisfied, where the check equation is as follows:
in the above formula, the first and second carbon atoms are,
represents a commitment to a broadcast message of an ith item information block, and t represents the number of items of an irreducible polynomial determined in a random manner; biA broadcast message representing an ith item information block of the distribution node; mod represents the remainder operation; q represents a large prime number;
if the checking equation is not satisfied, the received information block is invalid, and the transmission of the information block is carried out again; if the checking equation is established, the information block is effective, and then the information to be processed is calculated and recovered by using a preset algorithm.
The working principle and the beneficial effects of the technical scheme are as follows: the processing node of the scheme also checks the received encrypted information block, judges whether the received information block is valid or not by checking whether an equality is established or not, if the checking equality is not established, the received information block is invalid, and at the moment, the information processing cannot be carried out, and the information block needs to be transmitted again; the information block is effective only when the checking equation is established, and the processing of the information block can be carried out, so that the scheme can prevent the information block from being transmitted or other errors from causing dispersion processing errors or faults, and ensure the smooth proceeding of the information dispersion processing.
In one embodiment, each processing node can asynchronously disclose cryptographic component information during the process of recovering pending information.
The working principle and the beneficial effects of the technical scheme are as follows: the color pen asynchronous public encryption component information of each processing node realizes real-time synchronous communication of a plurality of processing nodes basically impossible due to various reasons such as networks in communication, and in order to prevent the problem caused by the fact that synchronous communication cannot be realized after selection and use, the asynchronous public mode is selected, so that the condition of asynchronous communication can be allowed, the processing fault is reduced, and the information processing efficiency is improved.
In one embodiment, the following is performed prior to transmission of the information block:
the distribution node is in a linear subspace GF (p)t) Upper random selection vector u ═ u (u)1，u2，…，ut-1) For information vector, satisfy s ═ ug0mod p, the distribution node calculates the encryption share S ═ S1，s2，…，sn) G mod p, s ═ s0The distribution nodes respectively send siI 1, 2 …, n is transmitted as an information block;
if processing node { U1，U2，…，UmRecovering the information to be processed, then
When m ═ t, the processing nodes each compute an identity vector (x)1，x2，…，xm) So that g is0＝(g1，g2，…，gm)(x1，x2，…，xm)Tmod p, processing node exposed component information ci＝sixi mod p，Calculating to obtain information to be processed:
wherein t represents the number of terms of the irreducible polynomial determined in a random manner, and s represents the encrypted share of the information to be processed when m is t; m represents the number of processing nodes receiving the information block transmission; c. CiRepresenting component information disclosed by the processing node i; mod represents the remainder operation; p represents a large prime number;
when m is>t, the processing nodes each compute an identity vector (x)1′，x2′，…，xm') make g0＝(g1，g2，…，gt)(x1′，x2′，…，xm′)Tmod p, each processing node transmits the identity vector to the other processing nodes, each processing node calculates:
in the above formula, x1，x2，…，xmAn identity vector representing the corresponding processing node when m equals t; m represents the number of processing nodes receiving the information block transmission; x is the number of1′，x2′，…，xm' means when m>t is the identity vector of the corresponding processing node;
the processing nodes disclose respective component information ci＝siximod p, calculating the encrypted share of the information to be processed:
in the above formula, s' represents when m>t is the encrypted share of the information to be processed; m represents the number of processing nodes receiving the information block transmission; c. CjRepresenting component information disclosed by processing node j; mod represents the remainder operation; p represents aLarge prime number.
The working principle and the beneficial effects of the technical scheme are as follows: the scheme defines a linear subspace GF (p) before the transmission of an information block by a distribution nodet) Randomly selecting vectors, calculating encryption shares and then transmitting information blocks; at processing node { U1，U2，…，UmRecovering the information to be processed, wherein the encryption share of the information to be processed calculated by the processing nodes has difference according to the comparison between the number of the processing nodes for transmitting the information receiving block and the number of terms of the irreducible polynomial, so that different algorithms are required to be adopted for processing when the information to be processed is recovered; the scheme avoids the problem of recovery of the information to be processed possibly caused by the randomness of the item number selection of the irreducible polynomial and ensures the smooth operation of information dispersion processing.
In one embodiment, the random factor incorporates a SHA-256 hash function to obtain a corresponding hash value;
taking the obtained hash value as an encryption key K, and decomposing the K into sub-keys KiThen, there are:
K＝k1,k2,k3…k32；
the random sequence output by introducing the two-dimensional chaotic system comprises:
xi＝sin(πτ(yi-1+3)xi-1(1-xi-1))
yi＝sin(πτ(xi+3)yi-1(1-yi-1))
wherein x isiAnd yiTwo-dimensional chaotic coordinate, x, representing ith processing nodei-1And yi-1Represents the two-dimensional chaotic coordinates of the i-1 th processing node, tau represents the system parameter, and 0<τ≤1；
Using subkey kiTo set three transition parameters V1，V2，V3Then, there are:
wherein,
represents an exclusive or operation, mod represents a remainder operation;
obtaining the transition parameter V according to calculation1，V2，V3Is calculated by presetting the parameters tau, x, y0，x0，y0Then, there are:
τ0＝(τ+V3)mod1
x0＝(x+V2)mod1
y0＝(y+V1)mod1
according to the initial value tau obtained by calculation0，x0，y0Substituting the random sequence into a random sequence output by the two-dimensional chaotic system, and performing nonlinear operation to satisfy the following conditions:
wherein,
representing the encrypted data combination block,
denotes a decryption key, j is an encryption method, and j is 1, 2, 3.
The working principle and the beneficial effects of the technical scheme are as follows: according to the scheme, an SHA-256 hash function is introduced to a random factor selected by a processing node to obtain a corresponding hash value, and the hash value is used as an encryption key; introducing a random sequence output by a two-dimensional chaotic system, setting three transition parameters by using a sub-encryption key, calculating to obtain a system parameter and a two-dimensional chaotic coordinate initial value, substituting the system parameter and the two-dimensional chaotic coordinate initial value into the random sequence output by the two-dimensional chaotic system to perform nonlinear operation, and obtaining a data combination block and a decryption key; the scheme can provide a basis for the decryption and recovery of the information to be processed by the processing node, eliminate the processing obstacle after the information is dispersed, and improve the information dispersion processing efficiency.
In one embodiment, after receiving the encrypted information block, the processing node decrypts and restores the encrypted information block, and processes the restored information block, where the processing includes one or more processing contents of storage, conversion, transmission, and distribution; the segmentation rule adopts a combination mode of firstly vertically segmenting and then horizontally segmenting to form a plurality of segmentation blocks after vertical segmentation, each segmentation block is segmented and adjusted according to the logic relation of the information to be processed, and the adjusted segmentation block is the information block.
The working principle and the beneficial effects of the technical scheme are as follows: the scheme limits the segmentation rule, adopts a combination mode of vertical segmentation and horizontal segmentation, forms a plurality of segmentation blocks after the information to be processed is vertically segmented, then segments and adjusts each segmentation block according to the logical relation of the information to be processed, and takes the adjusted segmentation block as an information block.
In one embodiment, the transmission method of the information block is as follows:
acquiring a connection channel between a first processing node and the distribution node based on the identification information of the distribution node;
acquiring each information block determined to be transmitted;
determining file type information of an information block based on parameters of the information block needing to be transmitted to a first processing node, determining to adopt a first transmission mode, and transmitting the corresponding information block to the first processing node based on the first transmission mode and the connection channel;
and forming mirror image channels for connecting other processing nodes with the distribution node by the connecting channel in a channel mirror image mode, determining to adopt a second transmission mode, wherein the second transmission mode is different from the first transmission mode, and transmitting other information blocks to the corresponding processing nodes.
The working principle and the beneficial effects of the technical scheme are as follows: according to the scheme, a connecting channel between a first processing node and a distribution node is obtained, file type information of an information block is determined according to parameters of the information block which is transmitted to the first processing node as required, and a first transmission mode is selected to transmit the information block of the first processing node; then, forming mirror image channels for connecting the other processing nodes with the distribution node by adopting a channel mirror image mode, and realizing information block transmission corresponding to the other processing nodes by adopting a second transmission mode through the mirror image channels; transmission connection can be realized rapidly through mirroring, and transmission efficiency is improved.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (7)
1. A method for processing information dispersion, comprising:
determining processing nodes with scattered information;
the distribution node performs information blocking processing on the information to be processed; when information blocking processing is carried out, the irreducible polynomial and the number of terms of the irreducible polynomial are determined by random selection;
respectively transmitting the obtained information blocks to corresponding processing nodes, and processing by the processing nodes;
the information blocking process comprises the following steps:
when information is processed in a blocking mode, the distribution node extracts data characteristics of information to be processed, and performs data dispersion processing on the information to be processed according to the data characteristics by using a preset segmentation rule to obtain information blocks;
selecting a corresponding random number for the information block; forming a filled prefabricated factor according to the selected random number; carrying out XOR operation on the information block and the prefabricated factor to obtain a data combination block;
selecting random factors for the processing nodes according to the preset filling rule; after matching operation is carried out on the random factors and the prefabricated factors, data combination blocks obtained by information blocking processing are transmitted to processing nodes of the corresponding random factors according to operation matching results;
before the information block is transmitted, the following processes are carried out:
the distribution node is in a linear subspace GF (p)t) Upper random selection vector u ═ u (u)1，u2，…，ut-1) For information vector, satisfy s ═ ug0mod p, the distribution node computes the encrypted shares, S ═ S1，s2，…，sn) If s is equal to s0The distribution nodes respectively send siI 1, 2 …, n is transmitted as an information block;
if processing node { U1，U2，…，UmRecovering the information to be processed, then
When m ═ t, the processing nodes each compute an identity vector (x)1，x2，…，xm) So that g is0＝(g1，g2，…，gm)(x1，x2，…，xm)Tmod p, processing node exposed component information ci＝siximod p, calculating the encrypted share of the information to be processed:
wherein t represents the number of terms of the irreducible polynomial determined in a random manner; s representsWhen m is t, the encrypted share of the information to be processed; s represents information to be processed; s0Represents an initial encrypted share; g0A linear code representing a distribution node; g1，g2，…，gmLinear codes respectively representing the processing nodes; m represents the number of processing nodes receiving the information block transmission; c. CiRepresenting component information disclosed by the processing node i; mod represents the remainder operation; p represents a large prime number;
when m is>t, the processing nodes each compute an identity vector (x)1′，x2′，…，xm') make g0＝(g1，g2，…，gt)(x1′，x2′，…，xm′)Tmod p, each processing node transmits the identity vector to the other processing nodes, each processing node calculates:
in the above formula, x1，x2，…，xmAn identity vector representing the corresponding processing node when m equals t; m represents the number of processing nodes receiving the information block transmission; x is the number of1′，x2′，…，xm' means when m>t is the identity vector of the corresponding processing node;
the processing nodes disclose respective component information ci＝siximod p, calculating the encrypted share of the information to be processed:
in the above formula, s' represents when m>t is the encrypted share of the information to be processed; m represents the number of processing nodes receiving the information block transmission; c. CjRepresenting component information disclosed by processing node j; mod represents the remainder operation; p represents a large prime number;
introducing the random factor into an SHA-256 hash function to obtain a corresponding hash value;
taking the obtained hash value as an encryption key K, and decomposing the K into sub-keys KiThen, there are:
K＝k1,k2,k3…k32；
the random sequence output by introducing the two-dimensional chaotic system comprises:
xi＝sin(πτ(yi-1+3)xi-1(1-xi-1))
yi＝sin(πτ(xi+3)yi-1(1-yi-1))
wherein x isiAnd yiTwo-dimensional chaotic coordinate, x, representing ith processing nodei-1And yi-1Represents the two-dimensional chaotic coordinates of the i-1 th processing node, tau represents the system parameter, and 0<τ≤1；
Using subkey kiTo set three transition parameters V1，V2，V3Then, there are:
wherein,
represents an exclusive or operation, mod represents a remainder operation;
obtaining the transition parameter V according to calculation1，V2，V3Is calculated by presetting the parameters tau, x, y0，x0，y0Then, there are:
τ0＝(τ+V3)mod1
x0＝(x+V2)mod1
y0＝(y+V1)mod1
according to the initial value tau obtained by calculation0，x0，y0Substituting the random sequence into a random sequence output by the two-dimensional chaotic system, and performing nonlinear operation to satisfy the following conditions:
wherein,
representing the encrypted data combination block,
which represents a decryption key, is presented,
which represents the block of information after encryption,
a decryption subkey representing the encrypted block of information, j being the encryption method, and j being 1, 2, 3.
2. The information distribution processing method according to claim 1, wherein the processing node determines whether the received information block is valid by checking whether the equality is established after receiving the encrypted information block, and if the equality is not established, the received information block is invalid and the transmission of the information block is resumed; if the checking equation is established, the information block is effective, and then the information to be processed is calculated and recovered by using a preset algorithm.
3. The information-decentralized processing method according to claim 1, characterized in that each processing node is capable of asynchronously disclosing the cryptographic component information during the recovery of the information to be processed.
4. The information distribution processing method according to claim 1, wherein the processing node receives the encrypted information block, decrypts and restores the information block, and processes the restored information block, wherein the processing includes one or more of storing, converting, transmitting and publishing.
5. The information dispersion processing method according to claim 1, wherein the segmentation rule is a combination of vertical segmentation and horizontal segmentation, a plurality of segmentation blocks are formed after vertical segmentation, segmentation adjustment is performed on each segmentation block according to a logical relationship of information to be processed, and the adjusted segmentation blocks are information blocks.
6. The information dispersion processing method according to claim 2, wherein the check equation adopts the following equation:
in the above formula, the first and second carbon atoms are,
represents a commitment to a broadcast message of an ith item information block, and t represents the number of items of an irreducible polynomial determined in a random manner; biA broadcast message representing an ith item information block of the distribution node; mod represents the remainder operation; q represents a large prime number.
7. The method of claim 1, wherein the information blocks are transmitted as follows:
acquiring a connection channel between a first processing node and the distribution node based on the identification information of the distribution node;
acquiring each information block determined to be transmitted;
determining file type information of an information block based on parameters of the information block needing to be transmitted to a first processing node, determining to adopt a first transmission mode, and transmitting the corresponding information block to the first processing node based on the first transmission mode and the connection channel;
and forming mirror image channels for connecting other processing nodes with the distribution node by the connecting channel in a channel mirror image mode, determining to adopt a second transmission mode, wherein the second transmission mode is different from the first transmission mode, and transmitting other information blocks to the corresponding processing nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110428242.0A CN113328859B (en) | 2021-04-21 | 2021-04-21 | Information dispersion processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110428242.0A CN113328859B (en) | 2021-04-21 | 2021-04-21 | Information dispersion processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113328859A CN113328859A (en) | 2021-08-31 |
| CN113328859B true CN113328859B (en) | 2022-02-22 |
Family
ID=77415030
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110428242.0A Active CN113328859B (en) | 2021-04-21 | 2021-04-21 | Information dispersion processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113328859B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114386076B (en) * | 2022-01-17 | 2025-01-07 | 福建中电合创电力科技有限公司 | A method and terminal for encrypting and transmitting electric power data |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106688204A (en) * | 2014-08-19 | 2017-05-17 | 瑞典爱立信有限公司 | Generating cryptographic checksums |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102185692B (en) * | 2011-04-25 | 2012-07-04 | 北京航空航天大学 | Multimode reconfigurable encryption method based on advanced encryption standard (AES) encryption algorithm |
| JP5957120B1 (en) * | 2015-05-12 | 2016-07-27 | 日本電信電話株式会社 | Secret sharing method, secret sharing system, distribution apparatus, and program |
| CN106911384B (en) * | 2017-01-23 | 2019-05-07 | 西安电子科技大学 | Construction method of two-dimensional optical address code suitable for visible light OCDMA communication |
-
2021
- 2021-04-21 CN CN202110428242.0A patent/CN113328859B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106688204A (en) * | 2014-08-19 | 2017-05-17 | 瑞典爱立信有限公司 | Generating cryptographic checksums |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113328859A (en) | 2021-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Laiphrakpam et al. | A robust image encryption scheme based on chaotic system and elliptic curve over finite field | |
| CN108388808B (en) | Image Encryption Method Based on Hill Encryption and Dynamic DNA Coding | |
| CN1773905B (en) | Method, equipment and system for generating anonymous common key in safety communication system | |
| US8200974B1 (en) | Method and system for securely exchanging encryption key determination information | |
| US7254232B2 (en) | Method and system for selecting encryption keys from a plurality of encryption keys | |
| Rahim et al. | Study of three pass protocol on data security | |
| CN111416706B (en) | Quantum secret communication system based on secret sharing and communication method thereof | |
| US12101397B2 (en) | Data communication method, apparatus, and system | |
| US7783045B2 (en) | Secure approach to send data from one system to another | |
| CN109905229B (en) | Anti-quantum computing Elgamal encryption and decryption method and system based on group asymmetric key pool | |
| CN113328859B (en) | Information dispersion processing method | |
| Ranasinghe et al. | A generalization of the ElGamal public-key cryptosystem | |
| Slimane et al. | Hash key-based image cryptosystem using chaotic maps and cellular automata | |
| CN103493428A (en) | Data encryption | |
| US7424114B2 (en) | Method for enhancing security of public key encryption schemas | |
| CN101882996B (en) | Information encryption and decryption method in distributed system based on identity | |
| CN112995215B (en) | Decryption system, method, device, electronic equipment and storage medium | |
| CN114900283A (en) | Deep learning user gradient aggregation method based on multi-party security calculation | |
| CN113407928A (en) | Multi-owner RFID authentication method based on block chain | |
| US20190215148A1 (en) | Method of establishing anti-attack public key cryptogram | |
| US6683953B1 (en) | Encoding method, encoding-decoding apparatus, and code communications system | |
| CN110740034B (en) | Method and system for generating QKD network authentication key based on alliance chain | |
| CN111526131A (en) | Anti-quantum-computation electronic official document transmission method and system based on secret sharing and quantum communication service station | |
| Yang et al. | Quantum public-key cryptosystems based on induced trapdoor one-way transformations | |
| CN108200108B (en) | Asymmetric encryption algorithm and application thereof |
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 |