KLKonstantin Lisickiy

Konstantin Lisickiy

*This is an algorithmically generated author record based on publicly available information.

Konstantin Lisickiy has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Cryptographically Properties of Random S-Boxes

    by Konstantin Lisitskiy, Irina Lisitska, Alexandr Kuznetsov

    The results of studies of the properties of random permutations car- ried out with the participation of the authors are generalized. It is shown that random substitutions overwhelmingly have good cryptographic, and in particu- lar, algebraic properties. The prospects of using random S-blocks to build block symmetric ciphers with improved dynamic rates of arrival to random substitu- tion are substantiated. A refined model of random substitution and the corre- sponding criteria are proposed, with the help of which one can verify the suita- bility of substitutions generated randomly for use in modern cipher designs. It is a check, since with a very high probability the checked substitutions will be suitable.

  • The Problem of Double Costs in Blockchain Systems

    by Nikolay Poluyanenko, Alexandr Kuznetsov, Konstantin Lisickiy, Serhii Datsenko, Oleksandr Nakisko, Serhii Rudenko


  • Accelerated Method for Calculating the Algebraic Immunity of S-Boxes

    by Konstantin Lisickiy, Kateryna Kuznetsova, Yevhenii Malenko, Sergii Kavun, Olga Zavgorodnia, Yury Tarasenko

    The accelerated method for calculating the algebraic immunity of nonlinear knots for replacing symmetric ciphers by Jean-Charles Faugere is considered. It is based on the search for the annihilation function to the Zhegalkin polynomial constructed from the original nonlinear replacement node. An analysis of the known algorithm speed for calculating algebraic immunity is given. The details of the implementation of the algorithm are discussed and a description is given of the accelerated algorithm for computing algebraic immunity, optimized for computing time and for using RAM resources.


  • Random S-boxes in Symmetric Ciphers

    by Konstantin Lisickiy, Iryna Lisickaya, Victor Dolgov, Kateryna Kuznetsova

    This description is about a new 256-bit block symmetric substitution-permutation cipher, called a managed substitution cipher. This is a cipher with single-layer permutated transformations in each cycle. The management of substituted transformations occur by including them in a chain so that the output value of the previous SL transform is fed to the input of the current fortified 32-bit substituted transformation (SL conversion) along with the current value of the input data block through the adder for modulo 2. It is shown that such construction of cycled function allows to use random substitutions without any selection in a cipher while not reducing its strength.

  • Open Access

    BLOCK SYMMETRIC CIPHER WITH RANDOM S-BOXES

    by Konstantin Lisickiy, Victor Dolgov, Iryna Lisickaya, Kateryna Kuznetsova

    This paper describes a new 256-bit block symmetric substitution-permutation cipher, called managed substitution cipher. This is a cipher with single-layer permutated transformations in each cycle. The management of substituted transformations occur by including them in a chain so that the output value of the previous SL transform is fed to the input of the current fortified 32-bit substituted transformation (SL conversion) along with the current value of the input data block through the adder for modulo 2. This enables to activate almost all S-blocks of the second cycle and subsequent cycles and eventually improve the dynamic indicators of the arrival of the cipher to the state of random substitution. The results of the evaluation of randomness indicators and the possibility of using random S-blocks are given. It is shown that such construction of cycled function allows us to use random substitutions without any selection in a cipher without reducing its strength.


  • Block cipher with improved dynamic indicators of the condition of a random substitution

    by Konstantin Lisickiy, Viktor Dolgov, Iryna Lisickaya

    On the example of the improved cipher of Kalina-2, SPN ciphers with improved indicators of their transition to the state of random substitution is offering. The improvement is basing on the application of the first cycle transformation of the new design, which allows activating all S-blocks of the second cycle. Ciphers are not inferior to the speed of known structures and allow without reducing the stability to use in them random S-blocks.


  • Cipher with improved dynamic indicators of the condition of a random substitution

    by Konstantin Lisickiy, Viktor Dolgov, Iryna Lisickaya

    Description of a new 256-bit SPN cipher, called a managed substitution cipher (MSC), is present. This is an SPN cipher with a two-layer substitution transformation in the first cycle and one-layer substitution transformations in the remaining cycles. Management of substitution transformations is carried out by including them in a chain so that the value of the output of the previous SL transformation is fed to the input of the current enlarged 32-bit substitution transformation (SL transformation) along with the current value of the input data block through the adder modulo 2. It is show that such a construction of the ciphered function of the cipher allows us to reduce the minimum number of cycles of its arrival to the state of random substitution. This in turn reduces the number of encryption cycles (to increase the speed) and create the conditions under which S-blocks of random type can be used in the cipher without sacrificing security.