MATHEMATICAL METHODS FOR CONSTRUCTING HASH FUNCTIONS BASED ON THE THEORY OF FINITE FIELDS IN INFORMATION TECHNOLOGY SYSTEMS

Abstract

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.

Author Biographies

George Vostrov, Odessa National Polytechnic University

Ph. D. of Technical Sciences, Associate Professor of the Department of Applied Mathematics and Information Technologies, Odessa National Polytechnic University

Olena Ponomarenko, Odessa National Polytechnic University

Student of the Department of Applied Mathematics and Information Technologies, Odessa National Polytechnic University

Published
2019-01-22
How to Cite
Vostrov, G., & Ponomarenko, O. (2019). MATHEMATICAL METHODS FOR CONSTRUCTING HASH FUNCTIONS BASED ON THE THEORY OF FINITE FIELDS IN INFORMATION TECHNOLOGY SYSTEMS. Electrotechnic and Computer Systems, (29(105), 103-109. https://doi.org/10.15276/eltecs.29.105.2018.11
Section
Protection of an information in computer systems

Most read articles by the same author(s)

1 2 > >>