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 145
- Downloads 0
VECTORIZATION OF SMALL-SIZED SPECIAL-TYPE MATRICES MULTIPLICATION USING INSTRUCTIONS AVX-512
Modern software packages for supercomputer calculations require a large amount of computing resources. At the same time there are new hardware architectures that open up new opportunities for program code optimizing. The...
CLUSTERING MODEL OF LOW-STRUCTURED TEXT DATA
The article proposes a clustering model for collections of news text messages, as well as the corresponding bubble trap clustering algorithm. The essence of the proposed approach is to divide the entire vector space of t...
INTERACTIVE METHODS OF CONSTRUCTING ON THE PLANE: THE LOCUS OF POINTS
The article focuses on the problem of how to systematize secondary school students’ knowledge in Geometry while assimilating a concept “Locus of Points”. The scientific concept acts as an integrated didactic unit that co...
ON APPROACHES TO ANALYZING DEMOGRAPHIC DATA USING MACHINE LEARNING
Demographic data are fairly accessible data sets that can be used for analysis with the use of modern technologies of artificial intelligence and machine learning (ML). However, they cannot be used for these purposes wit...
CONCEPT OF THE IMPROVED ARCHITECTURE OF VIRTUAL COMPUTER LABORATORY FOR EFFECTIVE TRAINING OF SPECIALISTS SKILLED IN DISTRIBUTED INFORMATION SYSTEMS AND DESIGN TOOLS
The article discusses the advanced architecture of the virtual computer laboratory, which is used in the innovative practice of training specialists in distributed information systems, as well as software developers skil...