Issue |
E3S Web of Conf.
Volume 537, 2024
International Scientific and Practical Conference “Sustainable Development of the Environment and Agriculture: Green and Environmental Technologies” (SDEA 2024)
|
|
---|---|---|
Article Number | 09009 | |
Number of page(s) | 8 | |
Section | Sustainable Development of Modern Society in Solving Global Challenges of Green Technologies | |
DOI | https://doi.org/10.1051/e3sconf/202453709009 | |
Published online | 13 June 2024 |
Mathematical Model DDS for Information Security Management of the Organization
1 Nizhny Novgorod State Technical University, Minina str, Nizhny Novgorod, 24, Russia
2 Lobachevsky University of Nizhny Novgorod, Gagahin ave, Nizhny Novgorod, 23, Russia
* Corresponding author: albert810@yandex.ru
The paper describes the mathematical aspects of an intelligent information decision support system (DSS) in the field of information security. A mathematical model of the system is presented. The reaction to a signal of a decrease in the level of security of IT assets is described. When the critical value of the objective function of security is reached, adjustments are being made to the list of information protection measures and review the current level of cyber risks. The system is configured so as not to trigger at the first, possibly random, external alarm. Also at the base of mathematical model there are financial restrictions of organization on ensuring the information security and prices for protection blocks are taken into account. This paper shows the connection of the presented mathematical model with classical linear programming problems. The mathematical formulation of this model is equivalent to the modified knapsack problem, a well-known discrete optimization problem; however, the presented mathematical model has its own specifics, which complicates the solution in the general case for arbitrary number of blocs and sections. In practical implementation, when this number of blocks and sections is not large, the problem, generally speaking, can be solved, among other things, by brute force method. It is shown that under some additional conditions, the problem can be reduced to the assignment problem, which is solved in polynomial time, and under additional conditions on the prices of protection blocks, its solution will the identical permutation. These additional conditions are not contrived or artificial.
© The Authors, published by EDP Sciences, 2024
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.