Effectiveness of Using Codes With a Sparse Check Matrix for Protection against Algebraic Manipulations

This article presents codes with a sparse check matrix and demonstrates its possibilities for analysis error masking probability in the case of algebraic manipulations. The illustrated scheme is based on bent functions calculating redundancy using boolean functions. The paper presents the resistance of created code construction to various types of errors. Moreover, the paper considered the strong algebraic manipulation model, this model takes into account the prior knowledge of the attacker about the sparseness of the code check matrix.