DBDenis Bykov

Denis Bykov

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Denis Bykov has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Maiorana-McFarland Class Extensions

    by Nikolay Kolomeec, Denis Bykov

    The closure $\mathcal{M}_{m}^{\#}$ and the extension $\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$. We obtain an explicit formula for $|\widehat{\mathcal{M}}_{m}|$ and an upper bound for $|\widehat{\mathcal{M}}_{m}^{\#}|$. Asymptotically tight bounds for $|\mathcal{M}_{m}^{\#}|$ are proved as well, for instance, $|\mathcal{M}_{8}^{\#}| \approx 2^{77.865}$. 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}^{\#}) < E(\mathcal{M}_{m})$ and $E(\mathcal{M}_{m}^{\#}) = E(\mathcal{M}_{m}) - o(1)$.

  • On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation

    by Nikolay Kolomeec, Ivan Sutormin, Denis Bykov, Matvey Panferov, Tatyana Bonich


  • Open Access

    On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation

    by Nikolay Kolomeec, Ivan Sutormin, Denis Bykov, Matvey Panferov, Tatyana Bonich

    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.

  • On a Lower Bound for the Number of Bent Functions at the Minimum Distance from a Bent Function in the Maiorana–McFarland Class

    by D. A. Bykov, N. A. Kolomeec

    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.