ISIvan Sutormin
Ivan Sutormin
*This is an algorithmically generated author record based on publicly available information.
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
Ivan Sutormin has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Denis Bykov
Novosibirsk State University Novosibirsk Russia
2 shared publications - Matvey Panferov
Novosibirsk State University, Novosibirsk, Russia
2 shared publications - Tatyana Bonich
Novosibirsk State University, Novosibirsk, Russia
2 shared publications - Nikolay Kolomeec
Novosibirsk State University Novosibirsk Russia
1 shared publication - Nikolay Kolomeec
Novosibirsk State University, Novosibirsk, Russia
1 shared publication Novosibirsk State University
1 shared publication
Latest Publications
- 15 January 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (2) , 541-570
On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation
- 15 January 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (2) , 541-570
On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation
- 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. - 1 August 2021
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 15 (3) , 504-512
On the Nonlinearity of Boolean Functions Generated by the Generalized Dobbertin Construction
We propose a generalization of Dobbertin’s construction of 1995 for balanced highly nonlinear Boolean functions. Under study is the Walsh–Hadamard spectrum of the proposed functions. We powide an exact upper bound for the spectral radius (i.e., a lower bound for nonlinearity), and a method for constructing a balanced function of \(2n \) variables with the spectral radius equal to \(2^n + 2^k R \) using a balanced function of \(n-k \) variables with spectral radius \(R \).- 1 August 2021
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 15 (3) , 504-512
On the Nonlinearity of Boolean Functions Generated by the Generalized Dobbertin Construction
We propose a generalization of Dobbertin’s construction of 1995 for balanced highly nonlinear Boolean functions. Under study is the Walsh–Hadamard spectrum of the proposed functions. We powide an exact upper bound for the spectral radius (i.e., a lower bound for nonlinearity), and a method for constructing a balanced function of \(2n \) variables with the spectral radius equal to \(2^n + 2^k R \) using a balanced function of \(n-k \) variables with spectral radius \(R \).- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 33-35
An estimation of the nonlinearity of balanced boolean functions generated by generalized dob-bertin's construction
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 33-35
An estimation of the nonlinearity of balanced boolean functions generated by generalized dob-bertin's construction