FORMATION OF HASH CODES BASED ON THE UMAC ALGORITHM ON HYBRID CRYPTO-CODE CONSTRUCTIONS OF McELICE ON DAMAGED CODES

Öz

A study was carried out on the use of an improved UMAC algorithm in post-quantum cryptography based on the formation of a substrate on the third layer of the hash code generation by the McElise crypto-code system on elliptic codes. The paper considers a practical algorithm for generating a hash code based on an example implementation of a cascading UMAC hash algorithm with the McElise crypto-code construction on elliptic codes. Using a hybrid crypto-code design allows you to save the universality of the hash code at the output of the algorithm, which allows its use in large databases as an identifier. In addition, in the context of the implementation of a full-scale quantum computer, US NIST experts consider crypto-code systems as one of the effective post-quantum cryptography algorithms. This approach allows you to implement the UMAC modification on various modifications of hybrid crypto-code structures and to ensure the formation of authentication profiles of different strength and length.

Anahtar Kelimeler

• UMAC hashing algorithm
• McElice hybrid
• crypto code
• elliptic codes

Kaynakça

1. 1. Black, J., Halevi, S., Krawczyk, H., Krovetz, T. and P. Rogaway, “UMAC: Fast and provably secure message authenticationˮ, Advances in Cryptology, CRYPTO '99, LNCS, Vol. 1666, Pages 216-233, 1999.
2. 2. Krovetz, T. and Rogaway, P., “Fast universal hashing with small keys and no preprocessing, work in progressˮ, http://www.cs.ucdavis.edu/~rogaway/umac, October 12, 2000.
3. 3. Krovetz, T., Black, J., Halevi, S., Hevia, A., Krawczyk, H. and Rogaway, P., “UMAC -Message authentication code using universal hashing. IETF Internet Draft, draft-krovetz-umac-01.txt.ˮ, http://www.cs.ucdavis.edu/~rogaway/umac, November 15, 2000.
4. 4. Krovetz T., “UMAC-Message authentication code using universal hashing. IETF Internet Draft, draft-krovetz-umac-02.txt.ˮ, http://www.cs.ucdavis.edu/~rogaway/umac, February 2, 2004.
5. 5. “Final report of European project number IST-1999-12324, named New European Schemes for Signatures, Integrity and Encryptionˮ, Version 0.15 (beta), Springer-Verlag, April 19, 2004.
6. 6. Krovetz T., “UMAC-Message authentication code using universal hashingˮ, http://www.cs.ucdavis.edu/~rogaway/umac, June 23, 2006.
7. 7. Krovetz T., “Software-Optimized Universal Hashing and Message Authentication. Dissertation submitted in partial satisfaction of the requirements for the degree of doctor of philosophyˮ, University Of California Davis, California, September 2000.
8. 8. Carter, J. L. and Wegman, M. N., “Universal classes of hash functionsˮ, Computer and System Scince, No. 18, Pages 143–154, 1979.

9. 9. Wegman, M. N. and Carter, J. L., “New hash functions and their use in authentication and set equalityˮ, Computer and System Scince, No. 22, Pages 265–279, 1981.
10. 10. Korol, Olha, Havrylova, Alla and Yevseiev Serhii “Practical UMAC algorithms based on crypto code designsˮ, Przetwarzanie, transmisja I bezpieczenstwo informacji. Bielsko-Biala: Wydawnictwo naukowe Akademii Techniczno-Humanistycznej w Bielsku-Bialej, Tom 2, Pages 221-232, 2019.
11. 11. Korol, O. G. and Yevseiev, S. P., “The method of universal hashing on the basis of modular transformations, Information processing systemsˮ, Information Technology and Computer Engineering, No. 7(97), Pages 131–132, 2011.
12. 12. Korol, O. G., Yevseiev, S. P. and Dorokhov, A. V., “Mechanisms and protocols for protecting information in computer networks and systemsˮ, Scientific Journal of the Ministry of Defense of Republic of Serbia. Military Technical Gazette, Belgrade, No. 4, Pages 15–30, 2011.
13. 13. Korol, O.G. and Yevseiev, S. P., “Results of the statistical test security hash algorithms-candidates tender to select standard hash algorithm SHA-3ˮ, News of higher technical educational institutions of Azerbaijan, No. 2, Pages 73–78, 2012.
14. 14. Regenscheid, Andrew, Perlner, Ray, Chang, Shu-jen, Kelsey, John, Nandi, Mridul and Paul, Souradyuti, “Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competitionˮ, http://www.nist.gov/index.html, March 3, 2005.
15. 15. Chung-Wei Phan Raphael, “Mini Advanced Encryption Standard (Mini-AES): A testbed for Cryptanalysis Studentsˮ, Cryptologia, XXVI (4), Pages 283–306, 2002.
16. 16. A Description of Baby Rijndael, ISU CprE/Math 533; NTU ST765-U, 2003.
17. 17. Lisitskaya, I. V., Grinenko, T. A. and Bessonov, S. Yu., “Analysis of the differential and linear properties of ciphers rijndael, serpent, threefish with 16-bit inputs and outputs”, East European Journal of Advanced Technologies, Pages 50-54, 2015.
18. 18. Yevseiev, S. P., Ostapov, S. E. and Korolev, R. V., “Use of mini-versions for evaluation of the stability of block-symmetric ciphersˮ, Scientific and Technical Journal “Information Securityˮ, Vol.23, No. 2, Pages 100–108, 2017.
19. 19. Yevseiev, S. P., Yokhov, O. Y. and Korol, O. G., “Data Gaining in Information Systems: monographˮ. pub. KhNUE, Kharkiv, 2013.
20. 20. Yevseiev, S., Rzayev, H. and Tsyganenko, A., “Analysis of the software implementation of direct and inverse transformations using the non-binary balanced coding method”, Science and Technology Journal “Security Without Information”, Vol. 22, No. 2, Pages 196–203, 2016.
21. 21. Yeseiev, S., “The use of flawed codes in crypto-code systems”, Information processing systems, No. 5 (151), Pages 109–121, 2017.
22. 22. Yevseiev, S. and Bilodid, I., “The use of unprofitable codes in hybrid crypto-code designsˮ, Fifth International Scientific and Technical Conference “Problems of Informatizationˮ, Cherkasy – Baku – Bielsko-Biala – Poltava, Page 11, 2017.
23. 23. Hryshchuk, R., Yevseiev, S. and Shmatko, A., “Construction methodology of information security system of banking information in automated banking systems: monographˮ, Pages 134–156, Premier Publishing s. r. o., Vienna, 2018.