Hash functions are easy-to-compute compression functions that take a variable-length input and convert it to a fixed-length output. Hash functions are used as compact representations, or digital fingerprints, of data and to provide message integrity. In modern cryptography, various hash functions are widely used. The main problem with using hash functions is that the existence of irreversible functions that exclude the possibility of collisions has not been proven. In addition, there are no universal hashing methods, and they should be selected depending on their area of application. A special role is played by complexity-theoretical problems, namely, algebraic number theory. One of these problems is the search for irreducible polynomials of a given degree over a finite field, which can be used to search for message hash codes.The relevance of the study of irreducible polynomials over simple and extended Galois fields is due to their diverse application in various fields of science and technology. Irreducible polynomials have found their application in various fields of mathematics, information technology and information security. Using the properties of irreducible polynomials allows you to maximize the effective computer implementation of arithmetic in finite fields, which is of particular importance for cryptography and coding theory. Finding irreducible polynomials is difficult to compute, especially over large fields. The procedure for finding irreducible polynomials requires efficient algorithms and large computational resources, as in the case of finding prime numbers, which is the main problem for constructing effective hashing algorithms based on them. This article describes a method for constructing hash functions based on calculating the remainder of a division by irreducible polynomials. In addition, the problem of searching for irreducible polynomials is considered. Computer modeling of hash functions using irreducible polynomials over finite fields has been performed. The results of using various irreducible polynomials and their analysis are presented. The results of the article can be used in cryptographic applications and coding theory.
How to Cite
TURUSBEKOVA, U. K.; TURGINBAYEVA, A. S.. HASHING WITH POLYNOMIALS. Journal of Mathematics, Mechanics and Computer Science, [S.l.], v. 107, n. 3, p. 74-83, sep. 2020. ISSN 2617-4871. Available at: <https://bm.kaznu.kz/index.php/kaznu/article/view/786>. Date accessed: 22 oct. 2020.