Development of a method for checking vulnerabilities of a corporate network using Bernstein transformations

Abstract

One of the leading areas of cybersecurity of communication networks is considered – the introduction of preventive mechanisms, among which the most promising are the methods of active security analysis. These methods allow, in addition to timely detection of vulnerabilities of the target system (analyzed system), to confirm the possibility of their implementation, that is, to validate vulnerabilities by simulating the real actions of a potential attacker. The urgent need to validate vulnerabilities out of the many identified is caused by the fact that some of them can only be theoretical, while others are exploited using malicious scripts (exploits). At the same time, the process of validating vulnerabilities is practically not studied. That is why the work carried out an experimental study of the functioning of modern tools for exploiting vulnerabilities. Based on the observations, general quantitative characteristics of the vulnerability validation process were identified. A mathematical model for the analysis of the above characteristics based on Bernstein polynomials has been developed. It is the polynomial representation of the procedure for confirming the possibility of implementing the identified vulnerabilities that makes it possible to describe the dynamics of this process, taking into account the complex and volatile nature of the environment. Analytical dependencies are obtained for the number of cases of successful and negative confirmation of vulnerabilities. In particular, negative validation cases include simply failed attempts to validate vulnerabilities, as well as attempts that resulted in critical errors on the target system during the rational cycle of validating the identified vulnerabilities. The proposed dependencies make it possible to construct the probability distribution laws for the above characteristics of the vulnerability testing process.

Development of a hardware cryptosystem based on a random number generator with two types of entropy sources

“…Separately, the group of PRNG based on elliptic curves should be noted. Several PRNG algorithms based on the properties of elliptic curves have been proposed [11]. As a rule, the implementation of such PRNG is based on the use of already known algorithms for a group of points on an elliptic curve.…”

“…The work [11] considers hardware information protection in the form of a built-in computer board. They are special devices that are installed in a computer in order to protect the information processed on it.…”

A comprehensive method of evaluating the effectiveness of the distance learning system in higher education institutions

“…Уважається, що оптимальна за чисельністю група експертів становитиме 10-15 осіб. У цьому разі ймовірність істинності колективного експертного висновку 13 дорівнює приблизно 0,8. 13 .…”

“…У цьому разі ймовірність істинності колективного експертного висновку 13 дорівнює приблизно 0,8. 13 .…”

The Methodology for Evaluating the Functional Stability of the Protection System of Special Networks

“…In this theory, stability can be estimated without solving the system of differential equations which describing the object, and, using simple signs, conditions and stability criteria, developed by Vyshnegradsky I. O., Gurvits A., Mikhailov A. V., Nyquist H. and others. By the analogy with the classical theory of stability, it is proposed to evaluate the functional stability of the parameters of the graph describing the structure of the wireless sensor network [12,17]. It turns out that the appearance of the graph and its parameters can be determined: whether the network is functionally stable, unstable or neutral.…”