<?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-735</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>Method of Secret Messages Embedding into Executable Files</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>I. Nechta</surname></name></name-alternatives><email xlink:type="simple">noemail@neicon.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>2011</year></pub-date><pub-date pub-type="epub"><day>06</day><month>02</month><year>2023</year></pub-date><volume>0</volume><issue>2</issue><fpage>3</fpage><lpage>10</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">Нечта И.В.</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/735">https://vestnik.sibsutis.ru/jour/article/view/735</self-uri><abstract><p>В статье предлагается модификация существующего метода внедрения информации 
в исполняемые файлы. Предыдущий метод внедрял секретное сообщение в неиспользуемые места исполняемого файла. Внедрённое сообщение имеет статистические отличие 
от кода программы, что делает метод внедрения уязвимым к статистическим атакам. 
В статье предлагается предварительно кодировать внедряемое сообщение так, чтобы распределения вероятностей байт секретного сообщения и кода программы были неотличимы. Предложенный подход повышает устойчивость метода внедрения к статистическим атакам.</p></abstract><trans-abstract xml:lang="en"><p>This paper is about modification of data hiding method in executable files. The previous embedding method hides a secret message in an unused space of the executable file.  Statistical difference exists between a program code and an embedded message, which makes this embedding method vulnerable to statistical attacks. This paper offers to encode a message before embedding so that the probability distribution of  secret message bytes and the program code bytes were indistinguishable. The proposed approach improves  robustness of  data hiding method to statistical attacks.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>стеганография</kwd><kwd>стегоанализ</kwd></kwd-group><kwd-group xml:lang="en"><kwd>Portable Executable</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">Thorpe D. Development System with Methodology Providing Information Hiding in Executable Program // US Patent 20060136875 (2006).</mixed-citation><mixed-citation xml:lang="en">Thorpe D. Development System with Methodology Providing Information Hiding in Executable Program // US Patent 20060136875 (2006).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Pietrek M. Peering Inside the PE: A Tour of the Win32 Portable Executable File Format // URL: http://msdn.microsoft.com/enus/magazine/ cc301805.aspx (дата обращения: 01.11.2010).</mixed-citation><mixed-citation xml:lang="en">Pietrek M. Peering Inside the PE: A Tour of the Win32 Portable Executable File Format // URL: http://msdn.microsoft.com/enus/magazine/ cc301805.aspx (дата обращения: 01.11.2010).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Нечта И.В. Эффективный метод стегоанализа, базирующийся на коде Хаффмана // Вестник СибГУТИ 2010. № 4. С. 47-53.</mixed-citation><mixed-citation xml:lang="en">Нечта И.В. Эффективный метод стегоанализа, базирующийся на коде Хаффмана // Вестник СибГУТИ 2010. № 4. С. 47-53.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Anckaert B., De Sutter B., Chanet D., De Bosschere K. Steganography for Executables and Code Transformation Signatures // 7th International Conference on Information Security and Cryptology. 2005. P. 425-439.</mixed-citation><mixed-citation xml:lang="en">Anckaert B., De Sutter B., Chanet D., De Bosschere K. Steganography for Executables and Code Transformation Signatures // 7th International Conference on Information Security and Cryptology. 2005. P. 425-439.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</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, № 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, № 1. P. 95-110.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</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, № 1. P. 65-69.</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, № 1. P. 65-69.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</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="cit8"><label>8</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, № 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, № 12. P. 4119-4128.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</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. 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. 2008.</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>
