COMBINING AND FILTERING FUNCTIONS BASED ON THE NONLINEAR FEEDBACK SHIFT REGISTERS
Alexandr Kuznetsov, A. V. Potii, Nikolay Poluyanenko, Serhii Vdovenko
Abstract
Alexandr Kuznetsov, A. V. Potii, Nikolay Poluyanenko, Serhii Vdovenko
Abstract
Strong cryptography of stream ciphers is determined, among other things, by the ability of a generated pseudorandom sequence to resist analytical attacks. One of the main components of the pseudorandom stream cipher sequence generating algorithm are Boolean functions for combining and filtering. The paper considers the possibility of applying nonlinear-feedback shift registers that generate a maximum length sequence as a combining or filtering function. This work examines the main indicators of cryptographic strength of such functions, as: balance, the prohibitions presence, correlation immunity and nonlinearity. The study analyzes and demonstrates correlation experimental immunity and nonlinearity values for all nonlinear feedback shift registers, that generate a maximum length sequence, for register sizes up to 6 cells inclusively, and registers sizes up to 9 cells inclusively with algebraic degree of the polynomial under 2. The possibility of optimizing the process of selecting the Boolean functions according to the criteria of maximum correlation immunity and nonlinearity with various algebraic degree and minimization of the number of monomials in the polynomial are studied.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Strong cryptography of stream ciphers is determined, among other things, by the ability of a generated pseudorandom sequence to resist analytical attacks. One of the main components of the pseudorandom stream cipher sequence generating algorithm are Boolean functions for combining and filtering. The paper considers the possibility of applying nonlinear-feedback shift registers that generate a maximum length sequence as a combining or filtering function. This work examines the main indicators of cryptographic strength of such functions, as: balance, the prohibitions presence, correlation immunity and nonlinearity. The study analyzes and demonstrates correlation experimental immunity and nonlinearity values for all nonlinear feedback shift registers, that generate a maximum length sequence, for register sizes up to 6 cells inclusively, and registers sizes up to 9 cells inclusively with algebraic degree of the polynomial under 2. The possibility of optimizing the process of selecting the Boolean functions according to the criteria of maximum correlation immunity and nonlinearity with various algebraic degree and minimization of the number of monomials in the polynomial are studied.
Key concepts: Stream cipher, Correlation attack, Shift register, Pseudorandom binary sequence, Pseudorandom number generator, Boolean function, Sequence (biology), Nonlinear system