Nikolay Kolomeec
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
Research Interests
Nikolay Kolomeec has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Vladimirovich Kutsenko
Novosibirsk State University, Novosibirsk, Russia
3 shared publications - Anastasiya A. Gorodilova
Novosibirsk State University Novosibirsk Russia
3 shared publications - Denis Bykov
Novosibirsk State University Novosibirsk Russia
3 shared publications - Alexey Oblaukhov
Novosibirsk State University
2 shared publications - Bart Preneel
KU Leuven
2 shared publications - Claude Carlet
University of Paris 8 Saint-Denis France
2 shared publications
Latest Publications
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2514-2527
On the Maiorana–McFarland Class Extensions
The extensions${\mathcal {M}}_{m}^{\#}$ and$\widehat {\mathcal {M}}_{m}$ of the Maiorana–McFarland class${\mathcal {M}}_{m}$ in$m = 2n$ variables relative to the extended-affine equivalence and the bent function construction$f \oplus {\mathrm {Ind}}_{U}$ are considered, where$U$ is an affine subspace of$\mathbb {F}_{2}^{m}$ of dimension$m/2$ and$ {\mathrm {Ind}}_{U}$ is its characteristic Boolean function. We obtain an explicit formula for$|\widehat {\mathcal {M}}_{m}|$ , an upper bound for$|\widehat {\mathcal {M}}_{m}^{\#}|$ and asymptotically tight bounds for$|{\mathcal {M}}_{m}^{\#}|$ . Metric properties of${\mathcal {M}}_{m}$ and${\mathcal {M}}_{m}^{\#}$ are also investigated. We find the number of all closest bent functions to the set${\mathcal {M}}_{m}$ and provide an upper bound of the same number for${\mathcal {M}}_{m}^{\#}$ . The average number$E({{\mathcal {M}}_{m}})$ of$m/2$ -dimensional affine subspaces of$\mathbb {F}_{2}^{m}$ such that a function from${\mathcal {M}}_{m}$ is affine on each of them is calculated. We obtain that similarly defined$E({{\mathcal {M}}_{m}^{\#}})$ satisfies$E({{\mathcal {M}}_{m}^{\#}}) \lt E({{\mathcal {M}}_{m}})$ for$m \ge 10$ and$E({{\mathcal {M}}_{m}^{\#}}) = E({{\mathcal {M}}_{m}}) - o(1)$ .- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2514-2527
On the Maiorana–McFarland Class Extensions
The extensions${\mathcal {M}}_{m}^{\#}$ and$\widehat {\mathcal {M}}_{m}$ of the Maiorana–McFarland class${\mathcal {M}}_{m}$ in$m = 2n$ variables relative to the extended-affine equivalence and the bent function construction$f \oplus {\mathrm {Ind}}_{U}$ are considered, where$U$ is an affine subspace of$\mathbb {F}_{2}^{m}$ of dimension$m/2$ and$ {\mathrm {Ind}}_{U}$ is its characteristic Boolean function. We obtain an explicit formula for$|\widehat {\mathcal {M}}_{m}|$ , an upper bound for$|\widehat {\mathcal {M}}_{m}^{\#}|$ and asymptotically tight bounds for$|{\mathcal {M}}_{m}^{\#}|$ . Metric properties of${\mathcal {M}}_{m}$ and${\mathcal {M}}_{m}^{\#}$ are also investigated. We find the number of all closest bent functions to the set${\mathcal {M}}_{m}$ and provide an upper bound of the same number for${\mathcal {M}}_{m}^{\#}$ . The average number$E({{\mathcal {M}}_{m}})$ of$m/2$ -dimensional affine subspaces of$\mathbb {F}_{2}^{m}$ such that a function from${\mathcal {M}}_{m}$ is affine on each of them is calculated. We obtain that similarly defined$E({{\mathcal {M}}_{m}^{\#}})$ satisfies$E({{\mathcal {M}}_{m}^{\#}}) \lt E({{\mathcal {M}}_{m}})$ for$m \ge 10$ and$E({{\mathcal {M}}_{m}^{\#}}) = E({{\mathcal {M}}_{m}}) - o(1)$ .- 1 June 2024
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 18 (2) , 294-311
Additive Differentials for ARX Mappings with Probability Exceeding 1/4
We consider the additive differential probabilities of functions \( x \oplus y \) and \( (x \oplus y) \lll r \), where \( x, y \in \mathbb {Z}_2^n \) and \( 1 \leq r < n \). The probabilities are used for the differential cryptanalysis of ARX ciphers that operate only with addition modulo \( 2^n \), bitwise XOR ( \( \oplus \)), and bit rotations ( \( \lll r \)). A complete characterization of differentials whose probability exceeds \( 1/4 \) is obtained. All possible values of their probabilities are \( 1/3 + 4^{2 - i} / 6 \) for \( i \in \{1, \dots , n\} \). We describe differentials with each of these probabilities and calculate the number of these values. We also calculate the number of all considered differentials. It is \( 48n - 68 \) for \( x \oplus y \) and \( 24n - 30 \) for \( (x \oplus y) \lll r \), where \( n \geq 2 \). We compare differentials of both mappings under the given constraint.- 1 June 2024
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 18 (2) , 294-311
Additive Differentials for ARX Mappings with Probability Exceeding 1/4
We consider the additive differential probabilities of functions \( x \oplus y \) and \( (x \oplus y) \lll r \), where \( x, y \in \mathbb {Z}_2^n \) and \( 1 \leq r < n \). The probabilities are used for the differential cryptanalysis of ARX ciphers that operate only with addition modulo \( 2^n \), bitwise XOR ( \( \oplus \)), and bit rotations ( \( \lll r \)). A complete characterization of differentials whose probability exceeds \( 1/4 \) is obtained. All possible values of their probabilities are \( 1/3 + 4^{2 - i} / 6 \) for \( i \in \{1, \dots , n\} \). We describe differentials with each of these probabilities and calculate the number of these values. We also calculate the number of all considered differentials. It is \( 48n - 68 \) for \( x \oplus y \) and \( 24n - 30 \) for \( (x \oplus y) \lll r \), where \( n \geq 2 \). We compare differentials of both mappings under the given constraint.- Open Access
On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation
Properties of the additive differential probability $\mathrm{adp}^{\mathrm{XR}}$ of the composition of bitwise XOR and a bit rotation are investigated, where the differences are expressed using addition modulo $2^n$. This composition is widely used in ARX constructions consisting of additions modulo $2^n$, bit rotations and bitwise XORs. Differential cryptanalysis of such primitives may involve maximums of $\mathrm{adp}^{\mathrm{XR}}$, where some of its input or output differences are fixed. Although there is an efficient way to calculate this probability (Velichkov et al, 2011), many of its properties are still unknown. In this work, we find maximums of $\mathrm{adp}^{\mathrm{XR}}$, where the rotation is one bit left/right and one of its input differences is fixed. Some symmetries of $\mathrm{adp}^{\mathrm{XR}}$ are obtained as well. We provide all its impossible differentials in terms of regular expression patterns and estimate the number of them. This number turns out to be maximal for the one bit left rotation and noticeably less than the number of impossible differentials of bitwise XOR.Open AccessOn additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation
Properties of the additive differential probability $\mathrm{adp}^{\mathrm{XR}}$ of the composition of bitwise XOR and a bit rotation are investigated, where the differences are expressed using addition modulo $2^n$. This composition is widely used in ARX constructions consisting of additions modulo $2^n$, bit rotations and bitwise XORs. Differential cryptanalysis of such primitives may involve maximums of $\mathrm{adp}^{\mathrm{XR}}$, where some of its input or output differences are fixed. Although there is an efficient way to calculate this probability (Velichkov et al, 2011), many of its properties are still unknown. In this work, we find maximums of $\mathrm{adp}^{\mathrm{XR}}$, where the rotation is one bit left/right and one of its input differences is fixed. Some symmetries of $\mathrm{adp}^{\mathrm{XR}}$ are obtained as well. We provide all its impossible differentials in terms of regular expression patterns and estimate the number of them. This number turns out to be maximal for the one bit left rotation and noticeably less than the number of impossible differentials of bitwise XOR. - 16 November 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (2) , 467-476
On the image of an affine subspace under the inverse function within a finite field
- 16 November 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (2) , 467-476
On the image of an affine subspace under the inverse function within a finite field
- Open Access
Mathematical problems and solutions of the Ninth International Olympiad in Cryptography NSUCRYPTO
Every year the International Olympiad in Cryptography Non-Stop University CRYPTO (NSUCRYPTO) offers mathematical problems for university and school students and, moreover, for professionals in the area of cryptography and computer science. The mail goal of NSUCRYPTO is to draw attention of students and young researchers to modern cryptography and raise awareness about open problems in the field. We present problems of NSUCRYPTO'22 and their solutions. There are 16 problems on the following topics: ciphers, cryptosystems, protocols, e-money and cryptocurrencies, hash functions, matrices, quantum computing, S-boxes, etc. They vary from easy mathematical tasks that could be solved by school students to open problems that deserve separate discussion and study. So, in this paper, we consider several open problems on three-pass protocols, public and private keys pairs, modifications of discrete logarithm problem, cryptographic permutations and quantum circuits.
Open AccessMathematical problems and solutions of the Ninth International Olympiad in Cryptography NSUCRYPTO
Every year the International Olympiad in Cryptography Non-Stop University CRYPTO (NSUCRYPTO) offers mathematical problems for university and school students and, moreover, for professionals in the area of cryptography and computer science. The mail goal of NSUCRYPTO is to draw attention of students and young researchers to modern cryptography and raise awareness about open problems in the field. We present problems of NSUCRYPTO'22 and their solutions. There are 16 problems on the following topics: ciphers, cryptosystems, protocols, e-money and cryptocurrencies, hash functions, matrices, quantum computing, S-boxes, etc. They vary from easy mathematical tasks that could be solved by school students to open problems that deserve separate discussion and study. So, in this paper, we consider several open problems on three-pass protocols, public and private keys pairs, modifications of discrete logarithm problem, cryptographic permutations and quantum circuits.
- 1 September 2023
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 17 (3) , 507-520
On a Lower Bound for the Number of Bent Functions at the Minimum Distance from a Bent Function in the Maiorana–McFarland Class
Bent functions at the minimum distance \( 2^n \) from a given bent function of \( 2n \) variables belonging to the Maiorana–McFarland class \( \mathcal {M}_{2n} \) are investigated. We provide a criterion for a function obtained using the addition of the indicator of an \( n \)-dimensional affine subspace to a given bent function from \( \mathcal {M}_{2n} \) to be a bent function as well. In other words, all bent functions at the minimum distance from a Maiorana–McFarland bent function are characterized. It is shown that the lower bound \( 2^{2n+1}-2^n \) for the number of bent functions at the minimum distance from \( f \in \mathcal {M}_{2n} \) is not attained if the permutation used for constructing \( f \) is not an APN function. It is proved that for any prime \( n\geq 5 \) there exist functions in \( \mathcal {M}_{2n} \) for which this lower bound is accurate. Examples of such bent functions are found. It is also established that the permutations of EA-equivalent functions in \( \mathcal {M}_{2n} \) are affinely equivalent if the second derivatives of at least one of the permutations are not identically zero.- 1 September 2023
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 17 (3) , 507-520
On a Lower Bound for the Number of Bent Functions at the Minimum Distance from a Bent Function in the Maiorana–McFarland Class
Bent functions at the minimum distance \( 2^n \) from a given bent function of \( 2n \) variables belonging to the Maiorana–McFarland class \( \mathcal {M}_{2n} \) are investigated. We provide a criterion for a function obtained using the addition of the indicator of an \( n \)-dimensional affine subspace to a given bent function from \( \mathcal {M}_{2n} \) to be a bent function as well. In other words, all bent functions at the minimum distance from a Maiorana–McFarland bent function are characterized. It is shown that the lower bound \( 2^{2n+1}-2^n \) for the number of bent functions at the minimum distance from \( f \in \mathcal {M}_{2n} \) is not attained if the permutation used for constructing \( f \) is not an APN function. It is proved that for any prime \( n\geq 5 \) there exist functions in \( \mathcal {M}_{2n} \) for which this lower bound is accurate. Examples of such bent functions are found. It is also established that the permutations of EA-equivalent functions in \( \mathcal {M}_{2n} \) are affinely equivalent if the second derivatives of at least one of the permutations are not identically zero.- Open Access
On the image of an affine subspace under the inverse function within a finite field
We consider the function $x^{-1}$ that inverses a finite field element $x \in \mathbb{F}_{p^n}$ ($p$ is prime, $0^{-1} = 0$) and affine $\mathbb{F}_{p}$-subspaces of $\mathbb{F}_{p^n}$ such that their images are affine subspaces as well. It is proven that the image of an affine subspace $L$, $|L| > 2$, is an affine subspace if and only if $L = q \mathbb{F}_{p^k}$, where $q \in \mathbb{F}_{p^n}^{*}$ and $k \mid n$. In other words, it is either a subfield of $\mathbb{F}_{p^n}$ or a subspace consisting of all elements of a subfield multiplied by $q$. This generalizes the results that were obtained for linear invariant subspaces in 2006. As a consequence, we propose a sufficient condition providing that a function $A(x^{-1}) + b$ has no invariant affine subspaces $U$ of cardinality $2 < |U| < p^n$ for an invertible linear transformation $A: \mathbb{F}_{p^n} \to \mathbb{F}_{p^n}$ and $b \in \mathbb{F}_{p^n}^{*}$. As an example, it is shown that the condition works for S-box of AES. Also, we demonstrate that some functions of the form $\alpha x^{-1} + b$ have no invariant affine subspaces except for $\mathbb{F}_{p^n}$, where $\alpha, b \in \mathbb{F}_{p^n}^{*}$ and $n$ is arbitrary.Open AccessOn the image of an affine subspace under the inverse function within a finite field
We consider the function $x^{-1}$ that inverses a finite field element $x \in \mathbb{F}_{p^n}$ ($p$ is prime, $0^{-1} = 0$) and affine $\mathbb{F}_{p}$-subspaces of $\mathbb{F}_{p^n}$ such that their images are affine subspaces as well. It is proven that the image of an affine subspace $L$, $|L| > 2$, is an affine subspace if and only if $L = q \mathbb{F}_{p^k}$, where $q \in \mathbb{F}_{p^n}^{*}$ and $k \mid n$. In other words, it is either a subfield of $\mathbb{F}_{p^n}$ or a subspace consisting of all elements of a subfield multiplied by $q$. This generalizes the results that were obtained for linear invariant subspaces in 2006. As a consequence, we propose a sufficient condition providing that a function $A(x^{-1}) + b$ has no invariant affine subspaces $U$ of cardinality $2 < |U| < p^n$ for an invertible linear transformation $A: \mathbb{F}_{p^n} \to \mathbb{F}_{p^n}$ and $b \in \mathbb{F}_{p^n}^{*}$. As an example, it is shown that the condition works for S-box of AES. Also, we demonstrate that some functions of the form $\alpha x^{-1} + b$ have no invariant affine subspaces except for $\mathbb{F}_{p^n}$, where $\alpha, b \in \mathbb{F}_{p^n}^{*}$ and $n$ is arbitrary. - 27 August 2021
- Published by Springer Nature in Cryptography and Communications
- Vol. 13 (6) , 909-926
Some general properties of modified bent functions through addition of indicator functions
- 27 August 2021
- Published by Springer Nature in Cryptography and Communications
- Vol. 13 (6) , 909-926
Some general properties of modified bent functions through addition of indicator functions
- 21 October 2019
- Published by Taylor & Francis in Cryptologia
- Vol. 44 (3) , 223-256
The Fifth International Students’ Olympiad in cryptography—NSUCRYPTO: Problems and their solutions
Problems and their solutions of the Fifth International Students’ Olympiad in cryptography NSUCRYPTO’2018 are presented. We consider problems related to attacks on ciphers and hash functions, Boolean functions, quantum circuits, Enigma, etc. We discuss several open problems on orthogonal arrays, Sylvester matrices, and disjunct matrices. The problem of existing an invertible Sylvester matrix whose inverse is again a Sylvester matrix was completely solved during the Olympiad.
- 21 October 2019
- Published by Taylor & Francis in Cryptologia
- Vol. 44 (3) , 223-256
The Fifth International Students’ Olympiad in cryptography—NSUCRYPTO: Problems and their solutions
Problems and their solutions of the Fifth International Students’ Olympiad in cryptography NSUCRYPTO’2018 are presented. We consider problems related to attacks on ciphers and hash functions, Boolean functions, quantum circuits, Enigma, etc. We discuss several open problems on orthogonal arrays, Sylvester matrices, and disjunct matrices. The problem of existing an invertible Sylvester matrix whose inverse is again a Sylvester matrix was completely solved during the Olympiad.
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 50-53
Properties of bent functions constructed by a given bent function using subspaces
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 50-53
Properties of bent functions constructed by a given bent function using subspaces