<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Diceware Password Generation Algorithm Modification based on Pseudo-Random Sequences</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Serhii Buchyk</string-name>
          <email>buchyk@knu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nataliia Lukova-Chuiko</string-name>
          <email>lukova@ukr.net</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serhii Toliupa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vitalii Piatyhor</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksandr Buchyk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Taras Shevchenko National University of Kyiv</institution>
          ,
          <addr-line>24 Bohdan Hawrylyshyn str., Kyiv, 04116</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>167</fpage>
      <lpage>176</lpage>
      <abstract>
        <p>The authors investigated main algorithms for generating passwords that exist in the market and analysed their advantages and disadvantages. The complexity of the generated passwords was estimated based on the finite entropy and the complexity of memorization. The international requirements for password generation, provided in the NIST.SP.800-63b standard and the compliance of the received passwords with the requirements given in the document, were considered. The resistance of the password to brute force attacks and dictionary attacks was also evaluated. A software application has been developed that implements password generators using a modified Diceware password generation algorithm based on a given length and a given set of words and estimates the entropy of generated passwords. The list of words is written in a file. The English dictionary is used by default. The main goal of this program is to generate a set of passwords. The program can work autonomously without a network connection. A modified algorithm for generating Diceware passwords is recommended to use instead of the original one due to the higher entropy of the former.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Password authentication</kwd>
        <kwd>password</kwd>
        <kwd>password generation</kwd>
        <kwd>diceware</kwd>
        <kwd>entropy</kwd>
        <kwd>password strength estimation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Nowadays, a lot of attention is given to the issue of protecting information from unauthorized access.
One of the security services that provides such protection is the authentication service. Currently, each
system uses some type of user authentication, most often – password based.</p>
      <p>However, without sufficient attention to user-generated passwords, such a system is quite vulnerable
to hacker attacks. Users of the system often create easily crackable passwords, such as passw0rd, admin,
etc. which can be guessed in a few seconds. Therefore, to improve the resilience of passwords to
cracking, password generators are used based on random or pseudo-random number sequence
generators, which can provide users with a complex password, that will be used in the system to verify
the identity of the user.</p>
      <p>
        Without the use of software, the system may impose additional restrictions to the length, characters
and content of the password, but studies [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] show that imposing too complex rules on the password
significantly increases the chance of users forgetting or entering the wrong password. The same arises
when using the passwords that have been generated by password generation algorithms that focus on the
complexity and use of all characters in a random sequence rather than on the user ability to memorize it.
      </p>
      <p>Therefore, to improve the complexity of the password and make it easier to remember at the same
time, it is recommended to use the Diceware random password generation algorithm. Otherwise, it is
recommended to use a centralized keystore, where user passwords will be stored.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Task Formulation</title>
      <p>The aim of the study is the modification of the Diceware password generation algorithm based on
pseudo-random sequences.</p>
      <p>The object of research is the process of generating passwords based on pseudo-random sequences.</p>
      <p>The subject of research is algorithms for generating passwords based on pseudo-random sequences,
the complexity of the passwords generated by them.</p>
      <p>Thus, the task is to improve the algorithm for generating Diceware passwords based on
pseudorandom sequences, which will make the algorithm more resistant to attacks than the standard
implementation and increase the entropy value per character.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Solving the Task</title>
      <sec id="sec-3-1">
        <title>Let's define some basic terms used in the article.</title>
        <p>A pseudo-random sequence is a sequence of numbers that has been computed according to a certain
arithmetic rule, but has all the properties of a random sequence of numbers within the boundaries of the
problem to be solved. Although the pseudo-random sequence at first glance has no consistent pattern,
but any pseudo-random generator with a finite number of internal states will be repeated after a very
long sequence of numbers. This can be proved by the Dirichlet’s principle.</p>
        <p>The generation of random numbers that no observer can ever predict requires a causal-indeterminate
process where events are not completely determined by previous states. Due to the physical inability to
obtain sufficient information to predict the outcome of such an event, its results are guaranteed to be
random for all.</p>
        <p>A random password generator is a software or hardware device that receives data from a random or
