A Model of Optimal Complexification of Measures Providing Information Security

Abstract: An optimization mathematical model and an algorithm of complexification of the measures providing information security are presented. As an indicator of complexification efficiency, the level of the costs of execution of the tasks of providing the information security of a protected object is used. Thus, the costs of the elaboration (preparation) of these measures and their implementation costs for the information security system are considered separately. The optimization algorithm is based on the common principles of the branch and bound method. Its feature is the proposed algorithm for estimating the bounds for alternative branches. The model has a universal character and may be used when developing the algorithms for supporting the corresponding management decisions concerning information security for concrete information infrastructures of managerial-technical, social, economic, and other objects. © 2020, Allerton Press, Inc.

Авторы
Zegzhda P.D.1 , Anisimov V.G. 1 , Suprun A.F.1 , Anisimov E.G. 2 , Saurenko T.N. 2 , Los’ V.P.3
Номер выпуска
8
Язык
Английский
Страницы
930-936
Статус
Опубликовано
Том
54
Год
2020
Организации
  • 1 Peter the Great St. Petersburg Polytechnic University, St. Petersburg, 195251, Russian Federation
  • 2 Peoples’ Friendship University of Russia, Moscow, 117198, Russian Federation
  • 3 Russian Technological University MIREA, Moscow, 119454, Russian Federation
Ключевые слова
algorithm; complex of information security measures; information security; model; optimization
Дата создания
20.04.2021
Дата изменения
20.04.2021
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/72502/