In this paper a method for constructing hash functions based on irreducible polynomials in finite fields was considered. The problem of finding irreducible polynomials was considered. A computer simulation of hash functions was performed using irreducible polynomials. The results of using various irreducible polynomials and their analysis are given. The problem of the occurrence of collisions depending on the length of the hash, and the probability of collisions is estimated depending on the number of enumeration operations were considered.