<?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>3</number>
    <altNumber> </altNumber>
    <dateUni>2026</dateUni>
    <pages>1-216</pages>
    <articles>
      <article>
        <artType>REV</artType>
        <langPubl>RUS</langPubl>
        <pages>9-24</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0007-8669-8081</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Istomina</surname>
              <initials>Anastasiya</initials>
              <email>isto.anastasiya@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0008-9678-2428</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>JSC “Positive Technologies”</orgName>
              <surname>Iakovlev</surname>
              <initials>Andrei</initials>
              <email>Andrew42ru@icloud.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Systematization of open protection mechanisms for agent systems based on large language models and analysis of threat landscape coverage</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Protection tools for agent systems based on large language models develop in a fragmented way. They exist as separate open-source projects, commercial products, and research publications, and there is no unified view of how completely they cover current threat classes. This work systematizes the protection mechanisms of agent systems and assesses how completely they cover the threat landscape. A two-axis classification is proposed, in which each mechanism is characterized by its architectural level of application and its nature of impact. Following a unified scheme, 46 mechanisms selected from a catalog of 118 repositories are described. A quantitative coverage map of threats and mechanisms is built against the OWASP Top 10 for Agentic Applications 2026 and the OWASP Top 10 for Large Language Model Applications 2025. A defensein-depth indicator is introduced. The set of mechanisms covers all 10 classes of agentic threats, but coverage depth is distributed unevenly. “Tool misuse” is covered most fully, while “memory poisoning”, “insecure inter agent communication”, and “compromised agents” remain structural gaps without a mature preventive tool. Typical misconceptions in selecting protection tools are identified, and a minimal set of protections for designing agent systems is proposed.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-1</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Agent systems</keyword>
            <keyword>large language models</keyword>
            <keyword>protection mechanisms</keyword>
            <keyword>threat landscape</keyword>
            <keyword>OWASP</keyword>
            <keyword>prompt injection</keyword>
            <keyword>threat coverage map</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.1/</furl>
          <file>file-9-24.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>25-48</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0000-3319-8357</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Saint Petersburg Electrotechnical University "LETI"</orgName>
              <surname>Kasyanov</surname>
              <initials>Alexandr</initials>
              <email>kasjanov@inbox.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-1373-0670</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>ITMO University</orgName>
              <surname>Grishencev</surname>
              <initials>Alexey</initials>
              <email>agrishentsev@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Method of evaluating the quality of random-number generators based on spectral entropy calculation</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The aim of this study was to develop and mathematically substantiate a method for assessing the randomness quality of output sequences produced by random and pseudorandom number generators based on spectral entropy. To solve the individual subproblems, the following methods were used: the discrete Fourier transform for signal spectrum computation; nonparametric bootstrap for constructing empirical distributions of estimates and determining decision thresholds; and the Mahalanobis distance for quantitative comparison of the analyzed realizations with a reference region and for formalizing the criterion of membership in the class of random sequences. Using a test case based on a deterministic sequence of natural numbers, it was established that Shannon entropy may yield a false-positive conclusion of randomness, whereas spectral entropy reliably detects non-randomness. The study of random sequences generated by a physical generator under different operating modes made it possible to conclude that the spectral entropy method detects degradation of sequence randomness when the generator operating conditions are chosen incorrectly. It should be noted that, in terms of effectiveness for the problem under consideration, the proposed spectral entropy method is not inferior to the standard NIST STS tests and, in some cases, outperforms them. Within the conducted experiments, it was established that the synthesized sequences generated using the ChaCha20 stream cipher satisfy the randomness criterion obtained by the spectral entropy method, which is interpreted as compliance with the requirements imposed on cryptographic sources of randomness. The study also showed that the developed method makes it possible to detect non-randomness in sequences generated by linear feedback shift registers (LFSRs). The scientific novelty of the work lies in the fact that а method for evaluating the quality of random and pseudorandom number generators based on spectral entropy computation has been theoretically substantiated and developed to a level of readiness for practical application. It has been established that, compared with Shannon entropy, the method provides greater robustness in randomness quality assessment. The practical significance lies in improving the efficiency of assessing the quality of random and pseudorandom sequences.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-2</doi>
          <udk>519.248:004.056.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Randomness</keyword>
            <keyword>bit sequence</keyword>
            <keyword>spectral entropy</keyword>
            <keyword>power spectral density</keyword>
            <keyword>bootstrap method</keyword>
            <keyword>statistical testing</keyword>
            <keyword>Mahalanobis distance (metric)</keyword>
            <keyword>interquartile range</keyword>
            <keyword>linear feedback shift registers</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.2/</furl>
          <file>file-25-48.pdf</file>
        </files>
      </article>
      <article>
        <artType>REV</artType>
        <langPubl>RUS</langPubl>
        <pages>49-59</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0009-2388-9467</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Siotanov</surname>
              <initials>Alexey</initials>
              <email>siotanov.am@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Makarov</surname>
              <initials>Alexander</initials>
              <email>makarov_as@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Review of protocols for secure remote access to computer systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article discusses the problem of ensuring information security with remote access to information resources. The relevance of the work is due to the growth of distributed computer systems and the high risks of data interception during the transfer of credentials. The functions of the remote access server and the basic Point-to-Point Protocol link layer are analyzed. The main focus is on the classification and comparison of authentication protocols: direct scheme (PAP, CHAP, S/Key) and indirect (centralized) scheme (RADIUS, Kerberos). The article describes in detail the algorithms of each protocol. As a result of the research, the necessity of a combined approach to the choice of authentication protocols depending on the network architecture is substantiated, as well as the requirements for modern remote access systems are formulated.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-3</doi>
          <udk>004.056.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Information security</keyword>
            <keyword>remote access</keyword>
            <keyword>protocol</keyword>
            <keyword>authentication</keyword>
            <keyword>computer systems</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.3/</furl>
          <file>file-49-59.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>60-71</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0003-4569-2258</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Vedenskii</surname>
              <initials>Viktor</initials>
              <email>viktor_vedenskiy@bk.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A model of risk-aware scheduling in container orchestrators considering the attacker’s horizontal movement</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Common container orchestrator schedulers focus on resource metrics and distribution policies, ignoring the security risks associated with lateral movement between containers and cluster nodes. This paper presents a risk-based pod placement model that accounts for three channels of lateral movement: shared system calls on a node (risk of container escape), role-based access control mismatches, and network interactions between pods. Probabilistic estimates of container compromise are introduced as a function of node security. A greedy algorithm for sequential container assignment suitable for use in real-world schedulers is proposed. A comparative analysis with leading approaches to securing container environments is provided. The results of this study can be applied for the development of Kubernetes scheduler extensions that integrate placement-level security.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-4</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Kubernetes</keyword>
            <keyword>scheduling</keyword>
            <keyword>container security</keyword>
            <keyword>lateral movement</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.4/</furl>
          <file>file-60-71.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>72-83</pages>
        <authors>
          <author num="001">
            <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">A formal model of executive software code based on an execution graph for solving the binary morphing problem</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper addresses the problem of developing a formal model of executable software code intended to provide a rigorous mathematical description of runtime program transformation (code morphing) processes. The relevance of the study is determined by the need to develop a mathematical framework that provides a formal justification for methods of modifying the structure of executable code without violating the functional correctness of software. The aim of the study is to develop an architecture-independent formal model of executable code that enables the identification of invariant software properties during code morphing operations and establishes the conditions required to preserve the observable behavior of a program. The proposed model integrates both static and dynamic components of executable code. The static component represents a program as a collection of basic blocks connected by a control flow graph, together with a code placement configuration in the address space and a set of control references between the blocks. The dynamic component provides a formal description of the program execution trace, the sequence of computational system states, and the observable behavior defined exclusively by externally observable execution results. The practical significance of the study lies in the development of a unified formal framework suitable for proving the correctness of executable code morphing algorithms, designing methods for their formal verification, and analyzing the security of software systems. The obtained results establish a theoretical foundation for further research in the field of dynamic executable code transformation and the development of advanced software protection technologies.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-5</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Сybersecurity</keyword>
            <keyword>software model</keyword>
            <keyword>execution graph</keyword>
            <keyword>graph theory</keyword>
            <keyword>security analysis</keyword>
            <keyword>code transformation</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.5/</furl>
          <file>file-72-83.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>84-95</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-4151-5908</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Mozhaisky Military Space Academy</orgName>
              <surname>Russu</surname>
              <initials>Valery</initials>
              <email>russu_valeriy@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Military Space Academy named after A. F. Mozhaisky</orgName>
              <surname>Kazmin</surname>
              <initials>Denis</initials>
              <email>nemaskin3112@mail.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <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>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A method for identifying hidden information leak channels due to incorrect updates of database management system kernel programs</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article examines the problem of vulnerabilities that arise during software updates in isolated corporate systems running Astra Linux. A possible method for implementing an attack to gain root access through a modified software update package is demonstrated. A multi-layered method for detecting update package modifications is proposed, including static, behavioral, and signature-based analysis using machine learning methods and algorithms. This method significantly improves the security of the software update process in network isolation.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-6</doi>
          <udk>004.056.53</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Information security</keyword>
            <keyword>automated vulnerability detection</keyword>
            <keyword>automated firmware unpacking</keyword>
            <keyword>information security</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.6/</furl>
          <file>file-84-95.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>96-109</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Abitov</surname>
              <initials>Roman</initials>
              <email>abitov_roman@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0001-9862-1507</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Dakhnovich</surname>
              <initials>Andrey</initials>
              <email>add@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Moskvin</surname>
              <initials>Dmitry</initials>
              <email>moskvin_da@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Research on methods for automated data extraction from web resources with dynamically changing content using AI agents</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper addresses automated extraction of data from web resources with dynamically changing content using AI agents. Data collection practice remains fragmented because of heterogeneous DOM structures, interactive user actions, anti-bot controls, and the predominance of unstructured web data, which increases maintenance costs of classical parsers. We propose a two-stage method that separates an expensive large language model analysis stage from an economical deterministic mass-collection stage. The method is implemented in a software prototype based on OpenClaw multi-agent orchestration, an isolated Chromium browser contour, the Model Context Protocol, and an authentication contour. We performed comparative analysis of scraping tools and large language models, classified feed types and active actions, and experimentally assessed extraction quality. On a reference dataset the primary quality metric reached F1 = 0.89. Limitations include selector fragility, evolving anti-bot mechanisms, and the computational cost of the configuration stage.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-7</doi>
          <udk>004.89:004.738.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>AI agents</keyword>
            <keyword>data extraction</keyword>
            <keyword>web scraping</keyword>
            <keyword>dynamic content</keyword>
            <keyword>large language models</keyword>
            <keyword>asynchronous processing</keyword>
            <keyword>fault tolerance</keyword>
            <keyword>data quality</keyword>
            <keyword>Model Context Protocol</keyword>
            <keyword>Chromium</keyword>
            <keyword>OpenClaw</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.7/</furl>
          <file>file-96-109.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>110-119</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Logacheva</surname>
              <initials>Svetlana</initials>
              <email>logacheva_sv@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Moskalev</surname>
              <initials>Nikita</initials>
              <email>moskalev.no@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <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">Integration of recommender systems into UEBA architecture for behavioral anomaly detection</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The work is devoted to the problem of detecting behavioral anomalies in corporate information systems that are potentially related to the actions of internal intruders. During the work, an analysis of existing UEBA (User and Entity Behavior Analytics) systems was conducted. The identified shortcomings of known solutions highlight the need to create new approaches to analyzing user behavior. As a solution, an approach to integrating recommendation systems into the UEBA architecture was developed, based on rephrasing the task of anomaly detection as a task of estimating the typicality of user behavior based on collective experience. The feasibility of this approach was theoretically justified and experimentally confirmed. The obtained results demonstrate the superiority of the proposed approach over the basic methods in terms of Precision and F1-score metrics and can be used to create new protective solutions.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-8</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>UEBA</keyword>
            <keyword>recommender systems</keyword>
            <keyword>behavioral analytics</keyword>
            <keyword>collaborative filtering</keyword>
            <keyword>anomaly detection</keyword>
            <keyword>insider threats</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.8/</furl>
          <file>file-110-119.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>120-130</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-1787-6522</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Financial University under the Government of the Russian Federation</orgName>
              <surname>Antonov</surname>
              <initials>Alexander</initials>
              <email>alaantonov@fa.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Methodology for selecting information security tools for an airline based on the branch-and-bound method</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Modern requirements for the rational use of aircraft enterprise networks and their information security determine the choice of relevant information security tools. Currently, the market offers a wide range of certified information security tools, making it difficult to choose the optimal option. To address this issue, the article proposes a methodology based on the branch-and-bound method for selecting information security tools for processing personal data in aircraft enterprise information systems. This methodology allows for finding the optimal solution within the framework of a deterministic linear model of discrete optimization, eliminating inefficient options in the initial stages.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-9</doi>
          <udk>004.056.53</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Methodology</keyword>
            <keyword>branch and bound method</keyword>
            <keyword>information security</keyword>
            <keyword>airline</keyword>
            <keyword>threats</keyword>
            <keyword>discrete optimization</keyword>
            <keyword>information security tools</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.9/</furl>
          <file>file-120-130.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>131-144</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0002-8319-8237</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>National University of Oil and Gas “Gubkin University”</orgName>
              <surname>Baryshnikova</surname>
              <initials>Alena</initials>
              <email>baryshnikova1309@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0002-9304-3757</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>National University of Oil and Gas "Gubkin University"</orgName>
              <surname>Morozov</surname>
              <initials>Ilya</initials>
              <email>morozowilui@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Personal data depersonalization algorithm for transfer to test development environments in government bodies and organizations</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The digital transformation of public administration is accompanied by the intensive development of automated information systems that process significant amounts of personal data of citizens. The practice of preparing test environments by copying records from operational databases creates serious risks of unauthorized dissemination of personal data, primarily from internal intruders with legitimate access to information resources. The article analyzes the problem of personal data protection when they are transferred to test development environments in government agencies and organizations. The analysis of the typical organizational structure and information flows is carried out, the model of the internal violator is formalized, the target threat of homicide is considered.096 (“Copying”) according to the Basic Threat Document of the FSTEC of Russia. An irreversible deconstruction algorithm is proposed that combines deterministic hashing with a unique salt based on the Keccak‑256 algorithm and context-sensitive masking. The algorithm complies with the requirements of Federal Law No. 152-FZ “On Personal Data”, Federal Law No. 187-FZ “On the Security of Critical Information Infrastructure”, GOST R57700.34–2017 and the Basic Threat Document of the FSTEC of Russia. The integrability of the solution into CI/CD pipelines is shown without reducing the flexibility of development. The results demonstrate the applicability of the proposed approach both in educational and other government organizations operating information systems with arrays of structured personal data.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-10</doi>
          <udk>004.056.53</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Personal data</keyword>
            <keyword>depersonalization</keyword>
            <keyword>test environment</keyword>
            <keyword>information security</keyword>
            <keyword>internal intruder</keyword>
            <keyword>Keccak‑256</keyword>
            <keyword>CI/CD</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.10/</furl>
          <file>file-131-144.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>145-161</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-9911-1584</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>North-Caucasus Federal University; MIREA – Russian Technological University (Stavropol branch)</orgName>
              <surname>Mandritsa</surname>
              <initials>Igor</initials>
              <email>d_artman@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-4293-7013</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>North-Caucasus Federal University</orgName>
              <surname>Petrenko</surname>
              <initials>Vyacheslav</initials>
              <email>vipetrenko@ncfu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0002-0364-1239</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>MIREA – Russian Technological University (Stavropol branch)</orgName>
              <surname>Mandritsa</surname>
              <initials>Olga</initials>
              <email>man_olga@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Theoretical framework for three-level information security budgeting in small and medium-sized enterprises</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper develops a theoretical three-level information security budgeting framework for small and medium-sized enterprises, integrating: a previously validated 16-factor threat taxonomy based on the Toxicity Index TDI and the Fisher – Jenks method; a threedimensional threat space with axes ‘toxicity × budget load × attack frequency’; cluster-dependent convolution functions – Expected Annual Loss (EAL) for mass threats (Opportunist), Conditional Value-at-Risk (CVaR) for catastrophic threats (Apex Predator), and the budgetary anticipation function B_AI for the emerging class of AI-threats. The vertical compatibility theorem is proven: level I results are a special case of level III functions under degenerate parameters. The Delphi method is applied exclusively for AHP weight calibration. Empirical validation is based on 94 small and mediumsized enterprises of the Southern Federal District, 347 incidents, 2022–2025.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-11</doi>
          <udk>338.2:004.056.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Information security budgeting</keyword>
            <keyword>clustering of cyber threats</keyword>
            <keyword>expected annual losses</keyword>
            <keyword>notional value at risk</keyword>
            <keyword>theory of extreme values</keyword>
            <keyword>small and medium-sized businesses</keyword>
            <keyword>analytical hierarchy method</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.11/</furl>
          <file>file-145-161.pdf</file>
        </files>
      </article>
      <article>
        <artType>REV</artType>
        <langPubl>RUS</langPubl>
        <pages>162-178</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0001-3593-1417</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Paguba</surname>
              <initials>Grigoriy</initials>
              <email>paguba.gyu@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0003-5808-3267</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kineshev</surname>
              <initials>Daniil</initials>
              <email>kineshev.ds@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0009-0004-1441-8771</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kondachkov</surname>
              <initials>Egor</initials>
              <email>kondachkov_ed@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Systematization of channels and tools for conduction of attacks on embedded systems via fault injection</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper systematizes channels and tools for conduction of attacks on embedded systems via fault injection. Each channel and tool’s advantages and disadvantages are discussed, along with a brief description. Based on this analysis, directions for further research related to ensuring software resilience to fault injection are identified.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-12</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Information security</keyword>
            <keyword>errors detection</keyword>
            <keyword>software</keyword>
            <keyword>fault injection</keyword>
            <keyword>embedded systems</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.12/</furl>
          <file>file-162-178.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>179-189</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-0123-010X</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Admiral Makarov State University of Maritime and Inland Shipping</orgName>
              <surname>Arbuzov</surname>
              <initials>Artem</initials>
              <email>artarbuzv@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-9803-6284</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Admiral Makarov State University of Maritime and Inland Shipping</orgName>
              <surname>Nyrkov</surname>
              <initials>Anatoly</initials>
              <email>kaf.koib@gmail.com, nyrkowap@gumrf.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Admiral Makarov State University of Maritime and Inland Shipping</orgName>
              <surname>Gaskarov</surname>
              <initials>Dilyaur</initials>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0002-3661-9417</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Saint-Petersburg State Marine Technical University</orgName>
              <surname>Li</surname>
              <initials>Isolda</initials>
              <email>LiIV@gumrf.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Analysis of threats of application level of IoT-systems and application of machine learning methods to ensure their safety</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper analyzes threats characteristic of the application layer of modern IoT systems, as well as the potential of machine learning algorithms for ensuring its security. The study focuses on the analysis of this layer, since IoT management applications have a highly diverse attack surface. The paper reviews studies proposing machine-learning-based solutions for detecting and preventing threats affecting modern IoT applications. Since these applications also serve as a point of interaction between humans and IoT systems, the paper also addresses the use of machine learning to counter social engineering techniques targeting IoT users.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-13</doi>
          <udk>004.056.5, 004.896, 629.5.067</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Internet of Things</keyword>
            <keyword>water transportation</keyword>
            <keyword>IoT systems architecture</keyword>
            <keyword>application layer</keyword>
            <keyword>social engineering</keyword>
            <keyword>phishing</keyword>
            <keyword>large language models</keyword>
            <keyword>machine learning</keyword>
            <keyword>cybersecurity</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.13/</furl>
          <file>file-179-189.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>190-203</pages>
        <authors>
          <author num="001">
            <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>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Gartvig</surname>
              <initials>Roman</initials>
              <email>gartvig.ra@edu.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Distributed ledger architecture based on a directed acyclic graph with safe record finalization and limited memory consumption</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A new distributed ledger architecture based on a directed acyclic graph (DAG) is presented, designed for heterogeneous IoT environments with a large number of resource-limited nodes. Unlike classic blockchains and existing DAG ledgers, the proposed solution combines parallel transaction commits within epochs, BFT state finality, and a genesis state rotation mechanism that enables secure deletion of ledger’s history. Experimental evaluation showed that the developed approach reduces the amount of stored data by five times compared to the genuine DAG architecture without rollup, and preserves up to 80 % of pure transactions under conflict load, confirming the effectiveness of the proposed architecture for use in distributed ledgers for smart cities and cyber-physical systems.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-14</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Security</keyword>
            <keyword>directed acyclic graph</keyword>
            <keyword>distributed ledger</keyword>
            <keyword>genesis block</keyword>
            <keyword>history pruning</keyword>
            <keyword>finality</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.14/</furl>
          <file>file-190-203.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>204-215</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0005-4352-9099</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Krasnodar Higher Military awarded by the Order of Zhukov and by the Orders of October Revolution and the Red Banner School named after the general of the Army S. M. Shtemenko of the Department of Defense of Russian Federation</orgName>
              <surname>Rusov</surname>
              <initials>German</initials>
              <email>grusov1999@gmail.com</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>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Algorithm for data integrity assurance in distributed storages with compensation for the results of destabilizing impacts and verification of recovery results</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">An algorithm for ensuring data integrity in distributed storage systems is considered. The algorithm is aimed at monitoring the integrity of stored data and compensating for the effects of random and deliberate destabilizing factors, with verification of the reliability of recovery results. It is intended to support write and read operations for data arrays under conditions of storage node failures, sub-block corruption, network degradation, and attempts at coordinated substitution of integrity reference values for stored data arrays. The mathematical basis of the algorithm consists of modular arithmetic methods, the Chinese Remainder Theorem, and cryptographic hashing. A data array is represented as a vector of residues with separation of the system’s informational and control modules. Verification of the reliability of the data integrity assurance result is achieved by means of an independent global reference value of the original array and local reference values of its sub-blocks, placed with threefold replication in an isolated cluster of storage nodes. In the absence of signs of integrity violation, the algorithm performs reading using the minimum required number of sub-blocks and a single global cryptographic check. When signs of integrity violation are detected, verification against local reference values is performed, a minimally sufficient set of correct sub-blocks is formed, and the original array is reconstructed according to the Chinese Remainder Theorem. The result is then verified by cryptographic integrity control, after which the corrupted sub-blocks are rewritten and the metadata are updated. The proposed algorithm ensures the integrity of processed data, localization of sub-blocks exhibiting signs of integrity violation, and early completion of integrity control and recovery procedures in distributed storage systems.</abstract>
        </abstracts>
        <codes>
          <doi>10.66424/2071-8217-2026-3-15</doi>
          <udk>004.056.53</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Data integrity</keyword>
            <keyword>distributed storage</keyword>
            <keyword>modular arithmetic</keyword>
            <keyword>Chinese remainder theorem</keyword>
            <keyword>cryptographic hash function</keyword>
            <keyword>confirmed integrity</keyword>
            <keyword>data recovery</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2026.28.15/</furl>
          <file>file-204-215.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
