ON THE UNIVERSAL TREE MODE OF HASH CODE GENERATION
Journal Title: Современные информационные технологии и ИТ-образование - Year 2018, Vol 14, Issue 2
Abstract
Classical approaches to the construction of hash function modes, based on the using of iterative procedures, do not allow efficient processing of large amounts of data and can’t be adapted to parallel computing architectures. It applies to both the Russian cryptographic standard GOST R 34.11-2012, which determines the algorithm and procedure for calculating the hash function, as well as many other foreign standards (for example, SHA-3). The absence of standards for parallelized modes for the hash functions of GOST R 34.11-2012 creates an urgent need for the development of the domestic standard of the parallelized mode of hash code. This article is devoted to the research and development of new modes of hash code generation that allow efficient parallelization of the computation process and provide cryptographic resistance satisfying modern requirements. This work continues the research carried out by the authors, and offers a fundamentally new tree mode of hash code generation ("FT-mode"), based on l-ary hash trees and allowed to use any compression mapping for a mechanism of forming tree nodes. The resistance of the mode is completely determined by the resistance of the corresponding compressive mapping. In particular, the FT-mode allows using block ciphers and substitution transformations to form nodes of a hash tree along with compression functions and hash functions. In addition, the FT-mode excludes the main functional disadvantages of the known tree modes of hash code generation that affect their operational, technical and cryptographic quality. Within the framework of the present research a number of characteristics of FT-mode are calculated, and a comparative analysis of the time and computational complexity of implementations of FT-mode and some foreign tree hash modes is carried out. The corresponding results showed that the developed mode is not inferior to any of the considered modes.
Authors and Affiliations
Dmitriy Bogdanov, Farkhad Dali, Vladimir Mironkin
Keywords
Related Articles
- EP ID EP519347
- DOI 10.25559/SITITO.14.201802.419-425
- Views 151
- Downloads 0
AUTOMATION OF DISTRIBUTION OF STUDENTS BETWEEN GRADUATE SUPERVISORS WITH APPLICATION OF TWO-SIDED MATCHING MODEL
The article deals with an approach for modeling and software support of distribution of students between graduate supervisors at large graduate department. The approach is based on the stable matching problem and the Gal...
SIGN LANGUAGE NOTATION SYSTEMS AND THEIR COMPARATIVE ANALYSIS
In this paper we describe gestures and sign language as means of non-verbal communication of people with hearing loss. We give a brief overview of existing sign language notations on currently, designed to depict gesture...
ANALYSIS OF VISUAL RECOGNITION BY MAN ISOLATED WORDS OF ORAL RUSSIAN SPEECH IN THE CONDITIONS OF UNCERTAINTY
The article is devoted to the problems of visual perception by a person of separately spoken words of spoken speech. The factors leading to phonetic and articulatory uncertainty in the pronunciation of words are investig...
PROBLEMS OF USE OF PRELIMINARY INFORMATION TECHNOLOGY IN MARITIME PASSES
The technology of preliminary informing is the priority direction of development of information technologies in the customs authorities. Russian model prior information on Maritime transport contains a number of features...
A METHOD OF CONSTRUCTING A BLOCK CIPHERS ROUND FUNCTION’S POLYNOMIAL OVER A FINITE FIELD
The work outlines the method of construction of round function as a polynomial of one variable over the finite field. The proposed method is based on the calculation of the initial cryptographic transformation at special...