most citedSecure pseudo-random linear binary sequences generators based on arithmetic polynoms

2 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CR2018

Protection of Information from Imitation on the Basis of Crypt-Code Structures

Dmitry Samoylenko, Mikhail Eremeev, Oleg Finko +1

A system is offered for imitation resistant transmitting of encrypted information in wireless communication networks on the basis of redundant residue polynomial codes. The particu…

cs.CR2018

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

Oleg Finko, Sergey Dichenko, Dmitry Samoylenko

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…

cs.CR2018★ 1 cited

Two-Dimensional Control and Assurance of Data Integrity in Information Systems Based on Residue Number System Codes and Cryptographic Hash Functions

Sergey Dichenko, Oleg Finko

The method of two-dimensional control and assurance of data integrity with the possibility of their recovery for information systems operating under conditions of random errors as…

cs.CR2014★ 2 cited

Secure pseudo-random linear binary sequences generators based on arithmetic polynoms

Oleg Finko, Sergey Dichenko

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 attack…

cs.CR2014

Parallel generator of -valued pseudorandom sequences based on arithmetic polynomials

Oleg Finko, Dmitriy Samoylenko, Sergey Dichenko +1

A new method for parallel generation of -valued pseudorandom sequence based on the presentation of systems generating logical formulae by means of arithmetic polynomials is prop…