по
Journal Menu
> Issues > Rubrics > About journal > Authors > About the Journal > Requirements for publication > Council of Editors > Peer-review process > Peer-review in 24 hours: How do we do it? > Policy of publication. Aims & Scope. > Article retraction > Ethics > Copyright & Licensing Policy > Publication in 72 hours: How do we do it? > Digital archiving policy > Open Access Policy > Open access publishing costs > Article Identification Policy > Plagiarism check policy
Journals in science databases
About the Journal

Публикация за 72 часа - теперь это реальность!
При необходимости издательство предоставляет авторам услугу сверхсрочной полноценной публикации. Уже через 72 часа статья появляется в числе опубликованных на сайте издательства с DOI и номерами страниц.
По первому требованию предоставляем все подтверждающие публикацию документы!
MAIN PAGE > Back to contents
Cybernetics and programming
Reference:

Comparison of computational complexity of classification algorithms for recognizing the signs of cyber attacks
Sidel'nikov Oleg Vasil'evich

Lecturer, Department of Information Security in Automated Systems, Military Academy of Communications (in Krasnodar)

350035, Rossiya, g. Krasnodar, ul. Krasina, 4

olegvsk@mail.ru

Abstract.

The article presents a comparison of computational complexity of two logical classification algorithms: an algorithm of sequential search (brute force) and algorithm of inductive states prediction. Logic algorithms are implemented in Matlab. For comparison of the computational complexity of classification algorithms author uses Zakrevskiy technique. Classification problem is one of the main problems in detection of threats of cyber attacks in the information system. Information about the signs of cyber attacks detection can be received from various sources (sensors) of software and hardware of the information system, for example, antivirus tools, dumps RAM logs, hard drives, user logon information, etc. Each of those sources contain information that can be used to determine the presence of an attack on the system. The article reviews the problem of logical classification of already existing data using two algorithms: an algorithm of sequential search (brute force) and algorithm of inductive states prediction. The use of the adapted method of inductive states prediction allowed to reduce amount of computation and get the average gain K ≈ 9,3 and thereby reduce time of detection of computer attacks.

Keywords: logical classification algorithm, inductive algorithm, software, algorithm, threat, security, computational complexity, brute force, states prediction, Matlab

DOI:

10.7256/2306-4196.2014.6.13306

Article was received:

14-10-2014


Review date:

15-10-2014


Publish date:

16-11-2014


This article written in Russian. You can find full text of article in Russian here .

References
1.
Sidel'nikov, O.V. Primenenie metoda induktivnogo prognozirovaniya sostoyanii dlya obnaruzheniya komp'yuternykh atak v informatsionno-telekommunikatsionnykh sistemakh / O.V. Sidel'nikov, V.N. Laptev, V.A. Sharai // Nauchnyi zhurnal KubGAU [Elektronnyi resurs]. – Krasnodar: KubGAU, 2011. – № 72(08). – 10 s. URL: http://ej.kubagro.ru/2011/08/pdf/37.pdf.
2.
Sidel'nikov, O.V. Model' obnaruzheniya i identifikatsii komp'yuternykh atak v informatsionno-telekommunikatsionnykh sistemakh na osnove metoda in-duktivnogo prognozirovaniya sostoyanii / O.V. Sidel'nikov // Informatsionnye tekhnologii v professional'noi deyatel'nosti i nauchnoi rabote. Sbornik materialov Vserossiiskoi nauchno-prakticheskoi konferentsii s mezhdunarodnym uchastiem: v 2 ch. Ch. 1. Materialy. – Ioshkar-Ola: Mariiskii GTU, 2012. – S.177-182.
3.
Sidel'nikov, O.V. Algoritm obnaruzheniya i identifikatsii komp'yuter-nykh atak v informatsionno-telekommunikatsionnykh sistemakh na osnove metoda induktivnogo prognozirovaniya sostoyanii / O.V. Sidel'nikov // Perspektivy razvitiya informatsionnykh tekhnologii: sbornik materialov VII Mezhdunarodnoi nauchno-prakticheskoi konferentsii, pod obshch. red. S.S. Chernova. – Novosibirsk: NGTU, 2012. – S.267-272.
4.
Zakrevskii, A.D. Logika raspoznavaniya. Izd.2-e, dop. / A.D. Zakrevskii – M.: Editorial URSS, 2003. – 144 s.
Link to this article

You can simply select and copy link from below text field.


Other our sites:
Official Website of NOTA BENE / Aurora Group s.r.o.
"History Illustrated" Website