Secure Generators of q-valued Pseudo-Random Sequences on Arithmetic Polynomials
Cryptography and Security
2018-09-10 v1
Abstract
A technique for controlling errors in the functioning of nodes for the formation of -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.
Cite
@article{arxiv.1809.02452,
title = {Secure Generators of q-valued Pseudo-Random Sequences on Arithmetic Polynomials},
author = {Oleg Finko and Sergey Dichenko and Dmitry Samoylenko},
journal= {arXiv preprint arXiv:1809.02452},
year = {2018}
}
Comments
21ST INTERNATIONAL MULTI-CONFERENCE ON ADVANCED COMPUTER SYSTEMS ACS 2018 (Mi\k{e}dzyzdroje, Poland, September 24-26, 2018)