Secure Generators of q-valued Pseudo-Random Sequences on Arithmetic Polynomials
This addresses security and reliability issues in pseudo-random sequence generation for cryptographic or communication systems, but appears incremental as it builds on existing modular code techniques.
The paper tackles the problem of controlling errors in q-valued pseudo-random sequence generators under both random errors and intentional attacks, by using arithmetic polynomials to parallelize computation and enable redundant modular codes.
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.