Secure Generators of q-valued Pseudo-Random Sequences on Arithmetic Polynomials

TL;DR

This paper presents a method for generating q-valued pseudo-random sequences using arithmetic polynomials, which enhances error control and allows for parallel processing and redundancy to improve security against errors and attacks.

Contribution

It introduces a novel approach combining arithmetic polynomial systems with modular codes for secure and error-resistant q-valued PRS generation.

Findings

Enhanced error control in PRS generation

Parallelizable calculation process

Improved security against intentional attacks

Abstract

A technique for controlling errors in the functioning of nodes for the formation of $q$-valued pseudo-random sequences (PRS) operating under both random errors and errors generated through intentional attack by an attacker is provided, in which systems of characteristic equations are realized by arithmetic polynomials that allow the calculation process to be parallelized and, in turn, allow the use of redundant modular codes device.