Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2019-4-61-71
Dmitry Leschyov, Daniel Suchkov, S. Khaykova, A. Chepovskiy
{"title":"Algorithms to Reveal Communication Groups","authors":"Dmitry Leschyov, Daniel Suchkov, S. Khaykova, A. Chepovskiy","doi":"10.21681/2311-3456-2019-4-61-71","DOIUrl":"https://doi.org/10.21681/2311-3456-2019-4-61-71","url":null,"abstract":"","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121553807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2022-2-27-38
V. Vasilyev, A. Vulfin, Nailya Kuchkarova
Purpose: development of an automated system for assessing current threats to the security of software of industrial automation systems based on the technology of Transformers. Methods: comparison of the set of identified software vulnerabilities, corresponding tactics (techniques) and relevant threats to information security by assessing the semantic proximity metrics of their text descriptions using Text Mining technology based on transformers models. Practical relevance: an automated system for assessing current software security threats has been developed, which makes it possible to compare and rank information and cyber security threats for identified vulnerabilities from the FSTEC of Russia Information Security Threats Databank, to automate the selection of techniques and tactics for constructing threat scenarios. The results of the comparative analysis show that the use of this system makes it possible to simplify the procedure for selecting potential threats and comparing vulnerabilities to them, in addition, a possible set of tactics and techniques is automatically generated, which makes it possible to reduce the time spent on building scenarios for the implementation of threats.
{"title":"Assessment of Current Threats to Information Security Using Transformer Technology","authors":"V. Vasilyev, A. Vulfin, Nailya Kuchkarova","doi":"10.21681/2311-3456-2022-2-27-38","DOIUrl":"https://doi.org/10.21681/2311-3456-2022-2-27-38","url":null,"abstract":"Purpose: development of an automated system for assessing current threats to the security of software of industrial automation systems based on the technology of Transformers. Methods: comparison of the set of identified software vulnerabilities, corresponding tactics (techniques) and relevant threats to information security by assessing the semantic proximity metrics of their text descriptions using Text Mining technology based on transformers models. Practical relevance: an automated system for assessing current software security threats has been developed, which makes it possible to compare and rank information and cyber security threats for identified vulnerabilities from the FSTEC of Russia Information Security Threats Databank, to automate the selection of techniques and tactics for constructing threat scenarios. The results of the comparative analysis show that the use of this system makes it possible to simplify the procedure for selecting potential threats and comparing vulnerabilities to them, in addition, a possible set of tactics and techniques is automatically generated, which makes it possible to reduce the time spent on building scenarios for the implementation of threats.","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125143378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2019-2-13-20
D. Lavrova, D. Zegzhda, E. Zaitceva
{"title":"Simulation of Complex Objects Network Infrastructure to Solve The Problem of Counteraction to Cyber Attacks","authors":"D. Lavrova, D. Zegzhda, E. Zaitceva","doi":"10.21681/2311-3456-2019-2-13-20","DOIUrl":"https://doi.org/10.21681/2311-3456-2019-2-13-20","url":null,"abstract":"","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129716128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2019-6-59-68
S. Kondakov, T. Meshcheryakova, Skryl’ Sergey, A. Stadnik, A. Suvorov
{"title":"Probabilistic Representations of Conditions for Timely Response to Computer Attack Threats","authors":"S. Kondakov, T. Meshcheryakova, Skryl’ Sergey, A. Stadnik, A. Suvorov","doi":"10.21681/2311-3456-2019-6-59-68","DOIUrl":"https://doi.org/10.21681/2311-3456-2019-6-59-68","url":null,"abstract":"","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128022685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2022-3-2-22
Alexei Petrenko, S. Petrenko
Abstract Purpose of work is the development of a new method for estimating the quantum resilience of modern blockchain platforms based on the effective solution of cryptanalysis problems for asymmetric encryption schemes (RSA, El-Gamal) and digital signature (DSA, ECDSA or RSA-PSS), based on computationally difficult problems of factorization and discrete logarithm. Research method is the use of quantum algorithms providing exponential gain (eg Shor’s algorithm) and quadratic gain (eg Grover’s algorithm). Due to the fact that the class of problems solved by quantum algorithms in polynomial time cannot yet be significantly expanded, more attention is paid to cryptanalysis based on the quantum Shor algorithm and other polynomial algorithms. Results of the study include a classification of well-known algorithms and software packages for cryptanalysis of asymmetric encryption schemes (RSA, El-Gamal) and digital signature (DSA, ECDSA or RSA-PSS) based on computationally difficult problems of factorization and discrete logarithm has been built. A promising method for solving problems of cryptanalysis of asymmetric encryption schemes (RSA, ElGamal) and digital signature (DSA, ECDSA or RSA-PSS) of known blockchain platforms in polynomial time in a quantum computing model is proposed. Algorithms for solving problems of quantum cryptanalysis of two-key cryptography schemes of known blockchain platforms in polynomial time are developed, taking into account the security of the discrete algorithm (DLP) and the discrete elliptic curve algorithm (ECDLP). A structural and functional diagram of the software package for quantum cryptanalysis of modern blockchain platforms “Kvant-K”, adapted to work in a hybrid computing environment of the IBM Q quantum computer (20 and 100 qubits) and the IBM BladeCenter (2022) supercomputer, has been designed. A methodology has been developed for using the “Kvant-K” software package to assess the quantum stability of blockchain platforms: InnoChain (Innopolis University), Waves Enterprise (Waves, Vostok), Hyperledger Fabric (Linux, IBM), Corda Enterprise, Bitfury Exonum, Blockchain Industrial Alliance, Exonum (Bitfury CIS), NodesPlus (b41), Masterchain (Sberbank), Microsoft Azure Blockchain, Enterprise Ethereum Alliance, etc. Practical relevance: The developed new solution for computationally difficult problems of factorization and discrete logarithm, given over finite commutative (and non-commutative) associative algebras, in a quantum model of computing in polynomial time. It is essential that the obtained scientific results formed the basis for the development of the corresponding software and hardware complex “Kvant-K”, which was tested in a hybrid computing environment (quantum computer IBM Q (20 and 100 qubits) and/or 5th generation supercomputer: IBM BladeCenter (2022), RCS based on FPGA Virtex UltraScale (2020), RFNC-VNIIEF (2022) and SKIF P-0.5 (2021). An appropriate method for estimating the quantum stability of these b
{"title":"Quantum Resilience Estimation Method Blockchain","authors":"Alexei Petrenko, S. Petrenko","doi":"10.21681/2311-3456-2022-3-2-22","DOIUrl":"https://doi.org/10.21681/2311-3456-2022-3-2-22","url":null,"abstract":"Abstract Purpose of work is the development of a new method for estimating the quantum resilience of modern blockchain platforms based on the effective solution of cryptanalysis problems for asymmetric encryption schemes (RSA, El-Gamal) and digital signature (DSA, ECDSA or RSA-PSS), based on computationally difficult problems of factorization and discrete logarithm. Research method is the use of quantum algorithms providing exponential gain (eg Shor’s algorithm) and quadratic gain (eg Grover’s algorithm). Due to the fact that the class of problems solved by quantum algorithms in polynomial time cannot yet be significantly expanded, more attention is paid to cryptanalysis based on the quantum Shor algorithm and other polynomial algorithms. Results of the study include a classification of well-known algorithms and software packages for cryptanalysis of asymmetric encryption schemes (RSA, El-Gamal) and digital signature (DSA, ECDSA or RSA-PSS) based on computationally difficult problems of factorization and discrete logarithm has been built. A promising method for solving problems of cryptanalysis of asymmetric encryption schemes (RSA, ElGamal) and digital signature (DSA, ECDSA or RSA-PSS) of known blockchain platforms in polynomial time in a quantum computing model is proposed. Algorithms for solving problems of quantum cryptanalysis of two-key cryptography schemes of known blockchain platforms in polynomial time are developed, taking into account the security of the discrete algorithm (DLP) and the discrete elliptic curve algorithm (ECDLP). A structural and functional diagram of the software package for quantum cryptanalysis of modern blockchain platforms “Kvant-K”, adapted to work in a hybrid computing environment of the IBM Q quantum computer (20 and 100 qubits) and the IBM BladeCenter (2022) supercomputer, has been designed. A methodology has been developed for using the “Kvant-K” software package to assess the quantum stability of blockchain platforms: InnoChain (Innopolis University), Waves Enterprise (Waves, Vostok), Hyperledger Fabric (Linux, IBM), Corda Enterprise, Bitfury Exonum, Blockchain Industrial Alliance, Exonum (Bitfury CIS), NodesPlus (b41), Masterchain (Sberbank), Microsoft Azure Blockchain, Enterprise Ethereum Alliance, etc. Practical relevance: The developed new solution for computationally difficult problems of factorization and discrete logarithm, given over finite commutative (and non-commutative) associative algebras, in a quantum model of computing in polynomial time. It is essential that the obtained scientific results formed the basis for the development of the corresponding software and hardware complex “Kvant-K”, which was tested in a hybrid computing environment (quantum computer IBM Q (20 and 100 qubits) and/or 5th generation supercomputer: IBM BladeCenter (2022), RCS based on FPGA Virtex UltraScale (2020), RFNC-VNIIEF (2022) and SKIF P-0.5 (2021). An appropriate method for estimating the quantum stability of these b","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120964237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2019-5-57-62
R. Astrakhantsev, Alexey Los, R. Muhamadieva
{"title":"Analysis of Modern Tendencies of Development of the Technology «Blockchain» and Digital Currencies","authors":"R. Astrakhantsev, Alexey Los, R. Muhamadieva","doi":"10.21681/2311-3456-2019-5-57-62","DOIUrl":"https://doi.org/10.21681/2311-3456-2019-5-57-62","url":null,"abstract":"","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126615167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2023-2-23-35
N. Sidnyaev, E. Sineva
The purpose of the research is to develop the concept of systematization of the knowledge base and solving problems of information cybersecurity of systems and when making search decisions based on the construction of a structured semantic content model of terms of a scientific and theoretical nature describing complex active systems. Research methods: statistical analysis, hypothesis testing methods, machine learning methods, reliability models, evaluation type models used in testing reliability indicators, parameters of behavioral systems. The result obtained: The result obtained: experimental results of the application of reliability evaluation models and consent criteria to different sizes of knowledge bases are discussed and the evaluation of the results of measuring the reliability index on these components, taking into account the failure rate, is given. The description of generalized algorithms for the functioning of evaluation and forecasting components, as well as their applicability to solving problems in the field of information security, is given. A general model of a spatial network is proposed, within the framework of which the subject carries out risk management by effectively, in one sense or another, distributing the homogeneous resource at his disposal between its nodes. For the implementation of decision-making, more optimistic criteria than the minimax criterion are recommended. Scientific novelty: consists in the development of mathematical models to maintain the logical and physical integrity of the knowledge bases of cybersystems using the desirability function and consent criteria. The basic requirements for ensuring reliable behavior and operability of an information system using oriented databases are highlighted and described. It is postulated that the best information system reliability is achieved through the use of automated monitoring systems using knowledge bases for continuous monitoring and periodic analysis of cybersystem objects with tracking the dynamics of changes in the event space.
{"title":"CONSTRUCTION OF COMPOSITE CRITERIA FOR OPTIMIZATION OF TERMS AND GENERALIZED INDICATOR OF KNOWLEDGE BASES OF INTELLIGENT SYSTEMS","authors":"N. Sidnyaev, E. Sineva","doi":"10.21681/2311-3456-2023-2-23-35","DOIUrl":"https://doi.org/10.21681/2311-3456-2023-2-23-35","url":null,"abstract":"The purpose of the research is to develop the concept of systematization of the knowledge base and solving problems of information cybersecurity of systems and when making search decisions based on the construction of a structured semantic content model of terms of a scientific and theoretical nature describing complex active systems. Research methods: statistical analysis, hypothesis testing methods, machine learning methods, reliability models, evaluation type models used in testing reliability indicators, parameters of behavioral systems. The result obtained: The result obtained: experimental results of the application of reliability evaluation models and consent criteria to different sizes of knowledge bases are discussed and the evaluation of the results of measuring the reliability index on these components, taking into account the failure rate, is given. The description of generalized algorithms for the functioning of evaluation and forecasting components, as well as their applicability to solving problems in the field of information security, is given. A general model of a spatial network is proposed, within the framework of which the subject carries out risk management by effectively, in one sense or another, distributing the homogeneous resource at his disposal between its nodes. For the implementation of decision-making, more optimistic criteria than the minimax criterion are recommended. Scientific novelty: consists in the development of mathematical models to maintain the logical and physical integrity of the knowledge bases of cybersystems using the desirability function and consent criteria. The basic requirements for ensuring reliable behavior and operability of an information system using oriented databases are highlighted and described. It is postulated that the best information system reliability is achieved through the use of automated monitoring systems using knowledge bases for continuous monitoring and periodic analysis of cybersystem objects with tracking the dynamics of changes in the event space.","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129009160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2022-2-52-62
Sabina Volkov, E. Gordeev
Purpose of the study: development of a distributed routing algorithm to ensure security in wireless self-organizing networks from intruder attacks on the network. Methods: application of algorithms, graph theory, discrete optimization and heuristic approaches based on the results of numerical experiments. Results: the paper proposes a modified distributed routing algorithm for self-organizing networks. The algorithm, presented in this paper, is based on a distributed version of Dijkstra’s algorithm, designed to detect the shortest paths without loops on a graph under conditions of changing the weight of its edges. The loop freedom in this case is achieved by storing at each node an additional table containing the penultimate nodes on the shortest routes to all nodes, which allows the node to build a tree of shortest routes with itself as a root. In the modification of the algorithm, these tables are used by the nodes to check the correspondence of the declared route and the return route, which makes it possible to recognize and exclude from the network an intruder who carries out attacks to disrupt the correct routing mechanism. The effectiveness of the proposed algorithm for protection against routing attacks, in particular, black hole attacks, is confirmed by the results of testing on a program model.
{"title":"Providing Safe Routing in Wireless Self-Organizing Networks","authors":"Sabina Volkov, E. Gordeev","doi":"10.21681/2311-3456-2022-2-52-62","DOIUrl":"https://doi.org/10.21681/2311-3456-2022-2-52-62","url":null,"abstract":"Purpose of the study: development of a distributed routing algorithm to ensure security in wireless self-organizing networks from intruder attacks on the network. Methods: application of algorithms, graph theory, discrete optimization and heuristic approaches based on the results of numerical experiments. Results: the paper proposes a modified distributed routing algorithm for self-organizing networks. The algorithm, presented in this paper, is based on a distributed version of Dijkstra’s algorithm, designed to detect the shortest paths without loops on a graph under conditions of changing the weight of its edges. The loop freedom in this case is achieved by storing at each node an additional table containing the penultimate nodes on the shortest routes to all nodes, which allows the node to build a tree of shortest routes with itself as a root. In the modification of the algorithm, these tables are used by the nodes to check the correspondence of the declared route and the return route, which makes it possible to recognize and exclude from the network an intruder who carries out attacks to disrupt the correct routing mechanism. The effectiveness of the proposed algorithm for protection against routing attacks, in particular, black hole attacks, is confirmed by the results of testing on a program model.","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133835602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2019-4-94-104
G. Gradoselskaya, T. Scheglova, Ilya Karpov
{"title":"Mapping of Politically Active Groups on Facebook: Dynamics of 2013-2018","authors":"G. Gradoselskaya, T. Scheglova, Ilya Karpov","doi":"10.21681/2311-3456-2019-4-94-104","DOIUrl":"https://doi.org/10.21681/2311-3456-2019-4-94-104","url":null,"abstract":"","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116758466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.21681/2311-3456-2019-6-02-03
Yu. E. Kuznecov
{"title":"Krasnodar Higher Military University of Name General of Army S.M. Shtemenko - 90 Years!","authors":"Yu. E. Kuznecov","doi":"10.21681/2311-3456-2019-6-02-03","DOIUrl":"https://doi.org/10.21681/2311-3456-2019-6-02-03","url":null,"abstract":"","PeriodicalId":422818,"journal":{"name":"Voprosy kiberbezopasnosti","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131060313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：