2025, issue 3, p. 100-106
Received 22.06.2025; Revised 31.07.2025; Accepted 02.09.2025
Published 29.09.2025; First Online 30.09.2025
https://doi.org/10.34229/2707-451X.25.3.9
Some Algebraic Properties of RX-Differential Probabilities of Boolean Mappings
Serhii Yakovliev 
Institute of Physics and Technology, Igor Sikorsky Kyiv Polytechnic Institute
Correspondence: This email address is being protected from spambots. You need JavaScript enabled to view it.
Introduction. ARX- and LRX- cryptosystems are based on extremely simple operations available at the level of computing processor instructions, such as modular addition, bitwise addition, rotations, etc. Due to their simple implementation and extremely high speed, ARX- and LRX- cryptosystems have become an important part of so-called lightweight cryptography – a field dedicated to the development of reliable algorithms for low-resource devices and the Internet of Things. However, their simple structure also makes them vulnerable to attacks, so the creation of such systems requires careful analysis and evaluation of cryptographic security against known attack methods, such as RX-analysis.
The purpose of the article is to derive exact analytical expressions for the probabilities of RX-differentials of Boolean mappings with linear shifts. This will enable a more detailed analysis of the cryptographic properties of such mappings.
Results. Exact analytical expressions have been obtained for the probabilities of RX-differentials, as well as ordinary differentials and rotation pairs, for binary Boolean mappings with linear shifts. It has been proven that RX-differentials for given mappings and their dual functions have the same probabilities. It is shown that adding constants – a common method of increasing security against rotational cryptanalysis – does not always produce the desired effect. For rotation-invariant mappings with shifts, an unexpected connection between the probabilities of rotation pairs and the probabilities of differentials is demonstrated.
Conclusions. The obtained results can be used in analyzing the cryptographic security of ARX-cryptosystems and developing new reliable cryptographic algorithms suitable for low-resource devices.
Keywords: symmetric cryptography, ARX-cryptosystems, differential cryptanalysis, rotational cryptanalysis, RX-analysis.
Cite as: Yakovliev S. Some Algebraic Properties of RX-Differential Probabilities of Boolean Mappings. Cybernetics and Computer Technologies. 2025. 3. P. 100–106. https://doi.org/10.34229/2707-451X.25.3.9
References
1. Lipmaa H., Moriai S. Efficient Algorithms for Computing Differential Properties of Addition. In: Matsui, M. (eds) Fast Software Encryption. FSE 2001. Lecture Notes in Computer Science. Vol 2355. Springer, Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45473-X_28
2. Khovratovich D., Nikolić I. Rotational Cryptanalysis of ARX. In: Hong, S., Iwata, T. (eds) Fast Software Encryption. FSE 2010. Lecture Notes in Computer Science. Vol 6147. Springer, Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13858-4_19
3. Khovratovich D., Nikolic I., Pieprzyk J., Sokołowski P., Steinfeld R. Rotational Cryptanalysis of ARX Revisited. Cryptology ePrint Archive. Paper 2015/095. 2015. https://eprint.iacr.org/2015/095
4. Ashur T., Liu Yu. Rotational Cryptanalysis in the Presence of Constants. Cryptology ePrint Archive. Paper 2016/826. 2016. https://doi.org/10.46586/tosc.v2016.i1.57-70
5. Yakovliev S. Differential Properties of LRX-analogues of Small Constant Multiplication. INTL Journal of Electronics and Telecommunications. 2025. Vol. 71, No. 1. P. 95–100. http://dx.doi.org/10.24425/ijet.2025.153550
6. Biryukov A., Lambin B., Udovenko A. Exact Formula for RX-Differential Probability Through Modular Addition for All Rotations. IACR Transactions on Symmetric Cryptology. 2025. Vol. 2025, No. 1. P. 542–591. https://doi.org/10.46586/tosc.v2025.i1.542-591
7. Yakovliev S., Korzh N. Differential-Rotational Probabilities of Modular Addition and Its Approximations. Theoretical and Applied CyberSecurity. 2024. Vol. 6, No. 2. P. 5–15. https://doi.org/10.20535/tacs.2664-29132024.2.318611
8. NIST and Dworkin M.J. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. 2015. https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=919061 (accessed: 22.06.2025)
9. Dobraunig C., Eichlseder M., Mendel F., Schlaffer M. Ascon v1.2: Lightweight Authenticated Encryption and Hashing. Journal of Cryptology. 2021. Vol. 34. https://doi.org/10.1007/s00145-021-09398-9
10. Beaulieu R., Shors D., Smith J., Treatman-Clark S., Weeks B., Wingers L. The SIMON and SPECK Families of Lightweight Block Ciphers. Cryptology ePrint Archive. Paper 2013/404. 2013. https://eprint.iacr.org/2013/404
11. Ito R., Shiba R., Sakamoto K., Liu F., Isobe T. Bit-wise Cryptanalysis on AND-RX Permutation Friet-PC. Cryptology ePrint Archive. Paper 2021/212. 2021. https://doi.org/10.1016/j.jisa.2021.102860
12. Biryukov A., Roy A., Velichkov V. Differential Analysis of Block Ciphers SIMON and SPECK. Cryptology ePrint Archive. Paper 2014/922. 2014. https://eprint.iacr.org/2014/922
ISSN 2707-451X (Online)
ISSN 2707-4501 (Print)