<?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">radioelectronics</journal-id><journal-title-group><journal-title xml:lang="ru">Известия высших учебных заведений России. Радиоэлектроника</journal-title><trans-title-group xml:lang="en"><trans-title>Journal of the Russian Universities. Radioelectronics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1993-8985</issn><issn pub-type="epub">2658-4794</issn><publisher><publisher-name>Saint Petersburg Electrotechnical University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">radioelectronics-197</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>RADIO ELECTRONIC FACILITIES FOR SIGNAL TRANSMISSION, RECEPTION AND PROCESSING</subject></subj-group></article-categories><title-group><article-title>Алгоритм идентификации вида скремблирования бинарных данных</article-title><trans-title-group xml:lang="en"><trans-title>Linear Scrambler Identification</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>Krivonogov</surname><given-names>A. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистр техники и технологий по направлению "Радиотехника" (2010), ассистент</p><p>кафедра теоретических основ радиотехники</p><p>инженер</p><p>Научно-исследователь­ский институт радиотехники и телекоммуникаций</p><p>Автор трех научных публи­каций. Сфера научных интересов - цифровая связь.  </p></bio><bio xml:lang="en"><p>Master’s Degree in Radio Engineering (2010), Assistant Professor of the Department of Theoretical Bases of Radio Engineering</p><p>The author of 3 scientific publications. Area of expertise: digital communication. </p></bio><email xlink:type="simple">askr87@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>Krivonogova</surname><given-names>E. O.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистр по направлению "Радиотехника" (2016), научный сотруд­ник </p><p>Сфера научных интересов - цифровая связь.</p></bio><bio xml:lang="en"><p>Master’s Degree in Radio Engineering (2016 JSC Research and Engineering Center </p><p>Area of expertise: digital communication. </p></bio><email xlink:type="simple">askr87@mail.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Санкт-Петербургский государственный электротехнический университет "ЛЭТИ" им. В. И. Ульянова (Ленина)</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Saint Petersburg Electrotechnical University "LETI"</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>АО "Научно-инженерный центр электротехнического университета"</institution><country>Россия</country></aff><aff xml:lang="en"><institution>JSC "Research and Engineering Center of Electrotechnical University"</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2017</year></pub-date><pub-date pub-type="epub"><day>28</day><month>12</month><year>2017</year></pub-date><volume>0</volume><issue>6</issue><fpage>10</fpage><lpage>14</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Кривоногов А.С., Кривоногова Е.О., 2017</copyright-statement><copyright-year>2017</copyright-year><copyright-holder xml:lang="ru">Кривоногов А.С., Кривоногова Е.О.</copyright-holder><copyright-holder xml:lang="en">Krivonogov A.S., Krivonogova E.O.</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://re.eltech.ru/jour/article/view/197">https://re.eltech.ru/jour/article/view/197</self-uri><abstract><p>Рассмотрена задача определения вида скремблера, примененного на передающей стороне, на основании сигнала с его выхода. Задача такого рода является актуальной для систем радиомониторинга и при создании когнитивных систем приема и обработки цифрового сигнала. Известны технические решения, позволяющие идентифицировать структуры как аддитивного, так и мультипликативного скремблера [<xref ref-type="bibr" rid="cit1">1</xref>]-[<xref ref-type="bibr" rid="cit4">4</xref>]. Однако публикаций, в которых приводился бы алгоритм автоматического определе­ния вида скремблера, нет. Предлагаемая статья призвана частично восполнить этот пробел. Приведен алгоритм, обеспечивающий решение указанной задачи, и результаты его моделирования. </p></abstract><trans-abstract xml:lang="en"><p>The article describes algorithm that allows determining scrambler type based on the signal from its output. The task of this kind is relevant for radio monitoring systems and when creating cognitive systems for digital signal receiving and processing. The identification algorithm determines the form of the scrambler both multiplicative and additive. There are no published papers providing algorithm for automatic determination of scrambler type. This article is intended to partly fill the gap. It provides a form al statement of the problem, an identification algorithm and simulation results. </p></trans-abstract><kwd-group xml:lang="ru"><kwd>Скремблер</kwd><kwd>идентификация</kwd><kwd>радиомониторинг</kwd><kwd>псевдослучайная последовательность</kwd></kwd-group><kwd-group xml:lang="en"><kwd>Scrambler</kwd><kwd>Identification</kwd><kwd>Radiomonitoring</kwd><kwd>Pseudorandom Sequence</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Cluzeau M. Reconstruction of a Linear Scrambler // IEEE Trans. on Computers. 2007. Vol. 56, № 8. P. 1283-1291.</mixed-citation><mixed-citation xml:lang="en">Cluzeau M. Reconstruction of a Linear Scrambler. IEEE Trans. on Computers. 2007, vol. 56, no. 8, pp. 1283-1291.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Canteaut A., Filiol E. Ciphertext only Reconstruction of Stream Ciphers Based on Combination Generators. Berlin: Springer, 2001. 16 p.</mixed-citation><mixed-citation xml:lang="en">Canteaut A., Filiol E. Ciphertext only Reconstruction of Stream Ciphers Based on Combination Generators. Berlin, Springer, 2001, 16 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Johansson T., Jonsson F. Fast Correlation Attacks through Reconstruction of Linear Polynomials // Advances in Cryptology - CRYPTO 2000. 20th Ann. Int. Cryptology Conf. Santa Barbara, Aug. 20-24, 2000. Berlin: Springer, 2000. P. 300-315. (Lecture Notes in Computer Science 1807).</mixed-citation><mixed-citation xml:lang="en">Johansson T., Jonsson F. Fast Correlation Attacks through Reconstruction of Linear Polynomials. Advances in Cryptology - CRYPTO 2000. 20th Ann. Int. Cryptology Conf. Santa Barbara, August 20-24, 2000. Berlin, Springer, 2000, pp. 300-315. (Lecture Notes in Computer Science 1807).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Canteaut A., Trabbia M. Improved Fast Correlation Attacks using Parity-Check Equations of Weight 4 And 5. // Advances in Cryptology - EUROCRYPT 2000, Int. conf. on the Theory and Applications of Cryptographic Techniques. Bruges, Belgium, May 14-16 2000 / Ed. by B. Preneel. Berlin: Springer, 2000. P. 579-594. (Lecture Notes in Computer Science 1880).</mixed-citation><mixed-citation xml:lang="en">Canteaut A., Trabbia M. Improved Fast Correlation Attacks using Parity-Check Equations of Weight 4 And 5. Received October, 26, 2017 Advances in Cryptology - EUROCRYPT 2000, Int. conf. on the Theory and Applications of Cryptographic Techniques. Bruges, Belgium, May 14-16 2000. Ed. by B. Preneel. Berlin, Springer, 2000, pp. 579-594. (Lecture Notes in Computer Science 1880).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Скляр Б. Цифровая Связь. Теоретические основы и практическое применение: пер. с англ. 2-е изд. М .: Издательский дом "Вильямс", 2003. 1104 с.</mixed-citation><mixed-citation xml:lang="en">Sklar B. Digital Communications. Fundamentals and Applicstions. 2nd ed. 2001, Upper Saddle River, Pren-tice Hall PTR, 2001, 1079 p.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Лидл Р., Нидеррайтер Г. Конечные поля: в 2 т. Т. 2 / пер. с англ. М.: Мир, 1988. 822 с.</mixed-citation><mixed-citation xml:lang="en">Lidl R., Niederreiter H. Finite Fields. Cambridge University Press, 1985, 822 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>
