<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sibsutis-301</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></article-categories><title-group><article-title>Новый метод внедрения скрытых сообщений в алфавитное меню</article-title><trans-title-group xml:lang="en"><trans-title>New method for secret message embedding in alphabetical menu</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>Nechta</surname><given-names>I. ..</given-names></name></name-alternatives><email xlink:type="simple">aspirant@sibsutis.ru</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>2018</year></pub-date><pub-date pub-type="epub"><day>24</day><month>10</month><year>2022</year></pub-date><volume>0</volume><issue>2</issue><fpage>64</fpage><lpage>70</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Нечта И.В., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Нечта И.В.</copyright-holder><copyright-holder xml:lang="en">Nechta I...</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://vestnik.sibsutis.ru/jour/article/view/301">https://vestnik.sibsutis.ru/jour/article/view/301</self-uri><abstract><p>В данной статье представлен новый метод стеганографии, позволяющий встраивать скрытые сообщения в алфавитное меню. Основная идея метода заключается в том, что предлагается модифицировать один из известных методов автоматического построения иерархического меню. Здесь модификация подразумевает изменение дерева меню путём переноса крайних элементов из одного подменю в другое в соответствии со скрываемым сообщением. В ходе экспериментального анализа было показано, что средняя высота дерева меню увеличивается менее чем на единицу. Данный метод внедрения может быть применен для встраивания цифровых отпечатков пальцев или водяных знаков в иерархию элементов, имеющих алфавитную сортировку.</p></abstract><trans-abstract xml:lang="en"><p>In this article, we present a new method of steganography which allows you to embed hidden messages in the alphabetical menu. The main idea of this method consists in modification earlier known methods of automatic construction of a hierarchical menu. Here the modification implies changing the menu tree by transferring boundary elements from one submenu to another one in accordance with the hidden message. In the course of the experimental analysis it was shown that the average height of the menu tree increased by less than one. This steganography method can be used for embedding digital fingerprints or watermarks in the hierarchy of items having an alphabetical order.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>стеганография</kwd><kwd>алфавитное меню</kwd><kwd>стеганография в интерфейсах</kwd></kwd-group><kwd-group xml:lang="en"><kwd>steganography</kwd><kwd>alphabetical menu</kwd><kwd>steganography in interfaces</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">Kerckhoffs A. La cryptographie militaire // Journal des sciences militaires. 1893. V. 9. P. 5-83.</mixed-citation><mixed-citation xml:lang="en">Kerckhoffs A. La cryptographie militaire // Journal des sciences militaires. 1893. V. 9. P. 5-83.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Qin J., Xiang X., Wang M. A Review on Detection of LSB Matching Steganography // Information Technology Journal. 2010. V. 9. P. 1725-1738.</mixed-citation><mixed-citation xml:lang="en">Qin J., Xiang X., Wang M. A Review on Detection of LSB Matching Steganography // Information Technology Journal. 2010. V. 9. P. 1725-1738.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Nechta I., Fionov A. Applying stat methods to text steganography // Applied Methods of Statistical Analysis. Simulations and Statistical Inference. NSTU. 20-22 September 2011. P. 278-284.</mixed-citation><mixed-citation xml:lang="en">Nechta I., Fionov A. Applying stat methods to text steganography // Applied Methods of Statistical Analysis. Simulations and Statistical Inference. NSTU. 20-22 September 2011. P. 278-284.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Hamilton J., Danicic S. A survey of static software watermarking // IEEE World Congress on Internet Security (WorldCIS). 2011. P. 100-107.</mixed-citation><mixed-citation xml:lang="en">Hamilton J., Danicic S. A survey of static software watermarking // IEEE World Congress on Internet Security (WorldCIS). 2011. P. 100-107.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Schaathun H. G. On watermarking/fingerprinting for copyright protection // IEEE First International Conference on Innovative Computing, Information and Control. 2006. V. 3. P. 50-53.</mixed-citation><mixed-citation xml:lang="en">Schaathun H. G. On watermarking/fingerprinting for copyright protection // IEEE First International Conference on Innovative Computing, Information and Control. 2006. V. 3. P. 50-53.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Nechta I. Steganography in Social Networks // IEEE Siberian Symposium on Data Science and Engineering (SSDSE), Technopark of Novosibirsk Akademgorodok, Russia. 12-13 Apr. 2017. P. 33-35.</mixed-citation><mixed-citation xml:lang="en">Nechta I. Steganography in Social Networks // IEEE Siberian Symposium on Data Science and Engineering (SSDSE), Technopark of Novosibirsk Akademgorodok, Russia. 12-13 Apr. 2017. P. 33-35.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Нечта И. В. Алгоритм построения алфавитного меню полиномиальной сложности // Вестник СибГУТИ. 2017. № 1. С. 90-95.</mixed-citation><mixed-citation xml:lang="en">Нечта И. В. Алгоритм построения алфавитного меню полиномиальной сложности // Вестник СибГУТИ. 2017. № 1. С. 90-95.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Нечта И. В., Рябко Б. Я., Савина H. Н. Применение алфавитного кодирования для оптимизации интерфейса // Вычислительные технологии. 2015. Т. 20, № 5. С. 97-104.</mixed-citation><mixed-citation xml:lang="en">Нечта И. В., Рябко Б. Я., Савина H. Н. Применение алфавитного кодирования для оптимизации интерфейса // Вычислительные технологии. 2015. Т. 20, № 5. С. 97-104.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Нечта И. В. Построение меню при помощи алфавитного кода // Вестник СибГУТИ. 2015. № 4. С. 40-46.</mixed-citation><mixed-citation xml:lang="en">Нечта И. В. Построение меню при помощи алфавитного кода // Вестник СибГУТИ. 2015. № 4. С. 40-46.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Рябко Б. Я., Фионов А. Н. Криптографические методы защиты информации: учебное пособие для вузов. М.: Горячая линия - Телеком, 2012. 229 с.</mixed-citation><mixed-citation xml:lang="en">Рябко Б. Я., Фионов А. Н. Криптографические методы защиты информации: учебное пособие для вузов. М.: Горячая линия - Телеком, 2012. 229 с.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Zaphiris P. G. Depth vs Breath in the Arrangement of Web Links // Proceedings of the Human Factors and Ergonomics Society Annual Meeting. SAGE Publications, 2000. V. 44, № 4. P. 453-456.</mixed-citation><mixed-citation xml:lang="en">Zaphiris P. G. Depth vs Breath in the Arrangement of Web Links // Proceedings of the Human Factors and Ergonomics Society Annual Meeting. SAGE Publications, 2000. V. 44, № 4. P. 453-456.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Hick W E. On the rate of gain of information // Quarterly Journal of Experimental Psychology. 1952. V. 4. P. 11-26.</mixed-citation><mixed-citation xml:lang="en">Hick W E. On the rate of gain of information // Quarterly Journal of Experimental Psychology. 1952. V. 4. P. 11-26.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Fitts P. M. The information capacity of the human motor system in controlling the amplitude of movement // Journal of Experimental Psychology. 1954. V. 47 (6). P. 381-391.</mixed-citation><mixed-citation xml:lang="en">Fitts P. M. The information capacity of the human motor system in controlling the amplitude of movement // Journal of Experimental Psychology. 1954. V. 47 (6). P. 381-391.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Witten I. H., Cleary J. G., Greenberg S. On frequency-based menu-splitting algorithms // International Journal of Man-Machine Studies. 1984. V. 21, № 2. P. 135-148.</mixed-citation><mixed-citation xml:lang="en">Witten I. H., Cleary J. G., Greenberg S. On frequency-based menu-splitting algorithms // International Journal of Man-Machine Studies. 1984. V. 21, № 2. P. 135-148.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Newman M. E. J. Power laws, Pareto distributions and Zipfs law // Contemporary physics. 2005. V. 46, № 5. P. 323-351.</mixed-citation><mixed-citation xml:lang="en">Newman M. E. J. Power laws, Pareto distributions and Zipfs law // Contemporary physics. 2005. V. 46, № 5. P. 323-351.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Winstein K. Tyrannosaurus lex 1999. [Электронный ресурс]. URL: http://web.mit.edu/keithw/tlex/ (дата обращения: 22.10.2017).</mixed-citation><mixed-citation xml:lang="en">Winstein K. Tyrannosaurus lex 1999. [Электронный ресурс]. URL: http://web.mit.edu/keithw/tlex/ (дата обращения: 22.10.2017).</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>
