Pub Date : 2023-11-06DOI: 10.20535/tacs.2664-29132023.2.278891
Alina Yanko, Dmytro Kovalchuk
It is known that the use of a non-positional number system in residual classes (SRC) in computer systems (CS) can significantly increase the speed of the implementation of integer arithmetic operations. The use of such properties of a non-positional number system in the SRC as independence, equality and low-bitness (low-digit capacity) of the residues that define the non-positional code data structure of the SRC provides high user performance for the implementation in the CS of computational algorithms consisting of a set of arithmetic (modular) operations. The greatest efficiency from the use of the SRC is achieved when the implemented algorithms consist of a set of arithmetic operations such as addition, multiplication and subtraction. There is a large class of algorithms and tasks (tasks of implementing cryptoalgorithms, optimization tasks, computational tasks of large dimension, etc.), where, in addition to performing integer arithmetic operations of addition, subtraction, multiplication, raising integers modulo and others in a positive numerical range, there is a need to implement the listed above arithmetic and other operations, in the negative numerical range. The need to perform these operations in a negative numerical range significantly reduces the overall efficiency of using the SRC as a number system of the CS. In this aspect, the lack of a mathematical model for the process of raising integers in the SRC in the negative numerical region makes it difficult to develop methods and procedures for raising integers to an arbitrary power of a natural number in the SRC, both in positive and negative numerical ranges. The purpose of the article is the synthesis of a mathematical model of the process of raising integers to an arbitrary power of a natural number in the SRC, both in positive and negative numerical ranges.
{"title":"Mathematical Model of the Process of Raising Integers to an Arbitrary Power of a Natural Number in the System of Residual Classes","authors":"Alina Yanko, Dmytro Kovalchuk","doi":"10.20535/tacs.2664-29132023.2.278891","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.278891","url":null,"abstract":"It is known that the use of a non-positional number system in residual classes (SRC) in computer systems (CS) can significantly increase the speed of the implementation of integer arithmetic operations. The use of such properties of a non-positional number system in the SRC as independence, equality and low-bitness (low-digit capacity) of the residues that define the non-positional code data structure of the SRC provides high user performance for the implementation in the CS of computational algorithms consisting of a set of arithmetic (modular) operations. The greatest efficiency from the use of the SRC is achieved when the implemented algorithms consist of a set of arithmetic operations such as addition, multiplication and subtraction. There is a large class of algorithms and tasks (tasks of implementing cryptoalgorithms, optimization tasks, computational tasks of large dimension, etc.), where, in addition to performing integer arithmetic operations of addition, subtraction, multiplication, raising integers modulo and others in a positive numerical range, there is a need to implement the listed above arithmetic and other operations, in the negative numerical range. The need to perform these operations in a negative numerical range significantly reduces the overall efficiency of using the SRC as a number system of the CS. In this aspect, the lack of a mathematical model for the process of raising integers in the SRC in the negative numerical region makes it difficult to develop methods and procedures for raising integers to an arbitrary power of a natural number in the SRC, both in positive and negative numerical ranges. The purpose of the article is the synthesis of a mathematical model of the process of raising integers to an arbitrary power of a natural number in the SRC, both in positive and negative numerical ranges.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724226","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}
This article is a part of a research endeavor focused on creating a quantum-resistant cryptosystem for secure encryption and decryption. Our approach employs a challenging word problem while emphasizing cost-effective implementation. Previous research has involved the development of encryption schemes based on high-order groups, offering potential security enhancements. The choice of the non-abelian group is a critical factor in shaping the encryption algorithms, feasibility of implementation, and system parameters. Our central objective is to design a cryptosystem that effectively thwarts quantum cryptanalysis. To achieve this, we employ a logarithmic signature along with a random cover across an entire finite non-abelian group. Our unique contribution lies in optimizing finite group selection, parameters, and circuit solutions for the logarithmic signature to meet specific security and implementation criteria. Within this paper, we introduce an encryption scheme utilizing automorphisms of the Ree functional field and propose a method for enhancing resistance to cryptanalysis through the binding of session keys.
{"title":"Method of Security Improvement for MST3 Cryptosystem Based on Automorphism Group of Ree Function Field","authors":"Yevgen Kotukh, Gennady Khalimov, Maxim Korobchinskiy","doi":"10.20535/tacs.2664-29132023.2.290414","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.290414","url":null,"abstract":"
 
 
 This article is a part of a research endeavor focused on creating a quantum-resistant cryptosystem for secure encryption and decryption. Our approach employs a challenging word problem while emphasizing cost-effective implementation. Previous research has involved the development of encryption schemes based on high-order groups, offering potential security enhancements. The choice of the non-abelian group is a critical factor in shaping the encryption algorithms, feasibility of implementation, and system parameters. Our central objective is to design a cryptosystem that effectively thwarts quantum cryptanalysis. To achieve this, we employ a logarithmic signature along with a random cover across an entire finite non-abelian group. Our unique contribution lies in optimizing finite group selection, parameters, and circuit solutions for the logarithmic signature to meet specific security and implementation criteria. Within this paper, we introduce an encryption scheme utilizing automorphisms of the Ree functional field and propose a method for enhancing resistance to cryptanalysis through the binding of session keys.
 
 
","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724227","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 : 2023-11-06DOI: 10.20535/tacs.2664-29132023.2.288499
Andrii Fesenko, Yuliia Lytvynenko
The CRYSTALS-Dilithium digital signature algorithm, which was selected as the prototype of the new «Vershyna» digital signature algorithm, is analyzed in this paper. The characteristics of the National Digital Signature Standard Project and the construction of the «Vershyna» algorithm are also presented. During the analysis of the project, the predicted number of iterations that the algorithm must perform to create the correct signature was calculated. In addition, basic theoretical information about the structure of Fiat-Shamir with aborts and its security in quantum and classical models oracle models is also provided. We obtain our own results on the resistance of the «Vershyna» algorithm to the attack without the use of a message in classical and quantum oracle models. The resistance of the «Vershyna» algorithm to a key recovery attack is based on the assumption of the hardness of the MLWE~problem, and the resistance to existential signature forgery is based on the assumption of the hardness of the MSIS~problem. In this work, the expected level of hardness of SIS~and LWE~problems is calculated, to which there are reductions from MSIS~and MLWE~problems.
{"title":"Cryptanalysis of the «Vershyna» digital signature algorithm","authors":"Andrii Fesenko, Yuliia Lytvynenko","doi":"10.20535/tacs.2664-29132023.2.288499","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.288499","url":null,"abstract":"The CRYSTALS-Dilithium digital signature algorithm, which was selected as the prototype of the new «Vershyna» digital signature algorithm, is analyzed in this paper. The characteristics of the National Digital Signature Standard Project and the construction of the «Vershyna» algorithm are also presented. During the analysis of the project, the predicted number of iterations that the algorithm must perform to create the correct signature was calculated. In addition, basic theoretical information about the structure of Fiat-Shamir with aborts and its security in quantum and classical models oracle models is also provided. We obtain our own results on the resistance of the «Vershyna» algorithm to the attack without the use of a message in classical and quantum oracle models. The resistance of the «Vershyna» algorithm to a key recovery attack is based on the assumption of the hardness of the MLWE~problem, and the resistance to existential signature forgery is based on the assumption of the hardness of the MSIS~problem. In this work, the expected level of hardness of SIS~and LWE~problems is calculated, to which there are reductions from MSIS~and MLWE~problems.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724218","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 : 2023-11-06DOI: 10.20535/tacs.2664-29132023.2.287139
Dmytro Lande, Anatolii Feher, Leonard Strashnoy
The paper describes a methodology for forming thematic causal networks using artificial intelligence and automating the processes of their visualization. The presented methodology is considered on the example of ChatGPT, as an artificial intelligence for analyzing the space of texts and building concepts of causal relationships, and their further visualization is demonstrated on the example of Gephi and CSV2Graph programs. The effectiveness of the disaggregated method in relation to traditional methods for solving such problems is shown by integrating the means of intelligent text analytics and graphical network analysis on the example of the problem of data leakage in information systems and a selection of news clippings on the selected topic.
{"title":"Cybersecurity in AI-Driven Casual Network Formation","authors":"Dmytro Lande, Anatolii Feher, Leonard Strashnoy","doi":"10.20535/tacs.2664-29132023.2.287139","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.287139","url":null,"abstract":"The paper describes a methodology for forming thematic causal networks using artificial intelligence and automating the processes of their visualization. The presented methodology is considered on the example of ChatGPT, as an artificial intelligence for analyzing the space of texts and building concepts of causal relationships, and their further visualization is demonstrated on the example of Gephi and CSV2Graph programs. The effectiveness of the disaggregated method in relation to traditional methods for solving such problems is shown by integrating the means of intelligent text analytics and graphical network analysis on the example of the problem of data leakage in information systems and a selection of news clippings on the selected topic.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724224","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 : 2023-11-06DOI: 10.20535/tacs.2664-29132023.2.285431
Viktoriia Igorivna Polutsyhanova
Today, vulnerability analysis is of great importance in assessing system security. This approach is especially important in cyber systems. The complex relationship between vulnerabilities is dictated by the threats that potentially arise from their presence. The work provides a methodology and an example of building, analyzing and classifying vulnerabilities depending on the threats that they generate. This approach will allow a better understanding of the connections between vulnerabilities, as well as the degree of impact of each of them.
{"title":"Vulnerability classification using Q-analysis","authors":"Viktoriia Igorivna Polutsyhanova","doi":"10.20535/tacs.2664-29132023.2.285431","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.285431","url":null,"abstract":"Today, vulnerability analysis is of great importance in assessing system security. This approach is especially important in cyber systems. The complex relationship between vulnerabilities is dictated by the threats that potentially arise from their presence. The work provides a methodology and an example of building, analyzing and classifying vulnerabilities depending on the threats that they generate. This approach will allow a better understanding of the connections between vulnerabilities, as well as the degree of impact of each of them.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724221","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 : 2023-11-06DOI: 10.20535/tacs.2664-29132023.2.277621
Pavlo Hrynchenko
Signal processing techniques are used to analyze and detect network anomalies because of their ability to detect new and unknown intrusions. The paper proposes a method of modeling network signals for the detection of network anomalies, which combines wavelet approximation and the theory of system identification. To characterize the behavior of network traffic, fifteen functions are provided, which are used as input signals within the system. At the same time, it is assumed that security violations within the network can be detected by checking abnormal patterns of system functioning according to audit data.
Despite the fact that machine learning methods have achieved significant results in detecting network anomalies, they still face the difficulty of using the implemented algorithms, in the presence of differences in the behavior of the training data and test data, which in turn leads to inefficient performance of the algorithms. This effect is exacerbated by the limitation of algorithms to detect previously unknown types of attacks due to the large number of false positives.
The paper develops a new method of modeling network signals for detecting anomalies in networks using wavelet analysis. In particular, the general architecture of the approach consists of three components: feature analysis, modeling of normal network traffic based on wavelet approximation and prediction using ARX model, intrusion or non-intrusion decision making
The result is evaluated using the DARPA intrusion detection dataset, which performs a comprehensive analysis of the intrusions in the dataset. Evaluation results show that this approach provides a high level of detection of both instances and types of attacks.
{"title":"Detection of Unauthorized Actions in Networks Using Wavelet Analysis","authors":"Pavlo Hrynchenko","doi":"10.20535/tacs.2664-29132023.2.277621","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.277621","url":null,"abstract":"Signal processing techniques are used to analyze and detect network anomalies because of their ability to detect new and unknown intrusions. The paper proposes a method of modeling network signals for the detection of network anomalies, which combines wavelet approximation and the theory of system identification. To characterize the behavior of network traffic, fifteen functions are provided, which are used as input signals within the system. At the same time, it is assumed that security violations within the network can be detected by checking abnormal patterns of system functioning according to audit data.
 Despite the fact that machine learning methods have achieved significant results in detecting network anomalies, they still face the difficulty of using the implemented algorithms, in the presence of differences in the behavior of the training data and test data, which in turn leads to inefficient performance of the algorithms. This effect is exacerbated by the limitation of algorithms to detect previously unknown types of attacks due to the large number of false positives.
 The paper develops a new method of modeling network signals for detecting anomalies in networks using wavelet analysis. In particular, the general architecture of the approach consists of three components: feature analysis, modeling of normal network traffic based on wavelet approximation and prediction using ARX model, intrusion or non-intrusion decision making
 The result is evaluated using the DARPA intrusion detection dataset, which performs a comprehensive analysis of the intrusions in the dataset. Evaluation results show that this approach provides a high level of detection of both instances and types of attacks.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724304","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 : 2023-11-06DOI: 10.20535/tacs.2664-29132023.2.278199
Andrii Shyshatskyi, Tetiana Stasiuk, Oleh Kuzmenko
Active digitization of people's daily life leads to the use of the decision making support systems (DMSS). DMSS is actively used in data processing, forecasting the course of various processes, providing informational support for the decision making process by decision makers. However, a number of problems arise while evaluating monitoring objects, namely: a large number of destabilizing factors affecting the efficiency of the processes of information collection, processing and transmission; high dynamism of changes in the state and composition of heterogeneous monitoring objects during the conduct of hostilities (operations); high dynamism of conducting hostilities (operations); the uncertainty of the initial situation and the noise of the initial data. In this article, a method of finding solutions based on an improved bee colony algorithm was developed. The efficiency of information processing is achieved by learning the architecture of artificial neural networks; taking into account the type of uncertainty of the information to be evaluated; the use of an improved algorithm of the bee colony, the use of an unordered linguistic scale of measurements with adjustment coefficients for the degree of awareness and the degree of noise of the initial data. An approbation of the use of the proposed method was carried out on the example of assessing the state of the operational grouping of troops (forces). The method is proposed to be used in the development of software for automated systems of control of troops and weapons, namely, in the modernization of existing and development of new automated systems of control of troops and weapons. The evaluation of the effectiveness of the proposed method showed an increase in the efficiency of the evaluation at the level of 21–28% in terms of the efficiency of information processing.
{"title":"The Development of the Solution Search Method Based on the Improved Bee Colony Algorithm","authors":"Andrii Shyshatskyi, Tetiana Stasiuk, Oleh Kuzmenko","doi":"10.20535/tacs.2664-29132023.2.278199","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.278199","url":null,"abstract":"Active digitization of people's daily life leads to the use of the decision making support systems (DMSS). DMSS is actively used in data processing, forecasting the course of various processes, providing informational support for the decision making process by decision makers. However, a number of problems arise while evaluating monitoring objects, namely: a large number of destabilizing factors affecting the efficiency of the processes of information collection, processing and transmission; high dynamism of changes in the state and composition of heterogeneous monitoring objects during the conduct of hostilities (operations); high dynamism of conducting hostilities (operations); the uncertainty of the initial situation and the noise of the initial data. In this article, a method of finding solutions based on an improved bee colony algorithm was developed. The efficiency of information processing is achieved by learning the architecture of artificial neural networks; taking into account the type of uncertainty of the information to be evaluated; the use of an improved algorithm of the bee colony, the use of an unordered linguistic scale of measurements with adjustment coefficients for the degree of awareness and the degree of noise of the initial data. An approbation of the use of the proposed method was carried out on the example of assessing the state of the operational grouping of troops (forces). The method is proposed to be used in the development of software for automated systems of control of troops and weapons, namely, in the modernization of existing and development of new automated systems of control of troops and weapons. The evaluation of the effectiveness of the proposed method showed an increase in the efficiency of the evaluation at the level of 21–28% in terms of the efficiency of information processing.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724219","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}
Abstract
The task of analyzing and selecting the best scenario of a cyberattack on information and communication system is considered as a component of the task of analyzing systems security. A method and corresponding algorithm for finding the best scenario of an attack on information and communication system using a logical and probabilistic model is proposed. The model describes the development of adverse events that arise in the information and communication system from the implementation of possible attacks on the security system from cyberspace. Analysis of cyber attack scenarios allows predicting the development of possible adverse cyber security events from the implementation of multiple threats to the system. The developed method and corresponding algorithm for analyzing attack scenarios can be used to analyze the security of information and communication systems, as well as in automation systems for designing information security systems or designing attacks on such systems.
{"title":"The Best Scenario of Cyber Attack Selecting on the Information and Communication System Based on the Logical and Probabilistic Method","authors":"Lesia Alekseichuk, Oleksii Novikov, Andrii Rodionov, Dmytro Yakobchuk","doi":"10.20535/tacs.2664-29132023.2.288973","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.288973","url":null,"abstract":"Abstract
 The task of analyzing and selecting the best scenario of a cyberattack on information and communication system is considered as a component of the task of analyzing systems security. A method and corresponding algorithm for finding the best scenario of an attack on information and communication system using a logical and probabilistic model is proposed. The model describes the development of adverse events that arise in the information and communication system from the implementation of possible attacks on the security system from cyberspace. Analysis of cyber attack scenarios allows predicting the development of possible adverse cyber security events from the implementation of multiple threats to the system. The developed method and corresponding algorithm for analyzing attack scenarios can be used to analyze the security of information and communication systems, as well as in automation systems for designing information security systems or designing attacks on such systems.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724223","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 : 2023-11-06DOI: 10.20535/tacs.2664-29132023.2.290413
Vasyl Ustymenko
Non-commutative cryptography studies cryptographic primitives and systems which are based on algebraic structures like groups, semigroups and noncommutative rings. We continue to investigate inverse protocols of Non-commutative cryptography defined in terms of subsemigroups of Affine Cremona Semigroups over finite fields or arithmetic rings Zm and homomorphic images of these semigroups as possible instruments of Post Quantum Cryptography. This approach allows to construct cryptosystem which are not public keys, when protocol finish correspondents have mutually inverse transformations on affine space Kn or variety (K*)n where K is the field or arithmetic ring.
The security of such inverse protocol rests on the complexity of word problem to decompose element of Affine Cremona Semigroup given in its standard form into composition of given generators. We discuss the idea of usage combinations of two cryptosystems with cipherspaces(K*)n and Kn to form a new cryptosystem with the plainspace(K*)n, ciphertextKn and nonbijective highly nonlinear encryption map.
{"title":"On Inverse Protocols of Post Quantum Cryptography Based on Pairs of Noncommutative Multivariate Platforms Used in Tandem","authors":"Vasyl Ustymenko","doi":"10.20535/tacs.2664-29132023.2.290413","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.290413","url":null,"abstract":"
 
 
 Non-commutative cryptography studies cryptographic primitives and systems which are based on algebraic structures like groups, semigroups and noncommutative rings. We continue to investigate inverse protocols of Non-commutative cryptography defined in terms of subsemigroups of Affine Cremona Semigroups over finite fields or arithmetic rings Zm and homomorphic images of these semigroups as possible instruments of Post Quantum Cryptography. This approach allows to construct cryptosystem which are not public keys, when protocol finish correspondents have mutually inverse transformations on affine space Kn or variety (K*)n where K is the field or arithmetic ring.
 The security of such inverse protocol rests on the complexity of word problem to decompose element of Affine Cremona Semigroup given in its standard form into composition of given generators. We discuss the idea of usage combinations of two cryptosystems with cipherspaces(K*)n and Kn to form a new cryptosystem with the plainspace(K*)n, ciphertextKn and nonbijective highly nonlinear encryption map.
 
 
","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724225","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 : 2023-11-06DOI: 10.20535/tacs.2664-29132023.2.289459
Mykola Ovcharuk
Mathematical models of denial-of-service attacks are investigated in the paper. Threats of kinetic impact on systems in cyberspace are considered. Targeted computer systems and systems with low and high-security levels were studied. The simulation results demonstrate a successful resolution of the task.
{"title":"Models of Denial of Service Attacks on Cyber-Physical Systems","authors":"Mykola Ovcharuk","doi":"10.20535/tacs.2664-29132023.2.289459","DOIUrl":"https://doi.org/10.20535/tacs.2664-29132023.2.289459","url":null,"abstract":"Mathematical models of denial-of-service attacks are investigated in the paper. Threats of kinetic impact on systems in cyberspace are considered. Targeted computer systems and systems with low and high-security levels were studied. The simulation results demonstrate a successful resolution of the task.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135724311","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
扫码关注我们
求助内容：
应助结果提醒方式：