Scientific and Technical Journal

ELECTROTECHNIC AND COMPUTER SYSTEMS

ISSN Print 2221-3937
ISSN Online 2221-3805
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 initialdata types were analyzed. A method for hashing text files by applying irreducible polynomials was proposed.

Authors:
Keywords
References

Sedgewick, R. (2001), Fundamental algorithms on C++, - Kyiv: Publishing house "DiaSoft", 688 p.

2. Smart, N. (2005), Cryptography, - Moscow: Techno sphere, 528 p.

3. Vostrov, G., Bezrukova, Yu.(2017), Modeling of dynamic data ptotection processes based on a discrete     logarithm, - ELTECS.

4. https://ru.wikipedia.org/wiki/RIPEMD-160

5. https://ru.wikipedia.org/wiki/Хеширование.

6. https://studopedia.ru/2_80095_funktsii-heshirovaniya.html

7. Lidl, R., Niederreiter, G.(1988), Finite fields:In 2 volumes, Transl. from English, - Moscow: Publishing house "Mir", 430 p.

8. Crandall, R., Pomerance, K. (2011), Prime numbers: cryptographic and computational aspects, Transl. from English / Ed. and with a preface by V. Chubarikova, - Moscow: URSS: Book House "LIBROKOM", 664 p.

9. Vostrov, G., Khrinenko, A. (2017), Computer modeling of the processes of chaos formation in nonlinear dynamic maps, - ELTECS.

Published:
Last download:
23 Sept 2018

[ © KarelWintersky ] [ All articles ] [ All authors ]
[ © Odessa National Polytechnic University, 2014-2018. Any use of information from the site is possible only under the condition that the source link! ]
Яндекс.Метрика