pseudo-random number generator and automatically generates a password. Random passwords can be
generated manually using simple randomness sources such as dice or coins, or they can be generated
using a computer.</p>
        <p>Although there are many examples of “random” password generator programs available on the
Internet, generating random cases can be difficult, and many programs do not generate random
characters in a way that provides high security. A common recommendation is to use open source
security tools where possible, as they allow you to independently check the quality of the methods used.</p>
        <p>It should be noted that simply generating a password at random is not a guarantee that the password
is secure, as it is possible, though very unlikely, that the generated password will be easily cracked.</p>
        <p>Random password generators usually output a string of characters of a given length. These can be
individual characters from a character set or words from a word list to form a passphrase. You can
configure the program so that the generated password follow the local password policy, for example,
always creating a mixture of letters, numbers and special characters. Such policies tend to slightly
reduce the strength of the password, the formula for which is calculated below, because the characters
are no longer created independently.</p>
        <p>The strength of a random password against a specific attack (brute force attack) can be calculated
by calculating the information entropy of the random process that generated the password. If each
character in the password is generated independently and with uniform probability, the entropy in bits
is given by the following formula.</p>
        <p>H  L log2 N  L
logN
log 2 ,
(1)
where N is the number of possible characters and L is the number of characters in the password.</p>
        <p>For comparison, a mechanical 72-character password generation algorithm, an algorithm using
AES-256 PBKDF2-SHA256, a standard Diceware implementation, and a own modification of the latest
were selected.</p>
        <p>
          The mechanical generator is implemented using the ANSI X9.17 pseudo-random number generator
and uses 72 characters, which include lowercase and uppercase English letters, numbers and some
characters. Generation is performed by obtaining three pseudo-random numbers using a generator,
which are used as indices in a three-dimensional array to access the desired character. The operation is
repeated until the desired password length is reached [
          <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
          ].
        </p>
        <p>
          As an example of a commercial product for generating passwords, an algorithm that uses AES-256
