METHOD FOR CONTROL AND RECOVERY OF INTEGRITY OF MULTIDIMENSIONAL DATA ARRAYS

FIELD: data arrays monitoring and restoring.SUBSTANCE: invention relates to a method for monitoring and restoring the integrity of multidimensional data arrays. In the method for performing integrity control, data blocks Mi (i=1, 2, ..., n) are represented as fixed-length subblocks Mi,l, Mi,2, ..., Mi,n, from which the reference hash codes Hi hash -functions h(Mi), the values of which are subsequently compared with the values of the hash codesof the hash functioncalculated from the checked data blockswhose subblocks are also subblocks of data blocks Mj (j=1, 2, ..., n), which, in order to restore data integrity in case of its violation, are formed according to the rules similar to the rules for constructing redundant modular codes, while providing for subblocks M1,j, M2,j, ..., Mn,j, which are an information group of n subblocks, designed to uniquely restore data blocks Mj in case of violation of their integrity, calculation of the control group (k - n) of subblocks Mn+1,j, Mn+2,j, ..., Mk,j, additionally introduced to correct the error, in the event of which the restoration of data blocks Mj without prejudice to the uniqueness of their representation is carried out by reconfiguring the system by excluding the subblock [Mi,j] from the calculations with the error that has occurred, while the multidimensional data array of dimension k is represented as 3- dimensional data array М[k, k, k], consisting of k3 data blocks Mi,j,r (i=j=r=0, 1, ..., k - 1), which, for integrity control, will be placed in an array of dimensions k+1, while filling from 0 to k-1 of its blocks, to which the hash function h is applied to detect signs of integrity violation, while the calculated hash codes Hi, j, r ( i, j, r = 0, ..., k) will be placed in 3k2 free blocks of the array and will be reference values, the values of which, when requesting the use of data, are compared with the values of the hash codesof the hash functioncalculated already from the checked data blockswhen restoring the integrity of the data blocks Mi,j,r to be protected, as well as the reference hash codes Hi,j,r calculated from them will be interpreted as elements of GF(2t) and will be the least polynomial residues in basesin this case, the resulting 3-dimensional data array M[k+1, k+1, k+1] will be considered as a single superblock of the modular polynomial code, on which the expansion operation is performed by introducing n - k redundant bases, for which the corresponding 3k2(n - k) excess residues are calcu