Konstantin Kalgin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Konstantin Kalgin has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- A. E. Doronin
Novosibirsk State University, Novosibirsk, Russia
2 shared publications Novosibirsk State University
2 shared publications- V. A. Idrisova
Sobolev Inst Math, 4 Koptyuga Ave, Novosibirsk 630090, Russia
2 shared publications - Aleksei Udovenko
SnT, University of Luxembourg, Esch-sur-Alzette, Luxembourg
1 shared publication - Alexander Vladimirovich Kutsenko
Novosibirsk State University, Novosibirsk, Russia
1 shared publication - Anastasiya A. Gorodilova
Novosibirsk State University Novosibirsk Russia
1 shared publication
Latest Publications
- 1 November 2022
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 16 (4) , 632-644
Application of SAT-Solvers to the Problem of Finding Vectorial Boolean Functions with Required Cryptographic Properties
We propose a method for finding an almost perfect nonlinear (APN) function. It is based on translation into SAT-problem and using SAT-solvers. We construct several formulas defining the conditions for finding an APN function and introduce two representations of the function, sparse and dense, which are used to describe the problem of finding one-to-one vectorial Boolean functions and APN functions. We also propose a new method for finding a vector APN function with additional properties. It is based on the idea of representing the unknown vectorial Boolean function as a sum of a known APN function and two unknown Boolean functions, \( \mathbf {G} = \mathbf {F}\oplus \mathbf {c}\cdot g_1 \oplus \mathbf {d}\cdot g_2 \), where \( \mathbf {F} \) is a known APN function. It is shown that this method is more efficient than the direct construction of APN function using SAT for dimensions 6 and 7. As a result, the method described in the paper can prove the nonexistence of cubic APN functions in dimension 7 representable in the form of the sum described above.- 1 November 2022
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 16 (4) , 632-644
Application of SAT-Solvers to the Problem of Finding Vectorial Boolean Functions with Required Cryptographic Properties
We propose a method for finding an almost perfect nonlinear (APN) function. It is based on translation into SAT-problem and using SAT-solvers. We construct several formulas defining the conditions for finding an APN function and introduce two representations of the function, sparse and dense, which are used to describe the problem of finding one-to-one vectorial Boolean functions and APN functions. We also propose a new method for finding a vector APN function with additional properties. It is based on the idea of representing the unknown vectorial Boolean function as a sum of a known APN function and two unknown Boolean functions, \( \mathbf {G} = \mathbf {F}\oplus \mathbf {c}\cdot g_1 \oplus \mathbf {d}\cdot g_2 \), where \( \mathbf {F} \) is a known APN function. It is shown that this method is more efficient than the direct construction of APN function using SAT for dimensions 6 and 7. As a result, the method described in the paper can prove the nonexistence of cubic APN functions in dimension 7 representable in the form of the sum described above.- 29 June 2022
- Published by Springer Nature in Cryptography and Communications
- Vol. 15 (2) , 239-256
The classification of quadratic APN functions in 7 variables and combinatorial approaches to search for APN functions
- 29 June 2022
- Published by Springer Nature in Cryptography and Communications
- Vol. 15 (2) , 239-256
The classification of quadratic APN functions in 7 variables and combinatorial approaches to search for APN functions
- 21 July 2021
- Published by Sobolev Institute of Mathematics in Sibirskie Elektronnye Matematicheskie Izvestiya
- Vol. 18 (2) , А.4-А.29
The Seventh International Olympiad in Cryptography: Problems and solutions
- 21 July 2021
- Published by Sobolev Institute of Mathematics in Sibirskie Elektronnye Matematicheskie Izvestiya
- Vol. 18 (2) , А.4-А.29
The Seventh International Olympiad in Cryptography: Problems and solutions
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 129-132
Construction of cryptographic boolean functions using SAT-solvers
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 129-132
Construction of cryptographic boolean functions using SAT-solvers
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 37-39
On a secondary construction of quadratic APN functions
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 37-39
On a secondary construction of quadratic APN functions
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 135-136
A Compact translator of algorithms into boolean formulas for use in cryptanalysis
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 135-136
A Compact translator of algorithms into boolean formulas for use in cryptanalysis
- 1 January 2011
- Published by Pleiades Publishing Ltd in Numerical Analysis and Applications
- Vol. 4 (1) , 46-55
Implementation of algorithms with a fine-grained parallelism on GPUs
The efficiency of implementations of algorithms with a fine-grained parallelism on GPUs that support the CUDA architecture is studied. Cellular automata and difference schemes are used for testing. Several versions of implementations are proposed and their efficiency is analyzed. An example of GPU application for modeling the process of carbon dioxide oxidation on the catalyst surface is given.
- 1 January 2011
- Published by Pleiades Publishing Ltd in Numerical Analysis and Applications
- Vol. 4 (1) , 46-55
Implementation of algorithms with a fine-grained parallelism on GPUs
The efficiency of implementations of algorithms with a fine-grained parallelism on GPUs that support the CUDA architecture is studied. Cellular automata and difference schemes are used for testing. Several versions of implementations are proposed and their efficiency is analyzed. An example of GPU application for modeling the process of carbon dioxide oxidation on the catalyst surface is given.