The selection of forming polynomials for shift register with nonlinear feedback second order that generates the sequence with maximum period
Journal Title: КОМП’ЮТЕРНІ НАУКИ ТА КІБЕРБЕЗПЕКА - Year 2016, Vol 2, Issue 2
Abstract
Model pseudo-random sequence generator based on shift registers with nonlinear feedback second order is considered. Additional requirements for type of polynomial are formulated. They limit the set of polynomials which generate a sequence with maximum period. The expression to determine the number of polynomials that do not meet the requirements is given. Quantitative estimation of the impact of each request on cuts the set of polynomials is given. Recommendations for the use of these requirements are formulated.
Authors and Affiliations
V. Potii, Nikolay Poluyanenko
Keywords
Related Articles
- EP ID EP258513
- DOI -
- Views 127
- Downloads 0
IMPROVED MATHEMATICAL MODEL OF THE POST-QUANTUM ELETRONIC SIGNATURE MECHANISM
In the paper new electronic signature mechanisms which will be urgent in the post-quantum period devel-opment necessity is grounded. The main one time key mechanisms are briefly described. Problems related with Lamport O...
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...
Method of 3D-steganography
In this work, a new direction of technical steganography related to the concealment of information in the process of layer-by-layer creation (cultivation) of a solid-state object using various 3D-printing technologies wa...
A pseudorandom sequences generator based on the multimodulo transformation
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 anal...
PRACTICAL CLASSIFICATION TOPOLOGICAL STRUCTURES OF COMMUNICATION NETWORKS FOR MULTIPROCESSOR COMPUTER SYSTEMS
Proposed by the working version of practical classification topological structures of communication networks for multiprocessor computer systems. Any n-dimensional non-full mesh structure presented here as the result of...