Secure Pseudo-Random Linear Binary Sequences Generators Based on Arithmetic Polynoms

Abstract

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.

Secure Generators of q-Valued Pseudo-random Sequences on Arithmetic Polynomials

“…In [5] an algorithm for parallelizing the generation of binary PRS is presented based on the representation of systems of generating recurring logical formulas by means of LNP offered by V. D. Malyugin, which allowed using the redundant modular code device to control the errors of the functioning of the PRS generation nodes and, ensure the required safety of their functioning in the MIS.…”

“…By analogy with [5] let us express the right-hand sides of the system (5) through the given initial conditions and let us write it as the m MFAL system of m variables:…”

“…The work [5] offers a solution that overcomes the complexity of using code control for the nodes of the binary PRS generation, based on the "arithmetic" of logical count and the application of the redundant modular code device, which provides the necessary level of security for their functioning. However, the solution obtained is limited to exclusive applicability in the formation of binary PRS.…”