Research of collision properties of the modified UMAC algorithm on crypto-code constructions
The transfer of information by telecommunication channels is accompanied by message hashing to control the integrity of the data and confirm the authenticity of the data. When using a reliable hash function, it is computationally difficult to create a fake message with a pre-existing hash code, however, due to the weaknesses of specific hashing algorithms, this threat can be feasible. To increase the level of cryptographic strength of transmitted messages over telecommunication channels, there are ways to create hash codes, which, according to practical research, are imperfect in terms of the speed of their formation and the degree of cryptographic strength. The collisional properties of hashing functions formed using the modified UMAC algorithm using the methodology for assessing the universality and strict universality of hash codes are investigated. Based on the results of the research, an assessment of the impact of the proposed modifications at the last stage of the generation of authentication codes on the provision of universal hashing properties was presented. The analysis of the advantages and disadvantages that accompany the formation of the hash code by the previously known methods is carried out. The scheme of cascading generation of data integrity and authenticity control codes using the UMAC algorithm on crypto-code constructions has been improved. Schemes of algorithms for checking hash codes were developed to meet the requirements of universality and strict universality. The calculation and analysis of collision search in the set of generated hash codes was carried out according to the requirements of a universal and strictly universal class for creating hash codes
Gavrilova, A., Volkov, I., Kozhedub, Y., Korolev, R., Lezik, O., Medvediev, V. et. al. (2020). Development of a modified UMAC algorithm based on cryptocode constructions. Eastern-European Journal of Enterprise Technologies, 4 (9 (106)), 45–63. doi: https://doi.org/10.15587/1729-4061.2020.210683
PQC Standardization Process: Third Round Candidate Announcement (2020). Available at: https://csrc.nist.gov/News/2020/pqc-third-round-candidate-announcement
Xia, L., Yu, X. H., Han, J. (2015). Design of motion control system of industrial robot based on UMAC. Journal of Hefei University of Technology (Natural Science), 38 (8), 1009–1012.
Gorbenko, Y., Svatovskiy, I., Shevtsov, O. (2016). Post-quantum message authentication cryptography based on error-correcting codes. 2016 Third International Scientific-Practical Conference Problems of Infocommunications Science and Technology (PIC S&T). doi: https://doi.org/10.1109/infocommst.2016.7905333
Grimes, R. A. (2020). Cryptography Apocalypse: Preparing for the Day When Quantum Computing Breaks Today's Crypto. John Wiley & Sons, Inc. doi: https://doi.org/10.1002/9781119618232
Wang, L.-J., Zhang, K.-Y., Wang, J.-Y., Cheng, J., Yang, Y.-H., Tang, S.-B. et. al. (2021). Experimental authentication of quantum key distribution with post-quantum cryptography. Npj Quantum Information, 7 (1). doi: https://doi.org/10.1038/s41534-021-00400-7
Krawczyk, H., Rogaway P. (2000). UMAC: Message authentication code using universal hashing. Available at: https://datatracker.ietf.org/doc/html/draft-krovetz-umac-00
Krovetz, T. (2006). UMAC: Message Authentication Code using Universal Hashing. doi: https://doi.org/10.17487/rfc4418
Krovetz, T. (2004). UMAC: Message Authentication Code using Universal Hashing. Available at: https://datatracker.ietf.org/doc/html/draft-krovetz-umac-02.html
Yevseiev, S. P., Yokhov, O. Yu., Korol, O. H. (2013). Heshuvannia danykh v informatsiynykh systemakh. Kharkiv: Vyd. KhNEU, 312. Available at: http://www.repository.hneu.edu.ua/jspui/handle/123456789/6813
Yevseiev, S., Ponomarenko, V., Laptiev, O., Milov, O., Korol, O., Milevskyi, S. et. al.; Yevseiev, S., Ponomarenko, V., Laptiev, O., Milov, O. (Eds.) (2021). Synergy of building cybersecurity systems. Kharkiv: РС ТЕСHNOLOGY СЕNTЕR, 188. doi: https://doi.org/10.15587/978-617-7319-31-2
Copyright (c) 2022 Serhii Yevseiev, Alla Havrylova, Olha Korol, Oleh Dmitriiev, Oleksii Nesmiian, Yevhen Yufa, Asadi Hrebennikov
This work is licensed under a Creative Commons Attribution 4.0 International License.
Our journal abides by the Creative Commons CC BY copyright rights and permissions for open access journals.
Authors, who are published in this journal, agree to the following conditions:
1. The authors reserve the right to authorship of the work and pass the first publication right of this work to the journal under the terms of a Creative Commons CC BY, which allows others to freely distribute the published research with the obligatory reference to the authors of the original work and the first publication of the work in this journal.
2. The authors have the right to conclude separate supplement agreements that relate to non-exclusive work distribution in the form in which it has been published by the journal (for example, to upload the work to the online storage of the journal or publish it as part of a monograph), provided that the reference to the first publication of the work in this journal is included.