Konstantin Lisickiy
Research Subjects
Konstantin Lisickiy has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
Iryna Lisickaya
V. N. Karazin Kharkiv National University, Kharkiv, Ukraine
3 shared publicationsKateryna Kuznetsova
V. N. Karazin Kharkiv National University, Kharkiv, Ukraine
3 shared publicationsVictor Dolgov
V. N. Karazin Kharkiv National University, Kharkiv, Ukraine
2 shared publicationsViktor Dolgov
2 shared publicationsAlexandr Kuznetsov
1 shared publication- Alexandr Kuznetsov
Department of Theoretical and Applied Sciences, eCampus University, Via Isimbardi 10, 22060 Novedrate, CO, Italy
1 shared publication
Latest Publications
- 8 November 2020
- Published by Academy of Cognitive and Natural Sciences
Cryptographically Properties of Random S-Boxes
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.
- 8 November 2020
- Published by Academy of Cognitive and Natural Sciences
Cryptographically Properties of Random S-Boxes
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.
- 6 August 2020
- Published by Springer Nature
- p. 640-652
The Problem of Double Costs in Blockchain Systems
- 6 August 2020
- Published by Springer Nature
- p. 640-652
The Problem of Double Costs in Blockchain Systems
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 899-905
Accelerated Method for Calculating the Algebraic Immunity of S-Boxes
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.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 899-905
Accelerated Method for Calculating the Algebraic Immunity of S-Boxes
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.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 889-894
Random S-boxes in Symmetric Ciphers
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.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 889-894
Random S-boxes in Symmetric Ciphers
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
- 31 March 2019
- Published by Research Institute for Intelligent Computer Systems in International Journal of Computing
- p. 89-100
BLOCK SYMMETRIC CIPHER WITH RANDOM S-BOXES
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.
- 31 March 2019
- Published by Research Institute for Intelligent Computer Systems in International Journal of Computing
- p. 89-100
Open AccessBLOCK SYMMETRIC CIPHER WITH RANDOM S-BOXES
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.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 391-395
Block cipher with improved dynamic indicators of the condition of a random substitution
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.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 391-395
Block cipher with improved dynamic indicators of the condition of a random substitution
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.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 396-399
Cipher with improved dynamic indicators of the condition of a random substitution
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.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 396-399
Cipher with improved dynamic indicators of the condition of a random substitution
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.