<?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>4</number>
    <altNumber> </altNumber>
    <dateUni>2024</dateUni>
    <pages>1-162</pages>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>9-21</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>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-1345-1874</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Pavlenko</surname>
              <initials>Evgeny</initials>
              <email>pavlenko_eyu@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Analysis of methods for attaching malware at the level of security rings of x86_64 processors</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper examines methods for persistence establishment of malicious software (malware) to various levels of security rings of modern processors based on the x86_64 architecture. The article discusses all levels of rings from 3 (user) to -3 (level of the control engine). In addition, for each level, the capabilities of malware are defined, which is attached to the corresponding ring. Correlating the capabilities and levels of rings makes it possible in the future to develop criteria according to which it will be possible to identify malicious software operating on a personal computer. As a result of the analysis, it was established that the methods of attachment for different rings differ, and malicious activity can only be detected from levels lower than the malware located, which imposes a number of requirements on a unified method for its detection</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/ukdu-5bxg-fz27</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>cybersecurity</keyword>
            <keyword>malware analysis</keyword>
            <keyword>security rings</keyword>
            <keyword>methods of attaching malware</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.1/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>22-32</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0004-5410-411X</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Rostov State University of Economics</orgName>
              <surname>Cherevan</surname>
              <initials>Anton</initials>
              <email>antuere@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <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">A method for detecting floating exploits in software at the final stage of development</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article presents a method for detecting and eliminating floating vulnerabilities in mobile applications at the final stage of development. The nature of such vulnerabilities is analyzed and existing methods of their detection and neutralization are considered. The developed method is based on analyzing the state of the application at different points in time and comparing it with the reference state. It includes fixing the initial state, discrete analysis of its changes, detection and identification of vulnerabilities, their elimination. The main area of application of the method is to ensure the security of mobile applications at late stages of development and in the process of final testing. The conclusions of the article emphasize the importance of early detection of floating vulnerabilities to ensure a high level of information security of the final (final) software product</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/5f4e-f193-hrv3</doi>
          <udk>004.021, 681.518.22</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>floating vulnerabilities</keyword>
            <keyword>mobile applications</keyword>
            <keyword>program testing</keyword>
            <keyword>state estimation</keyword>
            <keyword>information security</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.2/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>33-41</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Military Space Academy named after A. F. Mozhaysky</orgName>
              <surname>Gilmullin</surname>
              <initials>Rustam</initials>
              <email>grustam@bk.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Military Space Academy named after A. F. Mozhaysky</orgName>
              <surname>Kuzinkov</surname>
              <initials>Aaleksey</initials>
              <email>zeba83@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Military Space Academy named after A. F. Mozhaysky</orgName>
              <surname>Mukaev</surname>
              <initials>Ivan</initials>
              <email>ivanmukaev@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Identification of subscriber terminals with multithreaded pipeline organization of calculations for database formation</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Identification of graphical subsystems with parallel-conveyor organization of calculations as a means of detection of subscriber terminals in information-telecommunication networks</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/7zgh-m9b1-69rr</doi>
          <udk>004.043</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>identification</keyword>
            <keyword>graphical subsystem</keyword>
            <keyword>JavaScript</keyword>
            <keyword>web browser</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.3/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>42-52</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0004-0517-5704</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Erastov</surname>
              <initials>Vyacheslav</initials>
              <email>erastov.vo@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zubkov</surname>
              <initials>Evgeny</initials>
              <email>zubkov.e@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <scopusid>13103571000</scopusid>
              <orcid>0000-0002-0232-7248</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zegzhda</surname>
              <initials>Dmitry</initials>
              <email>zegzhda_dp@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Research of information security audit problems of geographically distributed devices of the Internet of Things</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Existing approaches to building systems for active auditing of IoT devices are investigated. A sustainable approach to auditing IoT devices using fault-tolerant distribution is proposed. A comparative analysis of algorithms for achieving consensus in distributed systems and means of implementing active auditing is carried out</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/vk2n-dgmv-b18h</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>audit</keyword>
            <keyword>Censys</keyword>
            <keyword>distributed computing</keyword>
            <keyword>information security</keyword>
            <keyword>information technology</keyword>
            <keyword>Internet of Things</keyword>
            <keyword>Nmap</keyword>
            <keyword>port scanner</keyword>
            <keyword>Raft</keyword>
            <keyword>Shodan</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.4/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>53-62</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-4374-1645</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>National Research Nuclear University MEPhI (Moscow Engineering Physics Institute)</orgName>
              <surname>Finoshin</surname>
              <initials>Mikhail</initials>
              <email>MAFinoshin@mephi.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-3022-8973</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Russian University of Transport (MIIT)</orgName>
              <surname>Ivanova</surname>
              <initials>Irina</initials>
              <email>iid.ivanova@yandex.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <scopusid>55229487100</scopusid>
              <orcid>0000-0002-4429-8799</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>National Research Nuclear University MEPhI (Moscow Engineering Physics Institute)</orgName>
              <surname>Zhukov</surname>
              <initials>Igor</initials>
              <email>i.zhukov@inbox.ru</email>
              <address>Russia, 115409, Moscow, Kashirskoe shosse, 31</address>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <orgName>LLC Hexagon</orgName>
              <surname>Zuikov</surname>
              <initials>Alexander</initials>
              <email>az@hex.team</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Covert storage channels in the TLS protocol</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Protection methods against TLS covert storage channels using the Random and SessionID fields of the ClientHello message are proposed. Protection means have been developed using the proposed protection methods: a module for IDS/IPS Suricata that filters TLS packets depending on the SessionID contents, and a proxy server that reformats packets transmitted to the communication environment. A comparative analysis of the implemented protection means was carried out from the point of view of their impact on the communication channel bandwidth and their effectiveness in the secret information transfer countering. The developed protection means are applicable for integration into existing protection systems against network covert channels. Recommendations on the use of proposed protection means depending on the desired level of security are given</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/r5fz-um2f-mh48</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>secret information</keyword>
            <keyword>ClientHello message</keyword>
            <keyword>Random</keyword>
            <keyword>SessionID field</keyword>
            <keyword>proxy server</keyword>
            <keyword>filtering mean</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.5/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>63-73</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <scopusid>7006566675</scopusid>
              <orcid>0000-0002-6076-7241</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Emperor Alexander I St. Petersburg State Transport University</orgName>
              <surname>Kornienko</surname>
              <initials>Anatoliy</initials>
              <email>kaa.pgups@yandex.ru</email>
              <address>Russia, 190031, St. Petersburg, Moskovsky ave., 9</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-2683-0697</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Emperor Alexander I St. Petersburg State Transport University</orgName>
              <surname>Kornienko</surname>
              <initials>Svetlana</initials>
              <email>sv.diass99@yandex.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Emperor Alexander I St. Petersburg State Transport University</orgName>
              <surname>Barabanshchikova</surname>
              <initials>Mariya </initials>
              <email>mary.barabanshikova01@mail.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <orgName>Digital Technologies 1520 LLC</orgName>
              <surname>Sobakin</surname>
              <initials>Sergey</initials>
              <email>s.sobakin@dt1520.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Software tool for managing the access control model for the corporate portal</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article considers the corporate portal on the Incomand platform as a single access point to the information system of Digital Technologies 1520 LLC to ensure automation and systematization of implemented business processes in order to improve work efficiency and organize convenient access for employees to all information assets, including confidential information. To increase the level of security of information processed and stored in the organization, a software tool for managing the role model of access control for employees of the organization has been developed and implemented, which significantly complements the standard security model of the corporate portal</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/a5ht-bx3z-t1rd</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>corporate information system</keyword>
            <keyword>corporate portal</keyword>
            <keyword>role model of access control</keyword>
            <keyword>information protection</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.6/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>74-84</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">Key pre-distribution technique using Shamir’s secret sharing scheme</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Two new approaches to key pre-distribution based on an ideal additive homomorphic secret sharing scheme were proposed in [1]. However, it was not possible to prove their security against insider attacks in the general case. In this paper, a simple method for distributing shares based on Shamir’s secret sharing scheme corresponding to the first approach in [1] is proposed and analyzed. Namely, the following problem is solved: it is necessary to distribute 2n shares among n participants in such a way that each participant keeps two shares, and any pair of participants corresponds to a (3,4)-threshold scheme, where the common threshold can be arbitrary. Note that such a problem is solved for the first time in the theory of secret sharing. Unfortunately, the analysis showed that the key agreement protocol based on the proposed technique of shares pre-distribution is not resistant to insider attacks. A general necessary condition for the security of the key agreement protocol in the inside adversary model is obtained</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/1p42-3zn6-ffrx</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>adversary model</keyword>
            <keyword>lightweight cryptography</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.7/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>85-93</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-6377-5581</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Admiral S.O. Makarov State University of Marine and River Fleet</orgName>
              <surname>Baryshnikov</surname>
              <initials>Sergey</initials>
              <email>barychnikovso@gumrf.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Admiral S.O. Makarov State University of Marine and River Fleet</orgName>
              <surname>Sakharov</surname>
              <initials>Vladimir</initials>
              <email>saharovvv@gumrf.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <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="004">
            <individInfo lang="ENG">
              <orgName>Admiral Makarov State University of Maritime and Inland Shipping</orgName>
              <surname>Chertkov</surname>
              <initials>Alexander</initials>
            </individInfo>
          </author>
          <author num="005">
            <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>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Automation of active power flows evaluation</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Automation of the approximate method for estimating active power flows in an electric network with three buses according to specified parameters in nodes using an incomplete conductivity matrix and the implementation of calculations in the CVX format. is considered. The method is based on the fact that the active resistances of the power transmission lines in the electrical circuit are significantly less than the reactive ones, which makes it possible to obtain a simple relationship between the power in the nodes and the angles, which establishes the connection of the parameters of the nodes using a non-invertible conductivity matrix. CVX is a calculation format that allows you to introduce various constraints, including current density in lines, parametric changes, external perturbations, etc. The results of estimates of active power flows for possible variants of the node “zeroing” scheme by minimizing the Euclidean norm are presented. The practical application of the proposed method is determined by the need to quickly assess the volume of purchases in the electricity markets</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/hxee-hpu5-8d9h</doi>
          <udk>621.398.04</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>power grid</keyword>
            <keyword>power flows</keyword>
            <keyword>approximate estimation method</keyword>
            <keyword>conductivity matrix</keyword>
            <keyword>incomplete matrix rank</keyword>
            <keyword>CVX technologies</keyword>
            <keyword>Euclidean norm</keyword>
            <keyword>computational structure</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.8/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>94-108</pages>
        <authors>
          <author num="001">
            <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="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Cheskidov</surname>
              <initials>Vasily</initials>
              <email>cheskidov.vk@edu.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">A protection method for the global model of the federated learning systems based on a trust model</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper reviews the problem of ensuring the security of a global model in the federated learning systems. The proposed protection method, based on data verification using a trusted group of nodes, ensures that only correct updates are considered during the aggregation of the global model. As a result of experimental study, it is demonstrated that the developed method ensures high speed of identification and isolation of adversarial clients implementing label substitution and noise imposition</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/mf2n-fb13-p7p6</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>artificial intelligence security</keyword>
            <keyword>model security</keyword>
            <keyword>noise imposition</keyword>
            <keyword>trust model</keyword>
            <keyword>label substitution</keyword>
            <keyword>federated learning</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.9/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>109-139</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0005-3510-6942</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Bauman Moscow State Technical University</orgName>
              <surname>Vetoshkin</surname>
              <initials>Artem</initials>
              <email>vetart1941@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0000-0286-1160</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Bauman Moscow State Technical University</orgName>
              <surname>Mironova</surname>
              <initials>Alexandra</initials>
              <email>alexandra.miralex@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0009-0007-9909-755X</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>OZON Marketplace Kazakhstan LLP</orgName>
              <surname>Zenger</surname>
              <initials>Anna</initials>
              <email>azenger98@gmail.com</email>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0002-1370-6905</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>SAP America, Inc.</orgName>
              <surname>Sukhobokov</surname>
              <initials>Artem</initials>
              <email>artem.sukhobokov@gmail.com</email>
            </individInfo>
          </author>
          <author num="005">
            <authorCodes>
              <orcid>0000-0002-0852-4162</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Bauman Moscow State Technical University</orgName>
              <surname>Goryachkin</surname>
              <initials>Boris</initials>
              <email>bsgor@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Prospects for the application of archigraphs in data and knowledge storage systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The choice of a model for representing data and knowledge in storage systems determines several of their simultaneously unattainable most important characteristics, including: the ability to create various flexible and complex data and knowledge architectures required by users, simplicity and convenience of working with them, memory efficiency, and access speed to data and knowledge. In each case, one of the compromise solutions is used, often proposed many decades ago and widely used. The authors propose to change the existing compromises and move on to using new models for representing data and knowledge. It is important to understand that new models are proposed under the conditions of only a partially formed set of evaluation criteria, the lack of information and research on this topic, and in the absence of formalized rules and procedures for choosing a model. The purpose of the work is to expand the capabilities of data and knowledge storage systems to create a variety of flexible and complex data and knowledge architectures as well as to improve the efficiency of memory use. The article provides an overview of the main types of data and knowledge storage systems, showing their shortcomings. The method of organization based on the archigraph model for each type of system is proposed, allowing to eliminate the identified shortcomings. The proposed solutions can be used to create new file systems, database management systems, data warehouse management systems, data lake and knowledge lake management systems, management systems for Data Lakehouse, Data Space, Data Fabric, Data Mesh architectures, and blockchain platforms</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/9h4x-tm85-bd3e</doi>
          <udk>519.179:004.6</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>archigraph</keyword>
            <keyword>file system</keyword>
            <keyword>database management system</keyword>
            <keyword>data lake</keyword>
            <keyword>Data Lakehouse</keyword>
            <keyword>Data Space</keyword>
            <keyword>Data Fabric</keyword>
            <keyword>Data Mesh</keyword>
            <keyword>knowledge lake</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.10/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>140-151</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-3410-0678</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>National Research University of Electronic Technology</orgName>
              <surname>Gorbunov</surname>
              <initials>Vladimir</initials>
              <email>nbia@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0004-8999-0051</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>OA National Research Institute “Submicron”</orgName>
              <surname>Faizulina</surname>
              <initials>Alina</initials>
              <email>alya.fayzullina.03@bk.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Predictive analysis of information flows in information security systems of telecommunication complexes</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The key problems of information security are considered. The possibility of embedding protection in the system, the problems of network monitoring. The main security threats. The possibilities of information protection and their reliability are being investigated</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/dv1g-m6ep-zzm3</doi>
          <udk>004.056.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information</keyword>
            <keyword>information security</keyword>
            <keyword>information security</keyword>
            <keyword>telecommunication systems</keyword>
            <keyword>antivirus programs</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.11/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>152-161</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-0920-9009</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>The Ministry of Science and Education of the Republic of Azerbaijan</orgName>
              <surname>Pashayev</surname>
              <initials>Fahrad Heydar</initials>
              <email>pasha.farhad@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0008-9488-5503</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Nakhchivan State University</orgName>
              <surname>Pashayeva</surname>
              <initials>Sevinj Elman</initials>
              <email>sevincpasa5@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0009-0005-3533-3918</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>The Ministry of Science and Education of the Republic of Azerbaijan</orgName>
              <surname>Maqgsudova</surname>
              <initials>Nargiz Adalat</initials>
              <email>nargizmaqsudscb@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Optimization of the performance of the search information system in the legislative documents database</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">To formulate optimization tasks in the Electronic Policy Document Management System, an enterprise can be presented as a set of departments performing certain functions. At large enterprises there is a constant exchange between the individual departments of the enterprise, between the document databases of departments. The paper examines solutions to several document database-related problems. Here, first of all, we consider the problem of choosing a model capable of setting the relationship between the query execution time and the amounts of documents, grouping of policy documents according to their sources of creation and evaluation of the advantages that this grouping can offer. An experimental table showing the relationship between data size and query execution time is given to solve the problems set. The least squares method is used to select linear or hyperbolic models used in this table. The closeness of the model of this relationship to a linear dependence is used in evaluating the advantages of partitioning the database into natural groups. It is known that policy document databases store documents of local or international importance that are created and recommended for implementation by local or international organizations. To improve the work, the documents in the database can be grouped by the degree of their importance, by the date of entry into the system, by the organizations that created the document. The paper presents a method of grouping policy documents by the source of their creation. Some numerical characteristics indicating the advantages of this grouping are given</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/8gta-g6v5-k2hh</doi>
          <udk>004.77: 004.02</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>policy document database</keyword>
            <keyword>data source</keyword>
            <keyword>query time</keyword>
            <keyword>amount of information</keyword>
            <keyword>additional delays</keyword>
            <keyword>mean-square difference</keyword>
            <keyword>linear model</keyword>
            <keyword>hyperbolic model</keyword>
            <keyword>natural division</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.19.12/</furl>
          <file>2024_4-5-6.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
