A pseudorandom sequences generator based on the multimodulo transformation
Journal Title: КОМП’ЮТЕРНІ НАУКИ ТА КІБЕРБЕЗПЕКА - Year 2016, Vol 1, Issue 1
Abstract
Main theoretical statements and practical research results of pseudorandom sequences over arbitrary alphabet generation based on multimodulo transformation in the finite field GF(pn) are given, results of properties analysis on distinguishing, unpredictability, irreversibility, repetition period and complexity (performance) are brought.
Authors and Affiliations
Oleksii Nariezhnii, Yurii Gorbenko, Tetiana Grinenko, Nikołay Karpinskiy
RESEARCH OF USAGE POSSIBILITY AND POST-QUANTUM ALGORITHMS ADVANTAGES DEPEND ON APPLICATION CONDITIONS
We established the need for comparative analysis and evaluation of the possibility to use asymmetric post-quantum cryptographic mechanisms. In order to compare, a procedure for evaluation was selected based on integral a...
The method of a data control in the residual system classes based on use of positional attribute of non-positional code structure
The method of a data control in the residue number system (RNS) are developed in the article, which is based on the use of positional attribute of non-positional code structure. The using variants of the proposed method...
KEY SCHEDULE OF BLOCK SYMMETRIC CIPHERS
We investigate combinatorial properties of the block symmetric ciphers key schedule in the assumption that the cyclic (round) keys are generated randomly, with equal probability and independently of each other. The model...
ESTIMATE OF NOISE-IMMUNITY FOR INDIVISIBLE CODES
Considered the problem of finding general criteria to assess the effectiveness of indivisible codes
CONCEPTION OF REALIZATION OF CRIPTOGRAPHIC RSA TRANSFORMATIONS WITH USING OF THE RESIDUE NUMBER SYSTEM
The methods of rapid information processing aimed to reduce the time of realization of cryptographic RSA transformations are propounded in the paper. These methods are based on application of the principle of ring shift...