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 159
- Downloads 0
CALCULATION OF HYDRODYNAMIC INDICATORS OF VORTEX GRANULATORS WORKING: PROGRAM IMPLEMENTATION OF THE MATHEMATICAL MODEL
The article deals with the software implementation of the author's mathematical model for calculating the trajectory of granule motion in a free and straitened mode, the residence time of granules in the working space of...
THE ELECTRONIC BOOK OF EDUCATIONAL TRAINING TASKS ON PARALLEL PROGRAMMING BASED ON THE MPI 2.0 STANDARD
We discuss one of approaches to the development of educational parallel software and describe the Programming Taskbook for MPI-2 (http://ptaskbook.com/ru/ptformpi2/), a courseware that includes 250 training tasks on vari...
PLAYING WITH A CHAIN OR PHYSICAL AND MATHEMATICAL INFORMATICS
The article describes an educational laboratory work within the framework of interdisciplinary connections at the intersection of informatics, mathematics and physics: the study of the sagging of a closed chain with diff...
MODELING AND ANALYSIS OF FEATURES OF TEAM PLAY STRATEGIES IN ESPORTS APPLICATIONS
The perfect combination of sports and information technologies, implemented in video and computer games, has made eSports unusually popular, rapidly developing and meeting the challenges of the modern world. The scale of...
MOTIVATION OF STUDENT IN IT-DISCIPLINES
Method of systematic literature analysis for 2012-2017 about motivation of the learners in IT disciplines was applied. The growth trend in the number of publications about the motivation of students and the learners of I...