{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T03:01:24Z","timestamp":1763348484896,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Higher Education of Kazakhstan","award":["AP14870719"],"award-info":[{"award-number":["AP14870719"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>A new symmetric block cipher algorithm called AL02 has been developed. The algorithm scheme provides five-round encryption of 128-bit blocks, while the data size at the input and output of the S-box is 8 bits. The main transformation is the F transformation. The difference between the proposed algorithm and the classical scheme is that the F transformation provides the maximum possible dependence of the output vector bits on the input bits and is based on \u201cmodulo 2 addition\u201d and a substitution S-box. To assess the strength of the AL02 algorithm, it was programmatically implemented in the C programming language. During the analysis, the cryptographic properties of the developed encryption algorithm were tested. The algorithm was tested for statistical security. For an experimental assessment, in order to ensure that the ciphertext is not inferior to a random sequence in its properties, the well-known sets of statistical tests by NIST (National Institute of Standards and Technology) and Donald Knuth were used. The property of the avalanche effect was also checked. The strength was evaluated using the methods of differential and linear cryptanalysis.<\/jats:p>","DOI":"10.3390\/computation10110198","type":"journal-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T05:54:46Z","timestamp":1667541286000},"page":"198","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Development and Study of an Encryption Algorithm"],"prefix":"10.3390","volume":"10","author":[{"given":"Nursulu","family":"Kapalova","sequence":"first","affiliation":[{"name":"Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan"},{"name":"Faculty of Information Technology, Al-Farabi Kazakh National University, Almaty 050040, Kazakhstan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6812-6000","authenticated-orcid":false,"given":"Kairat","family":"Sakan","sequence":"additional","affiliation":[{"name":"Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan"},{"name":"Faculty of Information Technology, Al-Farabi Kazakh National University, Almaty 050040, Kazakhstan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3670-2170","authenticated-orcid":false,"given":"Kunbolat","family":"Algazy","sequence":"additional","affiliation":[{"name":"Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan"},{"name":"Faculty of Information Technology, Al-Farabi Kazakh National University, Almaty 050040, Kazakhstan"}]},{"given":"Dilmukhanbet","family":"Dyusenbayev","sequence":"additional","affiliation":[{"name":"Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Lindell, Y. (2017). The Many Entropies in One-Way Functions. Tutorials on the Foundations of Cryptography. Information Security and Cryptography, Springer.","DOI":"10.1007\/978-3-319-57048-8"},{"key":"ref_2","unstructured":"Panasenko, S.P. (2009). Encryption Algorithms, S-P, BHV-Petersburg. Special Reference-Book."},{"key":"ref_3","first-page":"171","article-title":"Improved Security Evaluation of SPN Block Ciphers and its Applications in the Single-key Attack on SKINNY","volume":"4","author":"Zhang","year":"2019","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1515\/eng-2018-0013","article-title":"The model of encryption algorithm based on non-positional polynomial notations and constructed on an SP network","volume":"1","author":"Kapalova","year":"2018","journal-title":"Open Eng."},{"key":"ref_5","first-page":"48","article-title":"GOST R 34.12\u20132015: What to expect from the new standard?","volume":"4","author":"Bondarenko","year":"2015","journal-title":"Inf. Secur."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Dragomir, I., M\u0103lu\u0163an, S., and Lazar, M. (2019, January 27\u201329). An analysis of cryptographic algorithm strength based on S-box properties. Proceedings of the 2019 11th International Conference on Electronics, Computers and Artificial Intelligence (ECAI), Pitesti, Romania.","DOI":"10.1109\/ECAI46879.2019.9042161"},{"key":"ref_7","first-page":"103129","article-title":"New differential cryptanalysis results for the lightweight block cipher BORON","volume":"66","author":"Teh","year":"2022","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_8","first-page":"3189601","article-title":"Mufti Cryptographic Strength Evaluation of Key Schedule Algorithms","volume":"5","author":"Afzal","year":"2020","journal-title":"Secur. Commun. Netw."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"025002","DOI":"10.1103\/RevModPhys.92.025002","article-title":"Secure quantum key distribution with realistic devices","volume":"92","author":"Xu","year":"2020","journal-title":"Rev. Mod. Phys."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Xie, Y., Lu, Y., Weng, C., Cao, X., Jia, Z., Bao, Y., Wang, Y., Fu, Y., Yin, H., and Chen, Z. (2021). Breaking the Rate-Loss Relationship of Quantum Key Distribution with Asynchronous Two-Photon Interference. arXiv.","DOI":"10.1103\/PRXQuantum.3.020315"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"032316","DOI":"10.1103\/PhysRevA.93.032316","article-title":"Practical quantum digital signature","volume":"93","author":"Yin","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"10162","DOI":"10.1364\/OE.420667","article-title":"Efficient quantum digital signatures without symmetrization step","volume":"29","author":"Lu","year":"2021","journal-title":"Opt. Express"},{"key":"ref_13","unstructured":"Babenko, L.K., and Ischukova, E.A. (2006). Modern Block Cipher Algorithms and Methods for Their Analysis, Helios ARV. Available online: http:\/\/www.tnu.in.ua\/study\/books\/entry-1782833.html."},{"key":"ref_14","first-page":"137","article-title":"Avalanche and Bit Independence Properties for the Ensembles of Randomly Cho-sen S-Boxes","volume":"2","author":"Vergili","year":"2001","journal-title":"Turk. J. Electr. Eng."},{"key":"ref_15","unstructured":"Helleseth, T. (1993). Linear Cryptanalysis Method for DES Cipher. Advances in Cryptology, Springer. Available online: https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48285-7_33.pdf."},{"key":"ref_16","unstructured":"Pascale, S. (2000). The Degrees of Completeness, of Avalanche Effect, and of Strict Avalanche Criterion for MARS, RC6, Rijndael, Serpent, and Twofish with Reduced Number of Rounds, KU Leuven, ESAT\/COSIC. Available online: https:\/\/www.cosic.esat.kuleuven.be\/nessie\/reports\/phase1\/sagwp3-003.pdf."},{"key":"ref_17","unstructured":"Dyusenbaev, D.S., Algazy, K.T., and Sakan, K.S. (2021, January 11). Study of nonlinear knots used in symmetric ciphers. Proceedings of the Actual Problems of Information Security in Kazakhstan APIBK-2020, Almaty, Kazakhstan. Available online: https:\/\/conf.iict.kz\/wp-content\/uploads\/2021\/06\/collection-apibk2021.pdf."},{"key":"ref_18","first-page":"647","article-title":"Differential Cryptanalysis of New Qamal Encryption Algorithm","volume":"66","author":"Algazy","year":"2019","journal-title":"Int. J. Electron. Telecommun."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/10\/11\/198\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:10:36Z","timestamp":1760145036000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/10\/11\/198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,4]]},"references-count":18,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["computation10110198"],"URL":"https:\/\/doi.org\/10.3390\/computation10110198","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2022,11,4]]}}}