METHOD OF CONTROLLING DATA INTEGRITY BASED ON SIERPINSKI CRYPTOGRAPHIC PYRAMID Russian patent published in 2024 - IPC G06F21/64 G06F11/08 

FIELD: data processing.

SUBSTANCE: invention relates to a method of monitoring data integrity based on a Sierpinski cryptographic pyramid. In the method, a data unit M, presented in the form of a vector, to control the integrity of the data contained therein is fragmented into data units M⁽¹⁾, M⁽²⁾, M⁽³⁾ of fixed length, each of which, in turn, is also fragmented into data units M^(φ)_i,j, where φ=1, 2, 3; i=1, 2, …, n; j=1, 2, to which for integrity control hash function h is applied, wherein the hashing scheme is based on the Pascal triangle construction rules and is presented in the form of a table having a triangular shape, along sides of obtained triangle data units M^(φ)_i,j to be protected are sequentially placed, intermediate results of transformations calculated from data units M^(φ)_i,j to be protected are placed inside the triangle, on the lower side of the triangle, placing units with hash function values h, which are calculated from the data units to be protected, and results of intermediate transformations of the lower level, obtained for data units M^(ϕ), schemes for using hash function h, having triangular shapes, are combined into a common scheme according to the rules for constructing a Sierpinski triangle, wherein the common reference hash code H for monitoring integrity of data presented in the form of a data unit M is calculated from hash codes H⁽¹⁾_n,1, …, H⁽¹⁾_n,n+2, located on the lower side of the triangle containing fragmented data units M⁽¹⁾_i,j, from hash codes H⁽²⁾, H⁽²⁾_n,n+2, as well as data units M⁽²⁾_1,2, …, M⁽²⁾_n,2, located on the right lateral side of a triangle containing fragmented data units of a data unit M⁽²⁾_i,j, from hash codes H⁽³⁾, H⁽³⁾_n,1, as well as data units M⁽³⁾_1,1, …, M⁽³⁾_n,1, located on the left lateral side of the triangle containing the fragmented data units of the data unit M⁽³⁾_i,j, obtained system of hash codes for monitoring the integrity of the data unit M is the initial intermediate element of cryptographic fractals – Sierpinski triangles I^(α) (α=1, 2, 3, …, β), combination of which is combined into a common scheme, represented by a pyramid with β coal base so that between two different Sierpinski triangles I^(α) there was one common edge with data units M⁽¹⁾_1,1, …, M⁽¹⁾_n,1, M⁽²⁾_1,1, …, M⁽²⁾_n,1, or M⁽¹⁾_1,2, …, M⁽¹⁾_n,2, M⁽³⁾_1,2, …, M⁽³⁾_n,2, relating to separate storages of distributed data storage systems.

EFFECT: possibility to control data integrity in case of its violation in separate storages of distributed data storage systems.

1 cl, 12 dwg