<?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-620</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>Construction of Stegosystem on the Basis of Raster Images Using Least-Significant Bits Statistics</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>Eltysheva</surname><given-names>E. Yu.</given-names></name></name-alternatives><email xlink:type="simple">katya@1nsk.ru</email></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Фионов</surname><given-names>А.</given-names></name></name-alternatives><email xlink:type="simple">fionov@sibsutis.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Сибирский государственный университет телекоммуникаций и информатики</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2009</year></pub-date><pub-date pub-type="epub"><day>16</day><month>01</month><year>2023</year></pub-date><volume>0</volume><issue>1</issue><fpage>67</fpage><lpage>84</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Елтышева Е.Ю., Фионов А., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Елтышева Е.Ю., Фионов А.</copyright-holder><copyright-holder xml:lang="en">Eltysheva E.Y., Фионов А.</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/620">https://vestnik.sibsutis.ru/jour/article/view/620</self-uri><abstract><p>Предлагается метод сокрытия информации в младших битах растрового изображения, записанного файлах формата BMP, PNG и др., использующих неискажающие методы сжатия.  В отличие от известных аналогов, предлагаемый метод кодирует внедряемое сообщение в соответствии с оценками вероятностей появления значений 0 и 1 в младших битах с целью минимального искажения статистики, свойственной "пустому" файлу-контейнеру.  Проводится универсальный и специфический стегоанализ разработанного алгоритма.  Показано преимущество предложенного метода по стойкости по сравнению с известными аналогами.</p></abstract><trans-abstract xml:lang="en"><p>A method of data hiding in least-significant bits of raster images, represented as files in BMP, PNG and other formats which employ lossless data compression.  In contrast to known analogs, the suggested method encodes embedded data according to least-significant bit probability estimates in order to preserve initial statistics of a container file as much as possible.  Universal and specific steganalysis of the algorithm developed is carried out.  An advantage of the suggested method over known analogs is demonstrated.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>стеганография</kwd><kwd>стегоанализ</kwd><kwd>статистическая модель</kwd><kwd>арифметическое кодирование</kwd><kwd>идеальные стегосистемы</kwd></kwd-group><kwd-group xml:lang="en"><kwd>LSB-методы</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">Ryabko B., Monarev V. Using information theory approach to randomness testing // Journal of Statistical Planning and Inference. 2005. V. 133, N. 1. P. 95-110.</mixed-citation><mixed-citation xml:lang="en">Ryabko B., Monarev V. Using information theory approach to randomness testing // Journal of Statistical Planning and Inference. 2005. V. 133, N. 1. P. 95-110.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Ryabko B., Monarev V. Experimental investigation of forecasting methods based on data compression algorithms // Problems of Information Transmission. 2005. V. 41, N. 1. P. 65-69 (in Russian: P. 74-78).</mixed-citation><mixed-citation xml:lang="en">Ryabko B., Monarev V. Experimental investigation of forecasting methods based on data compression algorithms // Problems of Information Transmission. 2005. V. 41, N. 1. P. 65-69 (in Russian: P. 74-78).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Ryabko B., Astola J. Universal codes as a basis for time series testing // Statistical Methodology. 2006. V. 3. P. 375-397.</mixed-citation><mixed-citation xml:lang="en">Ryabko B., Astola J. Universal codes as a basis for time series testing // Statistical Methodology. 2006. V. 3. P. 375-397.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Ryabko B, Astola J. Universal codes as a basis for nonparametric testing of serial independence for time series // Journal of Statistical Planning and Inference. 2006. V. 136, N. 12. P. 4119-4128.</mixed-citation><mixed-citation xml:lang="en">Ryabko B, Astola J. Universal codes as a basis for nonparametric testing of serial independence for time series // Journal of Statistical Planning and Inference. 2006. V. 136, N. 12. P. 4119-4128.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Ryabko B. Compression-based methods for nonparametric density estimation, on-line prediction, regression and classification for time series // 2008 IEEE Information Theory Workshop. Porto, Portugal, May 5-9, 2008.</mixed-citation><mixed-citation xml:lang="en">Ryabko B. Compression-based methods for nonparametric density estimation, on-line prediction, regression and classification for time series // 2008 IEEE Information Theory Workshop. Porto, Portugal, May 5-9, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Жилкин М. Ю. Стегоанализ графических данных на основе методов сжатия // Вестник СибГУТИ. 2008. № 2. С. 62-66.</mixed-citation><mixed-citation xml:lang="en">Жилкин М. Ю. Стегоанализ графических данных на основе методов сжатия // Вестник СибГУТИ. 2008. № 2. С. 62-66.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Cachin С. An information-theoretic model of steganography // Lecture Notes in Computer Science (Proc. 2nd Information Hiding Workshop). Springer Verlag, 1998. V. 1525. P. 306-318.</mixed-citation><mixed-citation xml:lang="en">Cachin С. An information-theoretic model of steganography // Lecture Notes in Computer Science (Proc. 2nd Information Hiding Workshop). Springer Verlag, 1998. V. 1525. P. 306-318.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Ryabko B., Ryabko D. Information-theoretic approach to steganographic systems // IEEE International Symposium on Information Theory. Nice, France, 2007. P. 2461-2464.</mixed-citation><mixed-citation xml:lang="en">Ryabko B., Ryabko D. Information-theoretic approach to steganographic systems // IEEE International Symposium on Information Theory. Nice, France, 2007. P. 2461-2464.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Fionov A., Ryabko B. Simple ideal steganographic systems for containers with known statistics // XI International Symposium on Problems of Redundancy. St.-Petersburg, July 2-6, 2007. P. 184-188.</mixed-citation><mixed-citation xml:lang="en">Fionov A., Ryabko B. Simple ideal steganographic systems for containers with known statistics // XI International Symposium on Problems of Redundancy. St.-Petersburg, July 2-6, 2007. P. 184-188.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Рябко Б.Я., Фионов А.Н. Алгоритмы кодирования для идеальных стеганографических систем // Вестник НГУ, серия: Информационные технологии. 2008. № 2. С. 88-93.</mixed-citation><mixed-citation xml:lang="en">Рябко Б.Я., Фионов А.Н. Алгоритмы кодирования для идеальных стеганографических систем // Вестник НГУ, серия: Информационные технологии. 2008. № 2. С. 88-93.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Hoshi M., Han T. S. Interval algorithm for homophonic coding // IEEE Transactions on Information Theory. 2001. V. 47. P. 1021-1031.</mixed-citation><mixed-citation xml:lang="en">Hoshi M., Han T. S. Interval algorithm for homophonic coding // IEEE Transactions on Information Theory. 2001. V. 47. P. 1021-1031.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Рябко Б. Я., Фионов А. Н. Эффективный метод адаптивного арифметического кодирования для источников с большими алфавитами // Проблемы передачи информации. 1999. Т. 35, № 4. C. 1-14.</mixed-citation><mixed-citation xml:lang="en">Рябко Б. Я., Фионов А. Н. Эффективный метод адаптивного арифметического кодирования для источников с большими алфавитами // Проблемы передачи информации. 1999. Т. 35, № 4. C. 1-14.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Johnson N. F., Jajodia S. Steganography: seeing the unseen // IEEE Computer. 1998. N 2. P. 26-34.</mixed-citation><mixed-citation xml:lang="en">Johnson N. F., Jajodia S. Steganography: seeing the unseen // IEEE Computer. 1998. N 2. P. 26-34.</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>
