Pub Date : 2022-06-24DOI: 10.30837/rt.2022.2.209.13
V.I. Yukhymenko, O. Fediushyn
Blockchain systems are always distributed but differ greatly in resolutions, sizes, roles, transparency, types of participants, and the way transactions are handled. The decentralized structure offers inalienable security benefits, but with a large number of participants faces the problem of limited scaling. Sharding is suggested to solve this problem. Sharding is a way to divide consensual workload and transactions into several nodes. Effective application of sharding requires a lot of detail and work in terms of architecture and system implementation. As was found in the process of the work, in order to achieve significant results in scaling the blockchain system through sharding, it is necessary that the blockchain project is based on several blockchains simultaneously (i.e. had a multi-blockchain architecture) and provides infrastructure for fast and reliable messaging between them (i.e. strongly interconnected). The Telegram Open Network (TON) and its component TON Blockchain are considered an example of such a project. This work provides a comparative analysis of the most popular blockchain platforms (Bitcoin and Ethereum) with the implementations of TON Blockchain ideas (The Open Network and Everscale) on three parameters: system bandwidth (measured at transactions per second, abbreviated TPS), the average time of a new block’s appearance in the network and projected bandwidth in TPS.
{"title":"Scaling analysis of the Telegram Open Network blockchain project","authors":"V.I. Yukhymenko, O. Fediushyn","doi":"10.30837/rt.2022.2.209.13","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.13","url":null,"abstract":"Blockchain systems are always distributed but differ greatly in resolutions, sizes, roles, transparency, types of participants, and the way transactions are handled. The decentralized structure offers inalienable security benefits, but with a large number of participants faces the problem of limited scaling. Sharding is suggested to solve this problem. Sharding is a way to divide consensual workload and transactions into several nodes. Effective application of sharding requires a lot of detail and work in terms of architecture and system implementation. As was found in the process of the work, in order to achieve significant results in scaling the blockchain system through sharding, it is necessary that the blockchain project is based on several blockchains simultaneously (i.e. had a multi-blockchain architecture) and provides infrastructure for fast and reliable messaging between them (i.e. strongly interconnected). The Telegram Open Network (TON) and its component TON Blockchain are considered an example of such a project. \u0000This work provides a comparative analysis of the most popular blockchain platforms (Bitcoin and Ethereum) with the implementations of TON Blockchain ideas (The Open Network and Everscale) on three parameters: system bandwidth (measured at transactions per second, abbreviated TPS), the average time of a new block’s appearance in the network and projected bandwidth in TPS.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89000752","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.11
V.O. Poddubnyi, R.Y. Gvozdov, Оleksand Sievierinov, V. Fedorchenko
The purpose of the article is to study algorithms for the formal description of information and communication systems. The article discusses the main provisions on the formal representation of objects of information and communication systems. It is noted that the main environments of the information and communication system that are subject to a formal description are: physical environment, computing system environment, user environment, information environment. These components of the information and communication system are considered in detail, analyzed and documented in an informal form (in the form of text). There is a need for a mechanism for a unified description of a system that includes all environments. Such a description will be unambiguously formalized with well-defined mathematical concepts. The mechanism of a single formal description or the technique of a formal description will be unambiguous in understanding and serve as a control description when developing an information security policy in an information and communication system. An algorithm for the formal description of the information and communication system is proposed. In this algorithm, it is proposed to focus on the types and interaction of objects with each other. In such a scheme, attention is focused on such concepts as the object, the characteristics of the object, and the type of interaction with the object. Further consideration of the created block diagrams (graphs) is proposed to explore the possibilities of using this model to simulate cyber-attacks. Since each element contains fields that connect it to other elements, and each attack has an "entry point" using graph theory, it is possible to traverse the graph to determine the possible horizontal propagation paths of a cyber-attack.
{"title":"Object-oriented model of a formal description of an information and communication system","authors":"V.O. Poddubnyi, R.Y. Gvozdov, Оleksand Sievierinov, V. Fedorchenko","doi":"10.30837/rt.2022.2.209.11","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.11","url":null,"abstract":"The purpose of the article is to study algorithms for the formal description of information and communication systems. The article discusses the main provisions on the formal representation of objects of information and communication systems. It is noted that the main environments of the information and communication system that are subject to a formal description are: physical environment, computing system environment, user environment, information environment. These components of the information and communication system are considered in detail, analyzed and documented in an informal form (in the form of text). There is a need for a mechanism for a unified description of a system that includes all environments. Such a description will be unambiguously formalized with well-defined mathematical concepts. The mechanism of a single formal description or the technique of a formal description will be unambiguous in understanding and serve as a control description when developing an information security policy in an information and communication system. An algorithm for the formal description of the information and communication system is proposed. In this algorithm, it is proposed to focus on the types and interaction of objects with each other. In such a scheme, attention is focused on such concepts as the object, the characteristics of the object, and the type of interaction with the object. Further consideration of the created block diagrams (graphs) is proposed to explore the possibilities of using this model to simulate cyber-attacks. Since each element contains fields that connect it to other elements, and each attack has an \"entry point\" using graph theory, it is possible to traverse the graph to determine the possible horizontal propagation paths of a cyber-attack.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87893419","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.05
D. Harmash
The essence and possibilities of protecting the Rainbow post-quantum cryptographic algorithm are considered. The main properties of algorithms based on multidimensional quadratic transformations are studied. An assessment is given of what resources and computational energy are needed for the successful use of algorithms based on multidimensional quadratic transformations. The ability to protect the algorithm against attacks by third-party channels is analyzed. It is studied how successfully a cryptographic algorithm based on Rainbow multivariate quadratic transformations can withstand RBS attacks. A detailed description of the steps used to build an attack on a cryptographic algorithm based on Rainbow multivariate quadratic transforms is given. A structural analysis of the Rainbow algorithm is performed. Detailed conclusions are made regarding the performed analyzes. An assessment of the stability and complexity of the cryptographic encryption algorithm and electronic signature based on multivariate quadratic transformations is given.
{"title":"RAINBOW algorithm and its ability to resist RBS attacks and third party channels","authors":"D. Harmash","doi":"10.30837/rt.2022.2.209.05","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.05","url":null,"abstract":"The essence and possibilities of protecting the Rainbow post-quantum cryptographic algorithm are considered. The main properties of algorithms based on multidimensional quadratic transformations are studied. An assessment is given of what resources and computational energy are needed for the successful use of algorithms based on multidimensional quadratic transformations. The ability to protect the algorithm against attacks by third-party channels is analyzed. It is studied how successfully a cryptographic algorithm based on Rainbow multivariate quadratic transformations can withstand RBS attacks. A detailed description of the steps used to build an attack on a cryptographic algorithm based on Rainbow multivariate quadratic transforms is given. A structural analysis of the Rainbow algorithm is performed. Detailed conclusions are made regarding the performed analyzes. An assessment of the stability and complexity of the cryptographic encryption algorithm and electronic signature based on multivariate quadratic transformations is given.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83032756","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.10
О.О. Kuznetsov, М.О. Poluyanenko, S. Kandiy, Y.O. Lohachova
Cryptographic protection in information and information and communication systems is an important component of cybersecurity. Therefore, the development, research and improvement of means of cryptographic information protection is an urgent and important task. In this paper, we study evolutionary methods for generating non-linear substitutions (S-boxes). These are cryptographic primitives that are an important component of many modern block and stream ciphers with a secret key. However, the problem of generating random highly non-linear substitutions is extremely difficult. In this paper, we study the annealing simulation method. This is an iterative algorithm, the essence of which is the gradual improvement of the current solution (substitution). Special cost functions are used as an improvement criterion. The initial state is formed randomly, and then, at each iteration the current solution is gradually changed. Approaching the target solution means minimizing the cost function. The paper investigates a simple and computationally efficient cost function based on the Walsh-Hadamard transform. Through exploratory research and numerous tests, it was possible to optimize the operation of the annealing simulation algorithm. Optimized algorithm for several parameters (initial temperature, "cooling factor", cost function) allows you to quickly generate highly non-linear bijective substitutions for cryptographic applications. Compared to other well-known implementations of the annealing simulation algorithm, the use of the recommended parameters can significantly reduce the generation time of nonlinear substitutions.
{"title":"Substantiation of the parameters of the annealing simulation algorithm for searching non-linear substitutions of symmetric ciphers","authors":"О.О. Kuznetsov, М.О. Poluyanenko, S. Kandiy, Y.O. Lohachova","doi":"10.30837/rt.2022.2.209.10","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.10","url":null,"abstract":"Cryptographic protection in information and information and communication systems is an important component of cybersecurity. Therefore, the development, research and improvement of means of cryptographic information protection is an urgent and important task. In this paper, we study evolutionary methods for generating non-linear substitutions (S-boxes). These are cryptographic primitives that are an important component of many modern block and stream ciphers with a secret key. However, the problem of generating random highly non-linear substitutions is extremely difficult. In this paper, we study the annealing simulation method. This is an iterative algorithm, the essence of which is the gradual improvement of the current solution (substitution). Special cost functions are used as an improvement criterion. The initial state is formed randomly, and then, at each iteration the current solution is gradually changed. Approaching the target solution means minimizing the cost function. The paper investigates a simple and computationally efficient cost function based on the Walsh-Hadamard transform. Through exploratory research and numerous tests, it was possible to optimize the operation of the annealing simulation algorithm. Optimized algorithm for several parameters (initial temperature, \"cooling factor\", cost function) allows you to quickly generate highly non-linear bijective substitutions for cryptographic applications. Compared to other well-known implementations of the annealing simulation algorithm, the use of the recommended parameters can significantly reduce the generation time of nonlinear substitutions.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84232644","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.08
O. Kachko, M. Yesina, K.O. Kuznetsova
At present and in the future, mathematical methods, mechanisms and algorithms of standardized asymmetric cryptotransformations such as electronic signature (ES) are and will be used for information cryptographic protection. Electronic signature is the main and essential component of cybersecurity, in terms of providing quality information security services such as integrity, irresistibility and authenticity of information and data being processed. However, there are well-founded suspicions that in the post-quantum period the existing ES standards will be broken and compromised using classical and quantum cryptanalytic systems with appropriate mathematical, software and hardware-software. An analysis was performed, which confirms that quantum computers have already been developed, manufactured and used. This work is devoted to the analysis of methods and algorithms for generating key data for Falcon-like algorithms of electronic signature. Some of the basic algorithms for Falcon-shaped algorithms of electronic signature are considered, namely the algorithm of key data generation and algorithm of random polynomials f, g generation, which satisfy the Gauss distribution. The Falcon algorithm itself is the finalist of the post-quantum electronic signature contest due to the satisfactory value of the public key and signature lengths, but the key data generation algorithm uses many methods and difficult to implement. The Falcon authors use this algorithm for polynomials n=512, 1024. To increase the sixth level of cryptostability, this algorithm can be expanded for n=2048. This work is devoted to study the Falcon algorithm, taking into account its expansion for n=512, 1024, 2048 in terms of generating key data. Also, the paper considers the results of justifying the choice of a mathematical apparatus for implementing a software package for generating a key pair of a cryptographic algorithm for an electronic signature in order to create reliable electronic signatures.
{"title":"Analysis of methods and algorithms for generating key data for FALCON-like electronic signature algorithms","authors":"O. Kachko, M. Yesina, K.O. Kuznetsova","doi":"10.30837/rt.2022.2.209.08","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.08","url":null,"abstract":"At present and in the future, mathematical methods, mechanisms and algorithms of standardized asymmetric cryptotransformations such as electronic signature (ES) are and will be used for information cryptographic protection. Electronic signature is the main and essential component of cybersecurity, in terms of providing quality information security services such as integrity, irresistibility and authenticity of information and data being processed. However, there are well-founded suspicions that in the post-quantum period the existing ES standards will be broken and compromised using classical and quantum cryptanalytic systems with appropriate mathematical, software and hardware-software. An analysis was performed, which confirms that quantum computers have already been developed, manufactured and used. This work is devoted to the analysis of methods and algorithms for generating key data for Falcon-like algorithms of electronic signature. Some of the basic algorithms for Falcon-shaped algorithms of electronic signature are considered, namely the algorithm of key data generation and algorithm of random polynomials f, g generation, which satisfy the Gauss distribution. The Falcon algorithm itself is the finalist of the post-quantum electronic signature contest due to the satisfactory value of the public key and signature lengths, but the key data generation algorithm uses many methods and difficult to implement. The Falcon authors use this algorithm for polynomials n=512, 1024. To increase the sixth level of cryptostability, this algorithm can be expanded for n=2048. This work is devoted to study the Falcon algorithm, taking into account its expansion for n=512, 1024, 2048 in terms of generating key data. Also, the paper considers the results of justifying the choice of a mathematical apparatus for implementing a software package for generating a key pair of a cryptographic algorithm for an electronic signature in order to create reliable electronic signatures.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81612983","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.07
О.О. Kuznetsov, М.О. Poluyanenko, S. Kandiy, O. Peliukh
Cryptographic transformations with a secret key play an essential role in providing information and cyber security. Block and stream symmetric ciphers are used in various applications both as a separate cryptographic protection mechanism and as part of other applications (pseudo-random sequence generators, hashing algorithms, electronic signature protocols, etc.). Therefore, the design and study of individual components of symmetric ciphers is a relevant and important scientific task. In this paper we consider and investigates iterative algorithms for generating non-linear substitutions (substitutions, S-boxes), which are used in modern block and stream encryption algorithms with a symmetric key. Cryptographic resistance of symmetric ciphers to statistical, differential, linear and other methods of cryptanalysis is provided by the properties of substitutions. In addition, S-boxes must be random from the point of view of the possibility to use algebraic cryptanalysis. Therefore, the task of quickly generating random S-boxes with the desired cryptographic properties is an urgent, but extremely difficult task. For example, the best known generation algorithm requires more than 65 thousand iterations to find a random bijective 8-bit substitution with a non-linearity of 104. In this paper, we study an iterative algorithm for generating substitutions for hill climbing with different cost functions and propose a new cost function, the use of which can significantly reduce the number of search iterations. In particular, the search for a bijective S-box with nonlinearity 104 requires less than 50 thousand iterations.
{"title":"Study of a new cost function for generating random substitutions of symmetric ciphers","authors":"О.О. Kuznetsov, М.О. Poluyanenko, S. Kandiy, O. Peliukh","doi":"10.30837/rt.2022.2.209.07","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.07","url":null,"abstract":"Cryptographic transformations with a secret key play an essential role in providing information and cyber security. Block and stream symmetric ciphers are used in various applications both as a separate cryptographic protection mechanism and as part of other applications (pseudo-random sequence generators, hashing algorithms, electronic signature protocols, etc.). Therefore, the design and study of individual components of symmetric ciphers is a relevant and important scientific task. In this paper we consider and investigates iterative algorithms for generating non-linear substitutions (substitutions, S-boxes), which are used in modern block and stream encryption algorithms with a symmetric key. Cryptographic resistance of symmetric ciphers to statistical, differential, linear and other methods of cryptanalysis is provided by the properties of substitutions. In addition, S-boxes must be random from the point of view of the possibility to use algebraic cryptanalysis. Therefore, the task of quickly generating random S-boxes with the desired cryptographic properties is an urgent, but extremely difficult task. For example, the best known generation algorithm requires more than 65 thousand iterations to find a random bijective 8-bit substitution with a non-linearity of 104. In this paper, we study an iterative algorithm for generating substitutions for hill climbing with different cost functions and propose a new cost function, the use of which can significantly reduce the number of search iterations. In particular, the search for a bijective S-box with nonlinearity 104 requires less than 50 thousand iterations.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77755935","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.24
V. Tikhonov, V. Kartashov, O.V. Kartashov
The possibilities of an improved autoregression model and an integrated moving average (ARMAS) for the analysis of non-stationary data and the identification of long-term trends in the processes under study are considered. The proposed model can be used to study the observed processes in various areas of human activity: the analysis of the observed trajectories of the movement of aircraft, in particular unmanned aerial vehicles, meteorological processes that reflect the state of the atmosphere. The mathematical apparatus developed in the article was used to analyze changes in the atmospheric temperature time series observed for a long time, the average annual temperatures were estimated, followed by sliding smoothing with a low-frequency filter. It is shown that the removal of the seasonal component in the ARPSS model eliminates or distorts significantly the trend and has little effect on the stationary component of the ARPSS process. The operation of de-trending has little effect on the properties of the seasonal component and the stationary component of the process. To assess the trend, the mean annual temperatures were preliminarily obtained. The use of moving averaging, which removes the seasonal component from the average monthly temperatures, makes it possible to find a weak long-term trend. The results obtained in the work can be used to analyze medium-term and long-term changes in atmospheric phenomena, to refine the results obtained by traditional methods of processing results and methods of mathematical statistics, as well as in other areas of human activity.
{"title":"Model for estimating statistical characteristics of the pre-stroke warehouse process based on average monthly temperatures analysis","authors":"V. Tikhonov, V. Kartashov, O.V. Kartashov","doi":"10.30837/rt.2022.2.209.24","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.24","url":null,"abstract":"The possibilities of an improved autoregression model and an integrated moving average (ARMAS) for the analysis of non-stationary data and the identification of long-term trends in the processes under study are considered. The proposed model can be used to study the observed processes in various areas of human activity: the analysis of the observed trajectories of the movement of aircraft, in particular unmanned aerial vehicles, meteorological processes that reflect the state of the atmosphere. The mathematical apparatus developed in the article was used to analyze changes in the atmospheric temperature time series observed for a long time, the average annual temperatures were estimated, followed by sliding smoothing with a low-frequency filter. \u0000It is shown that the removal of the seasonal component in the ARPSS model eliminates or distorts significantly the trend and has little effect on the stationary component of the ARPSS process. The operation of de-trending has little effect on the properties of the seasonal component and the stationary component of the process. To assess the trend, the mean annual temperatures were preliminarily obtained. The use of moving averaging, which removes the seasonal component from the average monthly temperatures, makes it possible to find a weak long-term trend. The results obtained in the work can be used to analyze medium-term and long-term changes in atmospheric phenomena, to refine the results obtained by traditional methods of processing results and methods of mathematical statistics, as well as in other areas of human activity.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75701347","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.21
I. Razumov-Fryziuk, D. Gurin, D.O. Nikitin, R. Strilets, D. Blyzniuk
The article presents the development and modeling of a screw extruder for 3D printers operating on the FFF technology, namely, the Fused Filament Fabrication (“production by fusing threads”). Extruders, usually installed on FFF 3D printers, use a thermoplastic polymer filament as a material. There are two filament standards: 1.75mm and 2.85mm. The minimum cost of such a filament starts from $ 11 per kilogram (ABS plastic 1.75 mm). The cost of more expensive filaments can reach several thousand or even tens of thousands per kilogram (depending on the material, filler, the presence of inhibitors, dyes, etc.). The cost of the material is much higher than granulated primary plastics and even more so recycled materials. In addition, the extruder nozzle diameter is typically limited to 1.2mm for 1.75mm filament. Thus, when printing large products, for which the detail and roughness of vertical surfaces are not so important, increase in the diameter of the extruder nozzle will increase significantly the printing speed due to the increase in the thickness of the print layer and the width of the print line. To produce filament, screw filament extruders are used, which work on the principle of injection molding machines. The authors propose a calculation of the parameters of a screw extruder for an FFF 3D printer, which will directly use granulated primary plastics or crushed plastic recyclables as a material. The use of a screw extruder will reduce the cost of the printed product and increase significantly the diameter of the extruder nozzle, which will significantly reduce the production time for large-sized products. When designing a screw extruder, it is necessary to adhere to two main strategies: minimizing the weight and size parameters of the extruder and ensuring the required linear productivity. On the one hand, the extruder must be as light as possible to be able to increase the printing speed, on the other hand, it must provide the necessary linear performance to be able to extrude plastic at printing speeds. Modeling is made for nozzles with a diameter of 1mm and 5mm. According to the calculation results, the screw extruder has a 3-fold and 37-fold margin of linear productivity, respectively.
{"title":"Modeling a screw extruder for FFF 3D printing","authors":"I. Razumov-Fryziuk, D. Gurin, D.O. Nikitin, R. Strilets, D. Blyzniuk","doi":"10.30837/rt.2022.2.209.21","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.21","url":null,"abstract":"The article presents the development and modeling of a screw extruder for 3D printers operating on the FFF technology, namely, the Fused Filament Fabrication (“production by fusing threads”). Extruders, usually installed on FFF 3D printers, use a thermoplastic polymer filament as a material. There are two filament standards: 1.75mm and 2.85mm. The minimum cost of such a filament starts from $ 11 per kilogram (ABS plastic 1.75 mm). The cost of more expensive filaments can reach several thousand or even tens of thousands per kilogram (depending on the material, filler, the presence of inhibitors, dyes, etc.). The cost of the material is much higher than granulated primary plastics and even more so recycled materials. In addition, the extruder nozzle diameter is typically limited to 1.2mm for 1.75mm filament. Thus, when printing large products, for which the detail and roughness of vertical surfaces are not so important, increase in the diameter of the extruder nozzle will increase significantly the printing speed due to the increase in the thickness of the print layer and the width of the print line. \u0000To produce filament, screw filament extruders are used, which work on the principle of injection molding machines. The authors propose a calculation of the parameters of a screw extruder for an FFF 3D printer, which will directly use granulated primary plastics or crushed plastic recyclables as a material. The use of a screw extruder will reduce the cost of the printed product and increase significantly the diameter of the extruder nozzle, which will significantly reduce the production time for large-sized products. \u0000When designing a screw extruder, it is necessary to adhere to two main strategies: minimizing the weight and size parameters of the extruder and ensuring the required linear productivity. On the one hand, the extruder must be as light as possible to be able to increase the printing speed, on the other hand, it must provide the necessary linear performance to be able to extrude plastic at printing speeds. Modeling is made for nozzles with a diameter of 1mm and 5mm. According to the calculation results, the screw extruder has a 3-fold and 37-fold margin of linear productivity, respectively.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81438772","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.09
Ye.Yu. Kaptiol
The paper identifies and analyzes attacks aimed at cryptanalysis of the Rainbow post-quantum electronic signature algorithm and the state of this electronic signature within the framework of the NIST PQC competition and as a whole. The Rainbow electronic signature as a candidate in the third round of the NIST PQC was examined in detail for the possibility of cryptanalysis. The possibility to use this quantitative attack on the Rainbow electronic signature and the complexity of such an attack depends on the possibility to use this electronic signature in the post-quantum period. Also during the NIST PQC report on the peculiarities of the adoption of the first post-quantum standards, which took place on March 8-11, 2022, some concerns about the Rainbow's security were mentioned due to the implementation of an attack on one of the parameter sets (although the parameter set of the second round). Some details of this attack were discussed in the paper to understand better the state of the Rainbow's electronic signature at the end of the third round of the NIST PQC.
{"title":"Analysis of the RAINBOW post-quantum electronic signature algorithm state and attacks on it for the period of the NIST PQC third round completion","authors":"Ye.Yu. Kaptiol","doi":"10.30837/rt.2022.2.209.09","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.09","url":null,"abstract":"The paper identifies and analyzes attacks aimed at cryptanalysis of the Rainbow post-quantum electronic signature algorithm and the state of this electronic signature within the framework of the NIST PQC competition and as a whole. The Rainbow electronic signature as a candidate in the third round of the NIST PQC was examined in detail for the possibility of cryptanalysis. The possibility to use this quantitative attack on the Rainbow electronic signature and the complexity of such an attack depends on the possibility to use this electronic signature in the post-quantum period. Also during the NIST PQC report on the peculiarities of the adoption of the first post-quantum standards, which took place on March 8-11, 2022, some concerns about the Rainbow's security were mentioned due to the implementation of an attack on one of the parameter sets (although the parameter set of the second round). Some details of this attack were discussed in the paper to understand better the state of the Rainbow's electronic signature at the end of the third round of the NIST PQC.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77479462","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 : 2022-06-24DOI: 10.30837/rt.2022.2.209.12
I. Gorbenko, О.A. Zamula, Yu. S. Osipenko
Ensuring cyber and information security for critical infrastructure is achieved through the implementation of an appropriate set of information security management measures, which can be provided in the form of software policies, methods, procedures, organizational structures and functions. Information security requirements are determined, in particular, by systematic risk assessment of information security, which can be one of the elements of the predicted approach to identifying hazards in the provision of services to service participants in the information interaction of the information system. The paper presents conceptual provisions for assessing and managing cybersecurity risks of the critical infrastructure information system. The proposed concept involves the definition of: areas of security threats to the information system; involved information assets and calculation of their value; assessment of the probability of attacks on the information system; assessment of the probability of success of attacks on the information system and more. Risk assessment methods are proposed that take into account the probability of success of an attack and the probability of an attack occurring, which makes it possible to eliminate the shortcomings inherent in known approaches and provide more accurate identification of attack methods associated with the attacker's behavior. The concept of cybersecurity risk assessment and the methodology for analyzing and assessing security threats that are presented in the work correspond to approaches to building risk-oriented information security management systems and can become the basis for developing an information security system in the information system of a critical infrastructure object.
{"title":"The concept of assessing the risks of cybersecurity of the information system of the critical infrastructure object","authors":"I. Gorbenko, О.A. Zamula, Yu. S. Osipenko","doi":"10.30837/rt.2022.2.209.12","DOIUrl":"https://doi.org/10.30837/rt.2022.2.209.12","url":null,"abstract":"Ensuring cyber and information security for critical infrastructure is achieved through the implementation of an appropriate set of information security management measures, which can be provided in the form of software policies, methods, procedures, organizational structures and functions. Information security requirements are determined, in particular, by systematic risk assessment of information security, which can be one of the elements of the predicted approach to identifying hazards in the provision of services to service participants in the information interaction of the information system. The paper presents conceptual provisions for assessing and managing cybersecurity risks of the critical infrastructure information system. The proposed concept involves the definition of: areas of security threats to the information system; involved information assets and calculation of their value; assessment of the probability of attacks on the information system; assessment of the probability of success of attacks on the information system and more. Risk assessment methods are proposed that take into account the probability of success of an attack and the probability of an attack occurring, which makes it possible to eliminate the shortcomings inherent in known approaches and provide more accurate identification of attack methods associated with the attacker's behavior. The concept of cybersecurity risk assessment and the methodology for analyzing and assessing security threats that are presented in the work correspond to approaches to building risk-oriented information security management systems and can become the basis for developing an information security system in the information system of a critical infrastructure object.","PeriodicalId":41675,"journal":{"name":"Visnyk NTUU KPI Seriia-Radiotekhnika Radioaparatobuduvannia","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89012397","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
扫码关注我们
求助内容：
应助结果提醒方式：