PBKDF2-SHA256 was chosen, which was provided by the software application LastPass [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. This
application is commercial, thus the entire implementation of this generator is closed, so the information
about the generation tools was taken from the product description and documentation.
        </p>
        <p>
          Diceware is a method of creating password phrases, passwords and other cryptographic variables,
using ordinary dice as a hardware generator of random numbers [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Each word in the passphrase
requires five dice rolls. The resulting numbers 1 to 6 are added as a five-digit number, such as 43146.
This number is then used to search for a word in the word list. By generating several words sequentially,
you can build a long, easy-to-remember, and easy-to-choose password.
        </p>
        <p>Arnold Reinhold, the inventor of the algorithm recommends using only the tools of “true”
randomness and not to use tools for programmatic generation of passwords in this way because of the
use of pseudo-randomness in such programs, in other words there is always a repeatable pattern.
However, with the use of modern means of generating pseudo-random numbers, such dependencies are
very difficult to trace.</p>
        <p>Modification of this algorithm involves generating a password not only by choosing words, but also
by randomly changing a capital letter in each word and replacing the letters with some numbers, such
as the letter “o” by 0. More details will be given below.</p>
        <p>
          In Ukraine, there is no legal framework that would regulate the requirements for the passwords used,
because of this as the indicator of a good password the requirements of the standard NIST.SP.800-63b
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], which regulates the properties that a certified password must have, will be used.
        </p>
        <p>There is the section in this document designed for passwords that are to be remembered. The
following requirements are put towards them:
 Length from 8 to 64 characters.
 All ASCII and UNICODE characters must be present.
 For generated passwords approved random bit generators specified in the regulatory document</p>
        <p>
          NIST.SP.800-90Ar1 [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] must be used.
 Passwords should not be previously compromised, in the database of light passwords, depend on
the context and have repetitive characters, as well as use words from the dictionary.
        </p>
        <p>The flowchart of the modified Diceware password generation algorithm based on pseudo-random
sequences is presented in Fig. 1.</p>
        <p>To show the results of the modified algorithm, a software application was developed that
implements this algorithm, as well as calculates the entropy and entropy per symbol for the generated
password. The application has the ability to set a custom password length from 3 to 20 characters, add
a custom word list and select a password generation algorithm. The right half of the application displays
the result of the program, namely 5 generated passwords, from which file the words for generating the
Diceware password were read, the entropy value and the entropy value per character for the generated
passwords. The interface of the software application is shown in Fig. 2.</p>
        <p>The application implements two ways to generate a password: a modified Diceware and a
mechanical one. The mechanical algorithm for generating a password is based on the principle of
generating three random values: two of them have values from 0 to 5 and one value from 0 to 1. The
alphabet used has the form of two tables of 36 characters. The first 36 characters include lowercase
Latin characters and Arabic numerals 0 to 9. The rest are uppercase Latin characters and special
characters. Values from 0 to 1 determine which of the two alphabets to use to search for a character,
the other two values determine the index of the character in the symbol table. The process is repeated
until the desired set password length is reached. The result of the application in this mode is shown in
Fig. 3.</p>
        <p>The initial stage of the modified Diceware algorithm consists of reading a set of words from a file,
by default - an English dictionary. The next step is word generation. First, a number from 0 to 7775 is
generated, a word is selected from a set of words, the index of which corresponds to the generated
number. A number from 0 to 1 is then generated, which determines whether the word will have a capital
letter or not. The next step is to search for the remaining characters. If the symbol is “o”, “i” or “l”, then
a number will be generated between 0 and 1, which determines whether the symbol will be replaced by
“0”, “1” or “7” respectively, or not. The process is repeated until the desired password length is reached.
In this case, the length of the password is determined not by the number of characters, but by the number
of words generated in the resulted password. The final step is to combine the resulting words into a
single one, with the words separated by a hyphen. An example of generated passwords is given in
Fig. 4.</p>
        <p>Users are given the opportunity to choose their own set of words to generate passwords. The file
requirements are as follows:
 The file should have only one set of index and word per term.
 Word index and word must be separated by a tab character.</p>
        <p> File encoding must be UTF-8.</p>
        <p>The password generation process is the same for word sets with Latin characters as for a standard
set of words. In the case of Cyrillic, only the capital letter and the symbol “o” are replaced. Depending
on the selected set of words, both the entropy and the entropy per symbol change. This is due to the
difference in the number of characters that can be replaced in different sets of words.</p>
        <p>The ANSI X9.17 generator, which is adopted as the Federal Standard for Information Processing in
the United States, is used as a pseudo-random number generator. The generation process consists of 4
steps:
1. Get the current time with the maximum possible accuracy.</p>
        <p>2. Calculate the temporary value by encrypting the current date with the Triple DES encryption
algorithm.</p>
        <p>3. Calculate the result of the exclusive “or” between the temporary value and the random initial
value. The result is encrypted using the Triple DES algorithm and is the resulting random value.</p>
        <p>4. Calculate the result of the exclusive “or” between the obtained random value and the temporary
value calculated in step 2. The result is encrypted using the Triple DES algorithm and replaces the value
of the random initial value.</p>
        <p>In the implemented case, at the end of the generation, the module is taken from the original random
number.</p>
        <p>Determining password complexity in a software application is determined by entropy and character
entropy. Formulas 1 and 2, respectively, are used to calculate them.</p>
        <p>H symbol </p>
        <p>H
L
(2)
where H is the total entropy, L is the number of characters in the password.</p>
        <p>The results of the analysis of entropy and entropy per symbol for passwords generated by each
algorithm are given in Table 1.</p>
        <p>The results show that using the modified Diceware algorithm, the entropy per symbol is 1.4 bits
higher than the standard algorithm.</p>
        <p>
          According to RFC 4086 [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], it is recommended to use keys with an entropy value starting from 29
bits for online attacks to 96 bits for cryptographic keys. As of the end of 2011, distributed.net estimated
the time required to crack a 72-bit password as 124.8 years. Currently, it is recommended to use
passwords with an entropy of at least 80 bits. Following this, for the password generated by the above
algorithms to implement the recommendation it must be a length of 13, 13, 7 and 6 characters or words,
respectively [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
        </p>
        <p>Fig. 5 shows the comparison of the entropy of the generated passwords depending on the algorithm
and length.</p>
        <p>250
200</p>
        <p>Number of symbols
Mechanical algorithm
AES-256 PBKDF2-SHA256
Diceware</p>
        <p>To evaluate the memorability of passwords, in Table 2 five variants of generated passwords are
presented as examples.</p>
        <p>As you can see, the standard Diceware algorithm is the easiest to read and remember. Non-Diceware
based algorithms are too difficult to remember, so it's best to use them with a password manager.</p>
        <p>Although a modified Diceware is more difficult to remember than a standard implementation, it is
not as complex as, for example, non-Diceware based ones.</p>
        <p>
          The results show that increasing entropy has made it more difficult to read and remember a
password, although it can still be remembered by the average user. It should be noted that this
assessment is subjective [
          <xref ref-type="bibr" rid="ref11 ref12 ref13">11–14</xref>
          ].
        </p>
        <p>In the Table 3 shows the matrix of compliance of password generation algorithms to the
NIST SP 800-63b standard. Only those criterias that depend on the progress of the program or
algorithm, and not those that provide, for example, pre-verification of compromised passwords were
selected. Such actions can be easily added to the algorithm, but are not required for now.</p>
        <sec id="sec-3-1-1">
          <title>Password generation algorithms compliance with NIST SP 800-63b standard</title>
        </sec>
        <sec id="sec-3-1-2">
          <title>Criteria</title>
        </sec>
        <sec id="sec-3-1-3">
          <title>Length</title>
        </sec>
        <sec id="sec-3-1-4">
          <title>All ASCII and</title>
        </sec>
        <sec id="sec-3-1-5">
          <title>UNICODE symbols</title>
        </sec>
        <sec id="sec-3-1-6">
          <title>Repeatable</title>
          <p>words/symbols</p>
        </sec>
        <sec id="sec-3-1-7">
          <title>Dictionary words</title>
        </sec>
        <sec id="sec-3-1-8">
          <title>Mechanical + 72 –</title>
        </sec>
        <sec id="sec-3-1-9">
          <title>Possible</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>As you can see, none of the algorithms meet NIST standards.</title>
        <sec id="sec-3-2-1">
          <title>Algorithm</title>
        </sec>
        <sec id="sec-3-2-2">
          <title>AES-256 PBKDF2SHA256 + 96</title>
          <p>–</p>
        </sec>
        <sec id="sec-3-2-3">
          <title>Possible</title>
        </sec>
        <sec id="sec-3-2-4">
          <title>Diceware + 70 +</title>
        </sec>
        <sec id="sec-3-2-5">
          <title>Possible</title>
        </sec>
        <sec id="sec-3-2-6">
          <title>Possible</title>
        </sec>
        <sec id="sec-3-2-7">
          <title>Diceware modification + 96</title>
          <p>+</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions</title>
      <p>In this paper, a modification of the Diceware password generation algorithm based on a
pseudorandom number generator was presented and it was compared with existing algorithms. As can be seen
from the results of the analysis, this modification of the algorithm is more resistant to attacks than the
standard implementation and has a character entropy of 1.4 bits higher, but there is a drawback—
increasing the difficulty of remembering this password.</p>
      <p>Also in this work, for the sake of demonstration, a software application was developed that
implements the above-mentioned modification of the algorithm and a mechanical algorithm for
password generation, as well as calculates the complexity of the password based on entropy.</p>
      <p>In conclusion, the use of this modification of the algorithm is simpler than the use of 12–16-character
not Diceware-based algorithms generated passwords, due to the ease of memorization and provides a
greater level of password protection against “brute force” attacks. Therefore, in the case of memorized
passwords and the absence of a password manager, the use of this modification is desirable.</p>
      <p>However, it is not recommended to use this algorithm to generate the password alone. The best
solution is to combine the password with another authentication method, i.e. to introduce multifactor
authentication.</p>
    </sec>
    <sec id="sec-5">
      <title>5. References</title>
      <p>[14] Astapenya, V., et al., Analysis of Ways and Methods of Increasing the Availability of Information
in Distributed Information Systems. In 2021 IEEE 8th International Conference on Problems of
Infocommunications, Science and Technology (PICST), 2021. IEEE.
https://doi.org/10.1109/picst54195.2021.9772161</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.-Y.</given-names>
            <surname>Choong</surname>
          </string-name>
          , Password Usability,
          <year>2015</year>
          . https://csrc.nist.gov/CSRC/media/Presentations/ Password-Usability/images-media/oct23_choong_password.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Komanduri</surname>
          </string-name>
          , et al.,
          <source>Of Passwords and People: Measuring the Effect of Password-Composition Policies: ACM.D.4.6; ACM.H.1</source>
          .2 / Saranga Komanduri, Richard Shay, Patrick Gage Kelley, Michelle L. Mazurek, Lujo Bauer, Nicolas Christin, Lorrie Faith Cranor,
          <string-name>
            <given-names>Serge</given-names>
            <surname>Egelman</surname>
          </string-name>
          . Vancouver, BC, Canada,
          <year>2011</year>
          : https://www.andrew.cmu.edu/user/nicolasc/publications/ KSKMBCCE-CHI11.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>V.</given-names>
            <surname>Buriachok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <article-title>Security rating metrics for distributed wireless systems</article-title>
          ,
          <source>in: Workshop of the 8th International Conference on Mathematics. Information Technologies. Educatio (MoMLeT)</source>
          , vol.
          <volume>2386</volume>
          ,
          <fpage>222</fpage>
          -
          <lpage>233</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>I.</given-names>
            <surname>Bogachuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Buriachok</surname>
          </string-name>
          ,
          <article-title>Monitoring subsystem for wireless systems based on miniature spectrum analyzers</article-title>
          , in: 2018
          <source>International Scientific-Practical Conference Problems of Infocommunications. Science and Technology</source>
          ,
          <year>2018</year>
          . https://doi.org/10.1109/infocommst.
          <year>2018</year>
          .
          <volume>8632151</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>LastPass</surname>
          </string-name>
          <article-title>Password generator</article-title>
          . https://www.lastpass.com/ru/password-generator.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>The</given-names>
            <surname>Diceware Passphrase Home Page</surname>
          </string-name>
          . http://world.std.com/~reinhold/diceware.html.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Grassi</surname>
          </string-name>
          , et al.,
          <source>Digital Identity Guidelines Authentication and Lifecycle Management</source>
          ,
          <year>2017</year>
          . https://pages.nist.
          <source>gov/800-63-3/sp800-63b.html#memsecret.</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E. B.</given-names>
            <surname>Barker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Kelsey</surname>
          </string-name>
          ,
          <source>Recommendation for Random Number Generation Using Deterministic Random Bit Generators</source>
          ,
          <year>2015</year>
          . https://www.nist.gov/publications/recommendation
          <article-title>-randomnumber-generation-using-deterministic-random-bit-generators-2.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Eastlake</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schiller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Crocker</surname>
          </string-name>
          .
          <source>Randomness Requirements for Security</source>
          ,
          <year>2005</year>
          . https://www.semanticscholar.org/paper/Randomness-Requirements
          <string-name>
            <surname>-</surname>
          </string-name>
          for-Security-EastlakeSchiller/
          <year>c1a69463e79ebcfaf3ab4258b607894a5b335ede</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Password</given-names>
            <surname>Checker</surname>
          </string-name>
          <article-title>Online</article-title>
          . http://password-checker.
          <article-title>online-domain-tools</article-title>
          .com.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Kipchuk</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , et al.
          <source>Investigation of Availability of Wireless Access Points based on Embedded Systems</source>
          .
          <source>2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PICS&amp;T)</source>
          ,
          <year>2019</year>
          . https://doi.org/10.1109/ picst47496.
          <year>2019</year>
          .9061551
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Shevchenko</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          , et al.,
          <source>Information security risk analysis SWOT, in: Workshop on Cybersecurity Providing in Information and Telecommunication Systems, CPITS</source>
          , vol.
          <volume>2923</volume>
          ,
          <fpage>309</fpage>
          -
          <lpage>317</lpage>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Kipchuk</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , et al.,
          <article-title>Assessing Approaches of IT Infrastructure Audit</article-title>
          .
          <source>In 2021 IEEE 8th International Conference on Problems of Infocommunications, Science and Technology, PICST</source>
          ,
          <year>2021</year>
          . https://doi.org/10.1109/picst54195.
          <year>2021</year>
          .9772181
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>