Articolul precedent |
Articolul urmator |
327 3 |
Ultima descărcare din IBN: 2024-05-20 16:34 |
SM ISO690:2012 BOLUN, Ion. Prioritization of Cybersecurity Measures. In: Electronics, Communications and Computing: IC|ECCO-2021, Ed. 11, 21-22 octombrie 2021, Chişinău. Chișinău, Republica Moldova: Technical University of Moldova, 2021, Editia 11, pp. 194-199. ISBN 978-9975-45-776-7. DOI: https://doi.org/10.52326/ic-ecco.2021/SEC.01 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Electronics, Communications and Computing Editia 11, 2021 |
||||||
Conferința "Electronics, Communications and Computing" 11, Chişinău, Moldova, 21-22 octombrie 2021 | ||||||
|
||||||
DOI:https://doi.org/10.52326/ic-ecco.2021/SEC.01 | ||||||
Pag. 194-199 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The considerable losses caused by the low level of cyber security of companies, institutions and so on and the limited financial resources available imply the need to prioritize the implementation of measures to counter cyber attacks. For this purpose, the respective optimization problem is formulated as a Boolean mathematical programming one. At large dimensions, the use of known methods of solving the problem requires a large volume of calculations. That’s why, a simple rule for approximately solving the problem is obtained. By computer simulation, it is shown that the error of the solution when using this rule decreases considerably with the increase of the number of cybersecurity measures, more accurate – the more detailed such measures are. In order to reduce the error of solutions, three other simple algorithms are also proposed. The latter of these algorithms is more detailed and allows to reduce to a greater extent the solutions’ error. |
||||||
Cuvinte-cheie algorithm, entity, cybersecurity means, ordering rule, optimization problem |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Bolun, I.T.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Prioritization of Cybersecurity Measures</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2021</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978-9975-45-776-7</relatedIdentifier> <subjects> <subject>algorithm</subject> <subject>entity</subject> <subject>cybersecurity means</subject> <subject>ordering rule</subject> <subject>optimization problem</subject> </subjects> <dates> <date dateType='Issued'>2021</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><p>The considerable losses caused by the low level of cyber security of companies, institutions and so on and the limited financial resources available imply the need to prioritize the implementation of measures to counter cyber attacks. For this purpose, the respective optimization problem is formulated as a Boolean mathematical programming one. At large dimensions, the use of known methods of solving the problem requires a large volume of calculations. That’s why, a simple rule for approximately solving the problem is obtained. By computer simulation, it is shown that the error of the solution when using this rule decreases considerably with the increase of the number of cybersecurity measures, more accurate – the more detailed such measures are. In order to reduce the error of solutions, three other simple algorithms are also proposed. The latter of these algorithms is more detailed and allows to reduce to a greater extent the solutions’ error.</p></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>