In this paper the method for constructing hash functions on the basis of irreducible polynomials in finite fields has been considered. The problem of searching for irreducible polynomials was considered. Computer modeling of hash functions using irreducible polynomials was performed. The results of the use of various irreducible polynomials and their analysis was presented.