<?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-586</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></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-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Научно-исследовательский институт прикладных проблем математики и информатики</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2008</year></pub-date><pub-date pub-type="epub"><day>06</day><month>11</month><year>2018</year></pub-date><volume>0</volume><issue>3(19)</issue><fpage>112</fpage><lpage>124</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ярмола А.Н., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Ярмола А.Н.</copyright-holder><copyright-holder xml:lang="en">Ярмола А.Н.</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/586">https://inf.grid.by/jour/article/view/586</self-uri><abstract><p>Разрабатываются новые методы и алгоритмы статистического обнаружения ква-зипериодов в бинарных последовательностях. Исследуется состоятельность предложенных методов оценивания квазипериода, находятся оценки числа наблюдений, достаточного для эффективного использования разработанных алгоритмов. Представляются оценки вычислительной сложности алгоритмов  и результаты численных экспериментов.</p></abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Математические и компьютерные основы криптологии / Ю.С. Харин [и др.]. – Минск: Новое знание, 2003.</mixed-citation><mixed-citation xml:lang="en">Математические и компьютерные основы криптологии / Ю.С. Харин [и др.]. – Минск: Новое знание, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Zeng, K. On the Linear Syndrome Method in Cryptoanalysis / K. Zeng, M. Huang // Proc. of the Int. Cryptology Conf. on Advances in Cryptology. – Santa Barbara, USA, 1988. – P. 469–478.</mixed-citation><mixed-citation xml:lang="en">Zeng, K. On the Linear Syndrome Method in Cryptoanalysis / K. Zeng, M. Huang // Proc. of the Int. Cryptology Conf. on Advances in Cryptology. – Santa Barbara, USA, 1988. – P. 469–478.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Zeng, K. On the Linear Consistency Test (LCT) in Cryptanalysis with Applications /</mixed-citation><mixed-citation xml:lang="en">Zeng, K. On the Linear Consistency Test (LCT) in Cryptanalysis with Applications /</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">K. Zeng, C.-H. Yang, T.R.N. Rao // Proc. of the Int. Cryptology Conf. on Advances in Cryptol-ogy. – Santa Barbara, USA, 1989. – P. 164–174.</mixed-citation><mixed-citation xml:lang="en">K. Zeng, C.-H. Yang, T.R.N. Rao // Proc. of the Int. Cryptology Conf. on Advances in Cryptol-ogy. – Santa Barbara, USA, 1989. – P. 164–174.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Боровков, А.А. Теория вероятностей / А.А. Боровков. – М.: Наука, 1986.</mixed-citation><mixed-citation xml:lang="en">Боровков, А.А. Теория вероятностей / А.А. Боровков. – М.: Наука, 1986.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Marsaglia, G. The Marsaglia Random Number CDROM / G. Marsaglia. – Supercomputer Computations Research Institute and Department of Statistics, Florida State University, 1995.</mixed-citation><mixed-citation xml:lang="en">Marsaglia, G. The Marsaglia Random Number CDROM / G. Marsaglia. – Supercomputer Computations Research Institute and Department of Statistics, Florida State University, 1995.</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>
