A new method for parallel generation of q-valued pseudorandom sequence based on the presentation of systems generating logical formulae by means of arithmetic polynomials is proposed. Fragment consisting of kelements of q-valued pseudorandom sequence may be obtained by means of single computing of a single recursion numerical formula. It is mentioned that the method of the "arithmetization" of generation may be used and further developed in order to protect the encryption gears from cryptographic onset, resulting in the initiating of mass hardware failures. The achieved results may be widely applied to the realization of perspective high-performance cryptographic facilities for information protection.

We present a new approach to constructing of pseudo-random binary sequences (PRS) generators for the purpose of cryptographic data protection, secured from the perpetrator's attacks, caused by generation of masses of hardware errors and faults. The new method is based on use of linear polynomial arithmetic for the realization of systems of boolean characteristic functions of PRS' generators. "Arithmetizatio" of systems of logic formulas has allowed to apply mathematical apparatus of residue systems for multisequencing of the process of PRS generation and organizing control of computing errors, caused by hardware faults. This has guaranteed high security of PRS generator's functioning and, consequently, security of tools for cryptographic data protection based on those PRSs.

No abstract

Data storage systems designed for storing large multidimensional arrays of information, functioning in conditions of destructive influences of an attacker and the environment, are considered. One of the most urgent tasks for such systems is the organization of secure data storage, and taking into account such operating conditions - ensuring their integrity. Ensuring data integrity is a difficult task, due to its complexity, as it includes both recovery and data integrity control. One of the well-known and widely used methods of data integrity control is the use of cryptographic methods, in particular, the hashing function. However, despite the widespread use of hash functions, they have been very little researched, and practical proposals for their use are very few and are characterized by a number of disadvantages associated with the need to introduce a high redundancy of control information. In the context of limitations on the existing resource of data storage systems, this can lead to a decrease in the probability of completing the task of their functioning, or even to its failure. A generalized method is proposed, the use of which will reduce the amount of introduced redundancy when monitoring the integrity of information in data storage systems, based on the use of cryptographic hash functions, a distinctive feature of which is the use of rules for constructing error-resistant codes. In addition, the developed method provides the data integrity control procedure with a new property: the ability to control the integrity of not only the data to be protected, but also the reference hash codes themselves. Calculated data of the required volume of the introduced redundancy are obtained when monitoring the data integrity in existing storage systems using the developed method.

The paper presents the work of the program for the formation and verification of an electronic digital signature (EDS) implemented using operations in a group of points of an elliptic curve defined over a finite simple field. data integrity. Development is caused by the need to implement electronic digital signature of varying degrees of resistance in connection with the increase in the level of development of computer technology. The strength of an electronic digital signature is based on the complexity of calculating the discrete logarithm in a group of elliptic curve points, as well as on the stability of the hash function used in accordance with GOST R 34.11-2012.