Information dispersion processing method

Abstract

The invention provides an information dispersion processing method. The information dispersion processing method comprises the following steps: determining information dispersion processing nodes; enabling the distribution node to carry out information block processing on the to-be-processed information; when information partitioning processing is carried out, determining the adopted irreducible polynomials and the digits of the irreducible polynomials through random selection; respectively transmitting the obtained information blocks to corresponding processing nodes, and processing the information blocks by the processing nodes. According to the information dispersion processing method, a more changeable processing method is provided for realizing information dispersion, and the information is dispersed by randomly selecting the irreducible polynomial bits and irreducible polynomial types, so the processing process is more complex and changeable, the analysis difficulty of attackers is increased, and the information dispersion security is improved.

Description

technical field [0001] The invention relates to the technical field of information dispersion processing, in particular to an information dispersion processing method. Background technique [0002] Existing information decentralized processing methods generally use Shamir encryption sharing technology to disperse information processing. This method generally transforms data through a fixed linear equation system, and Shamir encryption sharing is as follows: [0003] If for n sharing nodes {U 1 , U 2 ,...,U n}, the threshold value is t, encryption is s, p is a large prime number, X 1 , X 2 ,...,X n In order to correspond to the identity information of the sharing node (processing node), except for the encrypted s, other parameter information is disclosed; when encrypting and distributing, the encrypted distribution node D randomly selects a polynomial f(x) of degree t-1 on GF(p) = a 0 +a 1 x+a 2 x 2 +…+a t-1 x t- 1 modp,a i ∈GF(p), satisfy the requirement f(0)=a...

AI Technical Summary

Problems solved by technology

[0009] (2) In the case of less than t, the encryption cannot be obtained

[0010] However, when the currently used information is distributed using a fixed set of linear equations for calculation, the information processing method is single, the irreducible polynomial is fixed, and the number of binary fields is fixed, which makes it vulnerable to attacks

Images