A METHOD OF THE TRANSMITTED BLOCKS INFORMATION INTEGRITY CONTROL
DOI:
https://doi.org/10.15588/1607-3274-2020-1-18Keywords:
Probability calculation, messages limited in length, authentication control, hash field length, duplicating branches in a chain.Abstract
Context. For the proper operation of the hardware and software systems, it is necessary that the hardware component receives data only from the corresponding software. Otherwise, the data received from extraneous programs that can be perceived and processed by the device, which can lead to errors in the operation of the device or even a complete loss of its functionality or data.
Objective. In order to increase the reliability of legal software data and identify the challenges of the transfer of blocks, this article focuses on a comprehensive study of the problems arising from the transmission of information in the form of separate data blocks.
Method. The methods of integrity control in modes of transmission are described. The method based on hashes and block delivery time is analyzed in detail, analysis the methods of reducing the probability of errors occurring in the receiver and the possibility of reducing the reception of the extraneous blocks when receiving individual blocks of information. This is done by using a set of mathematical equations. And measure the extent of the effect of intensity of receiving extraneous blocks and hash field length.
Results. In the process of analyzing systems in which information is transmitted by block, when using the method of formation of information chains based on the method the hashes and the delivery time of the block, where we note, when the value of the hash field is equal to 6 or more, the probability of occurrence of duplicate branches is acceptably low. Where, when hash field more then 6, the parameter of length of a chain practically does not affect the final probability of constructing a chain from the extraneous blocks. The very same value of the probability of constructing a false chain, the length exceeding the chain of legal blocks at hash field more 6 is about1 10–3, which it’s acceptable for real information transmission systems.
Conclusions. Based on the analysis, we can conclude that in systems in which information is transmitted block by block, when using the method of generating information chains based on the hash and block arrival time, with a hash field of 6 or more, the probability of occurrence of duplicate branches is acceptably low.
References
National Institute of Standards and Technology. Recommendation for Block Cipher Modes of Operation: NIST Special Publication 800–38A. Gaithersburg, Maryland, October 2010. 11p.
National Institute of Standards and Technology. Recommendation for Block Cipher Modes of Operation: The CCM Mode for Authentication and Confidentiality. NIST Special Publication 800–38C. Gaithersburg, Maryland, May 2004. 25p.
Tanygin M. O., Tipikin A. P. Architecture of system of hardware restriction of access to information on a computer hard disk, Telecommunications, 2006, No. 3, pp. 44–46.
Knudson L. Block Chaining Modes of Operation. NIST First Modes of Operation Workshop [Electronic resource]. October 2010. Access mode: http://csrc.nist.gov/groups/ST/toolkit/BCM/workshops.html.
Gervais A., Ghassan O., Wüst K., Glykantzis V., Ritzdorf H., Capkun S. On the Security and Performance of Proof of Work Blockchains [Electronic resource], 2016. – Access mode: https://eprint.iacr.org/2016/555.pdf.
Black J., Rogaway P. and Shrimpton T. CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions. Advances in Cryptology, CRYPTO ‘00. Santa Barbara, California, 2000, pp. 197–215.
Swan M. Blockchain: Blueprint for a New Economy. O’Reilly Media, Inc., 2015, 152 p.
McGrew D., Viega J. The Security and Performance of the Galois/Counter Mode (GCM) of Operation, In Proceedings: Indocrypt, 2004, pp. 343–355.
Tanygin M.O. Method of Control of Data Transmitted Between Software and Hardware, Computer Science and Engineering: Materials of the IV International Conference of Young Scientists CSE-2010. Lviv, Publishing House of Polytechnics, 2010, pp. 344–345.
Bellare M., Kilian J., Rogaway P. The security of the cipher block chaining message authentication code, JCSS, 1994, Vol. 3, No. 3, pp. 341–358.
Stallings W. NIST Block Cipher Modes of Operation for Authentication and Combined Confidentiality and Authentication, Cryptologia, 2010, pp. 225 – 23.
Stallings W. The Advanced Encryption Standard. Cryptologia, 2002, No. 26, pp. 165–188.
Tanygin M.O. Calculation of the probability of collisions when using the message authentication algorithm, News SWSU, 2012, pp. 179–183.
Gubarev A. V., Tanygin M. O. Research of dependence of time of searching legal instruction words from the width of the buffer the received instruction words, Telecommunications, 2015, pp. 21–26.
Stallings W. NIST Block Cipher Modes of Operation for Confidentiality, Cryptologia, 34(2), pp. 163–175.
Tilborg H. C. Encyclopedia of Cryptography and Security. Heidelberg, Springer, 2005, pp. 11–15.
Lipmaa H. P., Rogaway P., and Wagner D. CTR Mode Encryption. NIST First Modes of Operation Workshop [Electronic resource]. Access mode: http://csrc.nist.gov/groups/ST/toolkit/BCM/ workshops.html.
Voydock V., Kent S. Security Mechanisms in High-Level Network Protocols, Computing Surveys, June 1983, pp. 135–171.
Tanygin M.O., Search and elimination of collisions in information exchange through open communication channels, Problems of Informatics in Education, Management, Economics and Technology: a collection of articles of the Xth International Scientific and Technical Conference. Penza, Privolzhsky House of Knowledge, 2010. pp. 62–64.
Downloads
How to Cite
Issue
Section
License
Copyright (c) 2020 M. O. Tanygin, H. Y. Alshaeaa, E. A. Kuleshova
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
