<?xml version="1.0" encoding="utf-8"?>
<journal>
  <titleid>9004</titleid>
  <issn>2071-8217</issn>
  <journalInfo lang="ENG">
    <title>Problems of information security. Computer systems</title>
  </journalInfo>
  <issue>
    <number>1</number>
    <altNumber> </altNumber>
    <dateUni>2025</dateUni>
    <pages>1-164</pages>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>9-20</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0007-7981-1146</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Rostov State University of Economics</orgName>
              <surname>Chizhevsky </surname>
              <initials>Maxim</initials>
              <email>ch.inc@yandex.ru</email>
              <address>Russia, 344000, Rostov-on-Don, Bolshaya Sadovaya str., 69</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-5583-4972</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Rostov State University of Economics</orgName>
              <surname>Serpeninov </surname>
              <initials>Oleg</initials>
              <email>serpeninov53@mail.ru</email>
              <address>Russia, 344000, Rostov-on-Don, Bolshaya Sadovaya str., 69</address>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0003-2273-725X</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Rostov State University of Economics</orgName>
              <surname>Lapsar</surname>
              <initials>Aleksey</initials>
              <email>lapsar1958@mail.ru</email>
              <address>Russia, 344000, Rostov-on-Don, Bolshaya Sadovaya str., 69</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Optimization of indicator of compromise utilization in information security tasks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article deals with the problem of updating indicators of compromise in the field of information security. One of the key difficulties is the growing number of false positives, which slows down the process of incident investigation. To solve this problem, we propose a model for assessing the relevance of indicators of compromise, the purpose of which is to optimise their use. The developed model takes into account various parameters, such as the indicator obsolescence rate, the level of trust in the source, the frequency of detection, the proportion of false positives, the consideration of information from open sources, and the type of malicious activity. The model reduces the number of false positives and improves the efficiency of incident monitoring.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/t99x-zeux-75er</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Indicator of compromise</keyword>
            <keyword>relevance</keyword>
            <keyword>assessment model</keyword>
            <keyword>relevance dynamics</keyword>
            <keyword>information security</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.1/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>21-29</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Bezborodov </surname>
              <initials>Pavel</initials>
              <email>bezborodov_pd@edu.spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-2849-4682</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Lavrova </surname>
              <initials>Daria</initials>
              <email>lavrova_ds@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Protecting neural network models from privacy violation threats in federated learning using optimization methods</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper is devoted to an approach to counter threats of privacy violations in federated learning. The approach is based on optimization methods to transform the weights of local neural network models and create new weights for transmission to the joint gradient descent node, which, in turn, allows to prevent the interception of local model weights by an attacker. Experimental studies have confirmed the effectiveness of the developed approach.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/fpvk-xpna-9hx5</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Federated learning</keyword>
            <keyword>neural network models</keyword>
            <keyword>optimization methods</keyword>
            <keyword>gradient descent</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.2/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>30-42</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-1300-2470</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Mozhaysky Military Space Academy</orgName>
              <surname>Biryukov</surname>
              <initials>Denis</initials>
              <email>Biryukov.D.N@yandex.ru</email>
              <address>Russia, 197198, St. Petersburg, Zhdanovskaya str., 13</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0001-9665-0128</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Suprun </surname>
              <initials>Alexander</initials>
              <email>afs54@inbox.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">From “black box” to transparency: philosophical and methodological foundations of explainability and interpretability in artificial intelligence</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article examines the problem of the «black box» in artificial intelligence systems, focusing on the role of explanation (revealing cause-and-effect relationships) and interpretation (adapting meaning for the audience) in the context of machine learning. The philosophical foundations of these concepts are presented, along with an overview of modern methods in explainable AI (XAI). The article emphasizes the need to develop common perspectives on the issues of “explainability” and “interpretability” as they apply to machine learning models and the solutions they generate.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/x8ve-86ez-fv94</doi>
          <udk>004.8 + 004.9 + 165.12</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Artificial intelligence</keyword>
            <keyword>explanation</keyword>
            <keyword>interpretation</keyword>
            <keyword>understanding</keyword>
            <keyword>XAI</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.3/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>43-58</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0005-6662-5606</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Saint Petersburg State University of Aerospace Instrumentation</orgName>
              <surname>Velichko</surname>
              <initials>Ivan</initials>
              <email>wwr0ngn4m3@gmail.com</email>
              <address>Russia, 190000, St. Petersburg, Bolshaya Morskaya str., 67, liter A</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-0924-6221</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Saint Petersburg State University of Aerospace Instrumentation</orgName>
              <surname>Bezzateev</surname>
              <initials>Sergey</initials>
              <email>sergey.bezzateev@gmail.com</email>
              <address>Russia, 190000, St. Petersburg, Bolshaya Morskaya str., 67, liter A</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">From exploitation to protection: a deep dive into adversarial attacks on LLMS</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Modern large language models possess impressive capabilities but remain vulnerable to various attacks that can manipulate their responses, lead to leakage of confidential data, or bypass restrictions. This paper focuses on the analysis of prompt injection attacks, which allow bypassing model constraints, extracting hidden data, or forcing the model to follow malicious instructions.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/mbvv-n1u7-z7be</doi>
          <udk>004.056.52</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Large language models</keyword>
            <keyword>artificial intelligence</keyword>
            <keyword>adversarial attacks</keyword>
            <keyword>defense methods</keyword>
            <keyword>model output manipulation</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.4/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>59-68</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kirillov </surname>
              <initials>Roman</initials>
              <email>kirillov.rb@edu.spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-9732-0099</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kalinin</surname>
              <initials>Maxim</initials>
              <email>max@ibks.spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Detecting adversarial samples in intrusion detection systems using machine learning models</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The problem of protecting machine learning models used in intrusion detection systems from adversarial attacks is considered. Possible methods of protection against adversarial samples based on data anomaly detectors and an autoencoder are analyzed. The results of an experimental study of protective mechanisms that demonstrated high efficiency in detecting distorting data using a Random Forest model are presented.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/2741-bb1k-hf3x</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Adversarial attack</keyword>
            <keyword>machine learning security</keyword>
            <keyword>adversarial sample detection</keyword>
            <keyword>machine learning</keyword>
            <keyword>intrusion detection system</keyword>
            <keyword>Random Forest</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.5/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>69-82</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0002-7321-7430</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Bugaev </surname>
              <initials>Vyacheslav </initials>
              <email>bugaev.va@edu.spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0002-7321-7430</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zhukovskii </surname>
              <initials>Evgeniy </initials>
              <email>bugaev.va@edu.spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0009-0008-4593-4444</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Lyrchikov </surname>
              <initials>Alexander </initials>
              <email>lyrchikov.aa@gmail.com</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Detection of potentially malicious activity in CI/CD pipelines based on analysis of runner behavior</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article addresses the problem of detecting potentially malicious activity in CI/CD pipelines during the build process through the analysis of runner behavior. The limitations of existing pipeline security tools related to threat detection during build execution are identified, as well as promising approaches to detecting malicious activity. A way for detecting potentially malicious activity in pipelines using the eBPF technology for collecting and analyzing runner behavior has been proposed. The accuracy of the detection is evaluated using a dataset that contains implementations of malicious scenarios related to build process compromise. The results obtained can be used to implement protection tools for CI systems and contribute to research in CI/CD pipelines security.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/at5b-46tf-zet9</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>CI/CD pipelines</keyword>
            <keyword>DevSecOps</keyword>
            <keyword>malicious activity</keyword>
            <keyword>anomaly detection</keyword>
            <keyword>eBPF</keyword>
            <keyword>behavioral analysis</keyword>
            <keyword>syscalls</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.6/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>83-96</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-1764-1942</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>A. F. Mozhaysky Military Space Academy</orgName>
              <surname>Lomako</surname>
              <initials>Alexander</initials>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0007-2797-6133</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>A. F. Mozhaysky Military Space Academy</orgName>
              <surname>Isaev</surname>
              <initials>Nail</initials>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0002-9955-2694</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>A. F. Mozhaysky Military Space Academy</orgName>
              <surname>Menisov</surname>
              <initials>Artem</initials>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0002-6807-2954</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>A. F. Mozhaysky Military Space Academy</orgName>
              <surname>Sabirov</surname>
              <initials>Timur</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">An approach to identifying software code vulnerabilities based on adaptation with reinforcement learning of machine learning models</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article is devoted to the development of an approach to identifying vulnerable code using adaptation methods for pre-trained reinforcement machine learning models. A training methodology is presented that includes stages of model adaptation using data from various domains, which ensures high generalization ability of the algorithms. Experimental results have shown the effectiveness of the proposed approach on the popular CWEFix code analysis dataset. The developed approach helps to improve the quality of vulnerability detection and reduce the level of false positives, which makes it a useful tool for ensuring software security.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/7gnx-9z7f-fbrv</doi>
          <udk>004.9</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Code vulnerabilities</keyword>
            <keyword>machine learning</keyword>
            <keyword>reinforcement learning</keyword>
            <keyword>software analysis</keyword>
            <keyword>information security</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.7/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>97-105</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0000-3181-4769</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kostin</surname>
              <initials>Sergey</initials>
              <email>s8kostin@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-7485-4848</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Aleksandrova </surname>
              <initials>Elena</initials>
              <email>aleksandrova_eb@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Multiple signatures on elliptic curve isogenies with masking and participant authentication</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This work investigates approaches for constructing post-quantum digital signature schemes. Contemporary methods for enhancing the security of protocols based on elliptic curve isogenies are analyzed. Multi-signature scheme based on the problem of finding isogenies between supersingular curves with participant authentication is developed. The efficiency and security of the proposed scheme are proved.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/xvpd-hah6-9a56</doi>
          <udk>004.056.53</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Group signature</keyword>
            <keyword>supersingular elliptic curves</keyword>
            <keyword>postquantum cryptography</keyword>
            <keyword>masking</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.8/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>106-120</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-1399-1822</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Shenets </surname>
              <initials>Nikolay</initials>
              <email>shenets_nn@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-7485-4848</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Aleksandrova </surname>
              <initials>Elena</initials>
              <email>aleksandrova_eb@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Konoplev</surname>
              <initials>Artem</initials>
              <email>konoplev_as@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0003-0623-9891</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Gololobov</surname>
              <initials>Nikita</initials>
              <email>gololobov_nv@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">General solution to the special problem of distributing shares using Shamir’s secret sharing scheme</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this paper, we solve the following problem. For a group of n participants, we need to distribute two shares to each of them in such a way that each pair of participants forms a (3, 4)-threshold access structure. In other words, each pair of participants can find some secret using any 3 out of the 4 shares they have. Obviously, this problem has a trivial solution: to share the same secret between everyone using a (3, 2n)-threshold secret sharing scheme. However, of theoretical and practical interest is the case when each pair of participants recovers a secret different from the others. In particular, the solution to this problem is necessary for the key agreement protocol proposed in [1]. In this paper, we find a complete solution to considered problem for Shamir’s secret sharing scheme. In addition, non-interactive methods for randomizing the key agreement protocol from [1] are studied. Unfortunately, it turns out that they do not enhance the security of this protocol.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/gh7t-814n-e9uz</doi>
          <udk>004.056.53 (003.26)</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Key pre-distribution</keyword>
            <keyword>Shamir’s secret sharing scheme</keyword>
            <keyword>key agreement protocol</keyword>
            <keyword>perfectness</keyword>
            <keyword>threshold cryptography</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.9/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>121-131</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-9448-2386</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Krasnodar Higher Military School named after General of the Army S. M. Shtemenko</orgName>
              <surname>Novikov</surname>
              <initials>Pavel</initials>
              <email>novikov.p.ark@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-0644-4353</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Krasnodar Higher Military School named after General of the Army S. M. Shtemenko</orgName>
              <surname>Dichenko</surname>
              <initials>Sergei</initials>
              <email>dichenko.sa@yandex.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0001-9665-2174</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Krasnodar Higher Military School named after General of the Army S. M. Shtemenko</orgName>
              <surname>Lukyanov</surname>
              <initials>Roman</initials>
              <email>19sam@mail.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0002-1122-3563</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Krasnodar Higher Military School named after General of the Army S. M. Shtemenko</orgName>
              <surname>Polikarenkov</surname>
              <initials>Sergei</initials>
            </individInfo>
          </author>
          <author num="005">
            <authorCodes>
              <orcid>0000-0002-6972-1768</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Krasnodar Higher Military School named after General of the Army S. M. Shtemenko</orgName>
              <surname>Martynov</surname>
              <initials>Mikhail</initials>
              <email>chechin@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A mathematical model and methodology for evaluating the effectiveness of network monitoring of data transmission network security</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article considers a network monitoring system for the security of a data transmission network operating under computer influences. One of the most urgent tasks in these conditions is the development of mechanisms for evaluating the effectiveness of network monitoring of data transmission network security from computer influences. A mathematical model and methodology are proposed, where the fundamental difference from the existing ones is a new approach to monitoring the security status of data transmission network elements from computer influences.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/pg74-3nxe-fa33</doi>
          <udk>004.056.53</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Data transmission network</keyword>
            <keyword>network security monitoring</keyword>
            <keyword>computer impacts</keyword>
            <keyword>efficiency assessment</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.10/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>132-144</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0006-6856-2108</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Pahomov</surname>
              <initials>Maksim</initials>
              <email>pahomov_ma@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Model of node interaction in a mobile ad-hoc network considering protection against active network attacks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The features of the functioning of mobile self-organizing networks are considered. Models of node interaction in these networks are analyzed, taking into account protection against network attacks, and their advantages and disadvantages are highlighted. A model of node interaction in a mobile self-organizing network is proposed, considering protection against active network attacks based on early attack detection. Early detection of network attacks is achieved by predicting network parameters and further analyzing them using machine learning methods. A trust model is also used to exclude malicious nodes from the network.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/a3z4-17n4-4xvf</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Information security</keyword>
            <keyword>ad-hoc networks</keyword>
            <keyword>model of node interaction</keyword>
            <keyword>intrusion detection systems</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.11/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>145-154</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Skrypnikov</surname>
              <initials>Artem</initials>
              <email>artem.skr456@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-2264-7513</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Krundyshev</surname>
              <initials>Vasiliy </initials>
              <email>krundyshev_vm@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0002-9732-0099</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kalinin</surname>
              <initials>Maxim</initials>
              <email>max@ibks.spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Anonymization of network traffic in blockchain systems by using garlic routing</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The task of protecting nodes of a blockchain system from security threats of user deanonymization, access restriction, and imposition of false data about the blockchain state is considered. A method of anonymizing the network traffic between nodes of a blockchain system based on garlic routing, supporting integration with consensus mechanism, has been proposed. As a result of experimental study, it is demonstrated that the presented method allows increasing the safety of blockchain systems applied in large-scale network infrastructures.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/nhfh-bxm9-hnh2</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Blockchain</keyword>
            <keyword>deanonymization</keyword>
            <keyword>distributed ledger</keyword>
            <keyword>network traffic</keyword>
            <keyword>garlic routing</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.12/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>155-163</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <scopusid>57200960264</scopusid>
              <orcid>0000-0001-6289-3295</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Russian State Hydrometeorological University</orgName>
              <surname>Sikarev</surname>
              <initials>Igor</initials>
              <email>sikarev@yandex.ru</email>
              <address>Russia, 192007, St. Petersburg, Voronezhskaya str., 79</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-0554-5790</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Admiral Makarov State University of Maritime and Inland Shipping</orgName>
              <surname>Abramov</surname>
              <initials>Valery</initials>
              <email>val.abramov@mail.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0002-5069-6144</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Russian State Hydrometeorological University</orgName>
              <surname>Prostakevich</surname>
              <initials>Konstantin</initials>
              <email>atombyfreund@mail.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <orgName>Russian State Hydrometeorological University</orgName>
              <surname>Abramova</surname>
              <initials>Alexandra</initials>
              <email>alexandria567@mail.ru</email>
            </individInfo>
          </author>
          <author num="005">
            <authorCodes>
              <orcid>0000-0001-7601-2874</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Profinfotech LLC</orgName>
              <surname>Chestnov</surname>
              <initials>Arsenii</initials>
              <email>arsenij430@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Automation of archiving for atmospheric precipitation measurement information</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Considered issues of automation for measuring information archiving received from the OTT PARSIVEL2 laser disdrometer in form of messages with .dat format. It is shown that .dat format is not convenient for archiving in databases. As a result of performed research, methodology and toolkit was developed for automating the conversion of source messages for subsequent archiving in databases, taking into account the specifics of the SQL query language.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/r28m-trm5-pfu3</doi>
          <udk>007.51</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Automation</keyword>
            <keyword>archiving</keyword>
            <keyword>databases</keyword>
            <keyword>disdrometer</keyword>
            <keyword>autonomous surface vessels</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2025.20.13/</furl>
          <file>2025_1-5-6.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
