TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

On retrieval of secret key parameters from symmetric block cipher O’zDST 1105:2009 using modified SQUARE cryptanalysis

*

* Corresponding author · click or hover a name for details

pp. 2309–2322Vol. 28Issue 6September 2025DOI: 10.47974/JDMSC-2230 Crossmark XML
Received:
07 May 2024
Published Online:
12 Jul 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2230
Pages:
2309–2322

Abstract

In this article, the application of SQUARE cryptanalysis to the Uzbek standard of symmetric block encryption is investigated. We have constructed an efficient attack on the 1st and 2nd rounds of the Uzbek algorithm, allowing to retrieve several bytes of the secret key. We found that the constructed attack is almost surely successful. This article highlights the importance of studying the interaction of different transformations, as the success of the devised attack relies on using operations in the ring modulo 256, rather than in a finite field.

Keywords

CryptanalysisSQUARESymmetric block cipher

Subject Classifications

11T7113C13

References

[1] The data encryption algorithm O’zDST 1105: State Standard of Uzbekistan (official publication), approved and put into effect by the decree of the Uzbek Agency for Standardization, Metrology and Certification, dated Sept. 28, 2009, No. 05-163 (2009). [Online]. Available: https://tace.uz/docs/OzDSt_1105.pdf
[2] I. Dinur, O. Dunkelman, and A. Shamir, “Improved attacks on full GOST,” in Fast Software Encryption, Lecture Notes in Computer Science, vol. 7549, pp. 9–28 (2012). doi: 10.1007/978-3-642-34047-5_2.
[3] B. Abdurakhimov, Z. Khudoykulov, O. Allanov, and I. Boykuziev, “Algebraic cryptanalysis of O’zDSt 1105:2009 encryption algorithm,” in Proc. Int. Conf. on Information Science and Communications Technologies (ICISCT), pp. 1–7 (2020).
[4] J. Daemen, L. Knudsen, and V. Rijmen, “The block cipher Square,” in Fast Software Encryption — FSE 1997, Lecture Notes in Computer Science, vol. 1267, E. Biham, Ed. Springer, pp. 149–165 (1997).
[5] S. Shahapure, V. Sule, and R. D. Daruwala, “Variation and security enhancement of block ciphers by embedding,” J. Discrete Math. Sci. Cryptogr., vol. 22, no. 2, pp. 151–160 (2019). doi: 10.1080/09720529.2019.1576336.
[6] K. Achkoun, C. Hanin, and F. Omary, “SPF-CA: A new cellular automata-based block cipher using key-dependent S-boxes,” J. Discrete Math. Sci. Cryptogr., vol. 23, no. 8, pp. 1529–1544 (2019). doi: 10.1080/09720529.2019.1649031.
[7] M. Kumar, “Full-round differential attack on DoT block cipher,” J. Discrete Math. Sci. Cryptogr., pp. 1–13 (2022). doi: 10.1080/09720529.2021.1961905.
[8] A. Ikramov, M. Aripov, and G. Juraev, “SPONGE structure in the basis of a new stream cipher,” AIP Conf. Proc., vol. 2781, no. 1, p. 020045 (2023). doi: 10.1063/5.0144775.
[9] A. Ikramov and G. Juraev, “The complexity of testing cryptographic devices on input faults,” in Network and System Security (NSS 2021), Lecture Notes in Computer Science, vol. 13041, M. Yang, C. Chen, and Y. Liu, Eds. Cham: Springer (2021). doi: 10.1007/978-3-030-92708-0_12.

Views: 130Downloads: 77Citations: 0