DYNAMIC PROCESSES OF HASH FUNCTION FORMATION IN A SYSTEM OF FINITE FIELDS

Abstract

The primary purpose of this article is the hash function formation based on the theory of finite
fields. Standard cryptographic hash functions for digital signature algorithms were considered. The methods
of hashing different initial data types were analyzed. A method for hashing text files by applying irreducible
polynomials was proposed.

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
2018-06-26
Section
Dynamic Systems' Modelling

Most read articles by the same author(s)

<< < 1 2