Theoretical and Applied Cybersecurity: scientific journal

Постійне посилання на фонд

https://ela.kpi.ua/handle/123456789/30116
ISSN 2708-1397 (Online), ISSN 2664-2913 (Print) Періодичність: 4 рази на рік
Рік заснування: 2018
Тематика: теоретичні та криптографічні проблеми кібернетичної безпеки; математичні методи, моделі та технології дослідження безпечного функціонування кіберпростору; алгоритми та методи запобігання і протидії кібератакам; безпека промислових систем та систем критичної інфраструктури; кібербезпека Інтернету речей; інтелектуальні методи забезпечення кібербезпеки; проблемні питання сервісів анонімізації; дослідження вразливостей програмного коду і розробка безпечних програм; соціальний інжиніринг та методи протидії деструктивним впливам на свідомість у кіберпросторі; державна політика у сфері кібернетичної безпеки.
Офіційний сайт: http://tacs.ipt.kpi.ua/

Переглянути

Перегляд Theoretical and Applied Cybersecurity: scientific journal за Ключові слова "001.8"

Зараз показуємо 1 - 6 з 6
  • Ескіз
    ДокументВідкритий доступ
    Comparative Analysis of the Cybersecurity Indices and Their Applications
    (Igor Sikorsky Kyiv Polytechnic Institute, 2019) Kravets, V. M.
  • Ескіз
    ДокументВідкритий доступ
    Features of Ensuring Cybersecurity of the Critical Infrastructure of the State
    (Igor Sikorsky Kyiv Polytechnic Institute, 2020) Danyk, Yuriy; Briggs, Chad; Maliarchuk, Tamara
  • Ескіз
    ДокументВідкритий доступ
    Methodical and Applied Aspects of Creation and Application of Cyber Ranges
    (Igor Sikorsky Kyiv Polytechnic Institute, 2019) Danyk, Yuriy
  • Ескіз
    ДокументВідкритий доступ
    On Multivariate Algorithms of Digital Signatures Based on Maps of Unbounded Degree Acting on Secure El Gamal Type Mode
    (Igor Sikorsky Kyiv Polytechnic Institute, 2022) Ustimenko, V. O.
    Multivariate cryptography studies applications of endomorphisms of K[x1 x2, …, xn] where K is a finite commutative ring given in the standard form xi →f1 (x1, x2,…, xn), i=1, 2,…, n. The importance of this direction for the constructions of multivariate digital signatures systems is well known. Close attention of researchers directed towards studies of perspectives of efficient quadratic unbalanced rainbow oil and vinegar system (RUOV) presented for NIST postquantum certification. Various cryptanalytic studies of these signature systems were completed. During Third Round of NIST standardisation projects ROUV digital signature system were rejected. Recently some options to seriously modify theses algorithms as well as all multivariate signature systems which alow to avoid already known attacks were suggested. One of the modifications is to use protocol of noncommutative multivariate cryptography based on platform of endomorphisms of degree 2 and 3. The secure protocol allows safe transfer of quadratic multivariate map from one correspondent to another. So the quadratic map developed for digital signature scheme can be used in a private mode. This scheme requires periodic usage of the protocol with the change of generators and the modification of quadratic multivariate maps. Other modification suggests combination of multivariate map of unbounded degree of size O(n) and density of each fi of size O(1). The resulting map F in its standard form is given as the public rule. We suggest the usage of the last algorithm on the secure El Gamal mode. It means that correspondents use protocols of Noncommutative Cryptography with two multivariate platforms to elaborate safely a collision endomorphism G: xi → gi of linear unbounded degree such that densities of each gi are of size O(n2 ). One of correspondents generates mentioned above F and sends F+G to his/her partner. The security of the protocol and entire digital signature scheme rests on the complexity of NP hard word problem of finding decomposition of given endomorphism G of K[x1,x2,…,xn] into composition of given generators 1G, 2G, …tG, t>1 of the semigroup of End(K[x1,x2,…,xn]). Differently from the usage of quadratic map on El Gamal mode the case of unbounded degree allows single usage of the protocol because the task to approximate F via interception of hashed messages and corresponding signatures is unfeasible in this case.
  • Ескіз
    ДокументВідкритий доступ
    On the usage of postquantum protocols defined in terms of transformation semigroups and their homomophisms
    (Igor Sikorsky Kyiv Polytechnic Institute, 2020) Ustimenko, Vasyl
  • Ескіз
    ДокументВідкритий доступ
    Technique of testing cyber vulnerabilities and quality of Cyberphysical software systems
    (Igor Sikorsky Kyiv Polytechnic Institute, 2021) Danyk, Yuriy; Vysochanska, Victoriya
    Cyber vulnerability testing and software quality cyberphysical systems (complexes) is an important task in ensuring its reliability and security. When working with several variations of products or their versions, testing all software for every variation is resource intensive and irrational. To implement effective technological and economical quality of testing and cyber vulnerabilities of cyberphysical systems software (complexes) in terms of its increasing complexity, both in time (when considering the version) and in space (when considering variation) and lack of access to program code should be developed as follows new methods. Those methods will allow to use the results of previous tests and focus on the most important, for their testing, not yet tested parts. This is possible using regression testing methods and the appropriate choice of test cases and their prioritization to identify and address software issues and cyber vulnerabilities. Of course, testing variations and versions without access to source code, is an extremely problematic and costly task. The article analyzes the stages of regression testing and proposes an improved method for selecting test cases for testing of cyber vulnerabilities of software of cyberphysical systems (complexes) without access to program code. During the study, an analysis of the achievements in this area was conducted, investigating leading experts works. This article also identifies and compares the effectiveness of prioritized and non-prioritized test cases using the average percent detection rate (APFD). As a result of the study, new metrics for measuring test coverage are presented.