DESCRIPTION OF ALGORITHMS FOR BALANCING NUMERICAL MATRICES AND THEIR DIVISION INTO HIERARCHICAL LEVELS ACCORDING TO THEIR TYPE AND COMPLEXITY
Open Access
- 31 March 2021
- journal article
- research article
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 11 (1) , 44-49
Abstract
This article describes a set of algorithms for so-called balancing of numerical matrices, which were developed by the author. Each section consists of several algorithms that are divided into different levels. The order of these levels depended on the chronology of the creation of certain algorithms. Chronology also affected the complexity of these balancing algorithms, so it can be argued that the algorithms are described in order from the simplest level to the most complex. It is important to emphasize that the purpose of the article is to describe the actions on matrices that determine the balancing algorithm of a certain level, and practical application will be the next step.Keywords
This publication has 10 references indexed in Scilit:
- Risk level analysis in the selected (initial) stage of the project life cycleManagement and Production Engineering Review, 2020
- Research on the use of algorithms for matrix transformations for encrypting text informationSecurity and Privacy, 2020
- Password generation for wireless network with using variable complication ruleUkrainian Information Security Research Journal, 2019
- Symmetric Key Encryption using Iterated Fractal FunctionsInternational Journal of Computer Network and Information Security, 2017
- Encryption through the use of fractalsInternational Journal of Mathematical Analysis, 2017
- Application mirroring of matrices to prevent excessive reduction2016
- Textual Encodings of PKIX, PKCS, and CMS Structures2015
- RF simulator for cryptographic protocol2014
- Quantitative Metrics and Risk Assessment: The Three Tenets Model of CybersecurityTechnology Innovation Management Review, 2013
- Biclique Cryptanalysis of the Full AES2011