<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">inform-107</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ЗАЩИТА ИНФОРМАЦИИ И НАДЕЖНОСТЬ СИСТЕМ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATION PROTECTION AND SYSTEM RELIABILITY</subject></subj-group></article-categories><title-group><article-title>О ТЕСТИРОВАНИИ ВЫХОДНЫХ ПОСЛЕДОВАТЕЛЬНОСТЕЙ КРИПТОГРАФИЧЕСКИХ ГЕНЕРАТОРОВ НА ОСНОВЕ ЦЕПЕЙ МАРКОВА УСЛОВНОГО ПОРЯДКА</article-title><trans-title-group xml:lang="en"><trans-title>ON TESTING OF CRYPTOGRAPHYC GENERATORS OUTPUT SEQUENCES USING MARKOV CHAINS OF CONDITIONAL ORDER</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мальцев</surname><given-names>М. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Maltsev</surname><given-names>M. V.</given-names></name></name-alternatives><email xlink:type="simple">maltsew@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Харин</surname><given-names>Ю. С,.</given-names></name><name name-style="western" xml:lang="en"><surname>Kharin</surname><given-names>Yu. S.</given-names></name></name-alternatives><email xlink:type="simple">kharin@bsu.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>НИИ прикладных проблем математики и информатики БГУ</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2013</year></pub-date><pub-date pub-type="epub"><day>01</day><month>10</month><year>2016</year></pub-date><volume>0</volume><issue>4</issue><fpage>104</fpage><lpage>111</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Мальцев М.В., Харин Ю.С., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Мальцев М.В., Харин Ю.С.</copyright-holder><copyright-holder xml:lang="en">Maltsev M.V., Kharin Y.S.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://inf.grid.by/jour/article/view/107">https://inf.grid.by/jour/article/view/107</self-uri><abstract><p>Рассматривается цепь Маркова условного порядка, используемая для статистического тес-тирования криптографических генераторов. Приводятся статистические оценки параметров, доказывается состоятельность оценки порядка цепи Маркова. Показываются результаты компьютерных экспериментов для модельных и реальных данных.</p></abstract><trans-abstract xml:lang="en"><p>The paper deals with the Markov chain of conditional order, which is used for statisticaltesting of cryptographic generators. Statistical estimations of model parameters are given. Consistency of the order estimator is proved. Results of computer experiments are presented.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Математические и компьютерные основы криптологии / Ю.С. Харин [и. др.]. – Минск : Новое знание, 2003. – 382 c.</mixed-citation><mixed-citation xml:lang="en">Математические и компьютерные основы криптологии / Ю.С. Харин [и. др.]. – Минск : Новое знание, 2003. – 382 c.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Максимов, Ю.И. О цепях Маркова, связанных с двоичными регистрами сдвига со случайными элементами / Ю.И. Максимов // Труды по дискретной математике. – 1997. – Т. 1. – С. 203–220.</mixed-citation><mixed-citation xml:lang="en">Максимов, Ю.И. О цепях Маркова, связанных с двоичными регистрами сдвига со случайными элементами / Ю.И. Максимов // Труды по дискретной математике. – 1997. – Т. 1. – С. 203–220.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Sepehrdad, P. Discovery and Exploitation of New Biases in RC4 / P. Sepehrdad, S. Vaudenay, M. Vuagnoux // Lecture Notes in Computer Science. – 2011. – Vol. 6544. – P. 74–91.</mixed-citation><mixed-citation xml:lang="en">Sepehrdad, P. Discovery and Exploitation of New Biases in RC4 / P. Sepehrdad, S. Vaudenay, M. Vuagnoux // Lecture Notes in Computer Science. – 2011. – Vol. 6544. – P. 74–91.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">A statistical test suite for random and pseudorandom number generators for cryptographic applications / A. Rukhin [et al.] // National Institute of Standards and Technology [Electronic resource]. – USA, 2010. – Mode of access : http://csrc.nist.gov/groups/ST/toolkit/rng/documents/SP800-22rev1a.pdf. – Date of access : 17.04.2013.</mixed-citation><mixed-citation xml:lang="en">A statistical test suite for random and pseudorandom number generators for cryptographic applications / A. Rukhin [et al.] // National Institute of Standards and Technology [Electronic resource]. – USA, 2010. – Mode of access : http://csrc.nist.gov/groups/ST/toolkit/rng/documents/SP800-22rev1a.pdf. – Date of access : 17.04.2013.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Marsaglia, G. The Marsaglia Random Number CDROM including the Diehard Battery of Tests of Randomness / G. Marsaglia [Electronic resource]. – Florida State University, 1995. – Mode of access : http://www.stat.fsu.edu/pub/diehard/. – Date of access : 01.06.2013.</mixed-citation><mixed-citation xml:lang="en">Marsaglia, G. The Marsaglia Random Number CDROM including the Diehard Battery of Tests of Randomness / G. Marsaglia [Electronic resource]. – Florida State University, 1995. – Mode of access : http://www.stat.fsu.edu/pub/diehard/. – Date of access : 01.06.2013.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Кнут, Д.Э. Искусство программирования: в 3 т. Т. 1: Получисленные методы /Д. Э. Кнут. – М. : Вильямc, 2007. – 832 с.</mixed-citation><mixed-citation xml:lang="en">Кнут, Д.Э. Искусство программирования: в 3 т. Т. 1: Получисленные методы /Д. Э. Кнут. – М. : Вильямc, 2007. – 832 с.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Doob, J.L. Stochastic processes / J.L. Doob. – N. Y. : Wiley, 1953. – 6</mixed-citation><mixed-citation xml:lang="en">Doob, J.L. Stochastic processes / J.L. Doob. – N. Y. : Wiley, 1953. – 6</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Харин, Ю.С. Цепь Маркова с частичными связями ЦМ(s, r) и статистические выводы о ее параметрах / Ю.С. Харин, А.И. Петлицкий // Дискретная математика. – 2007. – Т. 19, № 2. – C. 109–130.</mixed-citation><mixed-citation xml:lang="en">Харин, Ю.С. Цепь Маркова с частичными связями ЦМ(s, r) и статистические выводы о ее параметрах / Ю.С. Харин, А.И. Петлицкий // Дискретная математика. – 2007. – Т. 19, № 2. – C. 109–130.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Raftery, A.E. A model for high-order Markov chains / A.E. Raftery // J. Royal Statistical Society. – 1985. – Vol. B-47, № 3. – P. 528–539.</mixed-citation><mixed-citation xml:lang="en">Raftery, A.E. A model for high-order Markov chains / A.E. Raftery // J. Royal Statistical Society. – 1985. – Vol. B-47, № 3. – P. 528–539.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Харин, Ю.С. Статистическая проверка гипотез о параметрах цепи Маркова условного порядка / Ю.С. Харин, М.В. Мальцев // Весцi НАН Беларуси. Сер. фiз.-мат. навук. – 2012. – № 3. – С. 5–12.</mixed-citation><mixed-citation xml:lang="en">Харин, Ю.С. Статистическая проверка гипотез о параметрах цепи Маркова условного порядка / Ю.С. Харин, М.В. Мальцев // Весцi НАН Беларуси. Сер. фiз.-мат. навук. – 2012. – № 3. – С. 5–12.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Мальцев, М.В. Об асимптотических свойствах статистических оценок параметров цепи Маркова условного порядка / М.В. Мальцев, Ю.С. Харин // Весцi НАН Беларуси. Сер. фiз.- мат. навук. – 2013. – №1. – С. 5–12.</mixed-citation><mixed-citation xml:lang="en">Мальцев, М.В. Об асимптотических свойствах статистических оценок параметров цепи Маркова условного порядка / М.В. Мальцев, Ю.С. Харин // Весцi НАН Беларуси. Сер. фiз.- мат. навук. – 2013. – №1. – С. 5–12.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Csiszar, I. Consistency of the BIC order estimator / I. Csiszar, P. Shields // Electronic research announcments of the American mathematical society. – 1999. – Vol. 5. – P. 123–127.</mixed-citation><mixed-citation xml:lang="en">Csiszar, I. Consistency of the BIC order estimator / I. Csiszar, P. Shields // Electronic research announcments of the American mathematical society. – 1999. – Vol. 5. – P. 123–127.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Meier, W. The self-shrinking generator / W. Meier, O. Staffelbach // Advances in Cryptology – EUROCRYPT 94. – Springer-Verlag, 1995. – P. 205–214.</mixed-citation><mixed-citation xml:lang="en">Meier, W. The self-shrinking generator / W. Meier, O. Staffelbach // Advances in Cryptology – EUROCRYPT 94. – Springer-Verlag, 1995. – P. 205–214.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Основы криптографии / А.П. Алферов [и др.]. – М. : Гелиос АРВ, 2001. – 480 с.54 p.</mixed-citation><mixed-citation xml:lang="en">Основы криптографии / А.П. Алферов [и др.]. – М. : Гелиос АРВ, 2001. – 480 с.54 p.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
