<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Informacionnye Tehnologii</journal-id><journal-title-group><journal-title xml:lang="en">Informacionnye Tehnologii</journal-title><trans-title-group xml:lang="ru"><trans-title>Информационные технологии</trans-title></trans-title-group></journal-title-group><issn publication-format="print">1684-6400</issn><publisher><publisher-name xml:lang="en">New Technologies Publishing House</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">702081</article-id><article-id pub-id-type="doi">10.17587/it.31.538-546</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Information security</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Безопасность информации</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Model for steganographic data embedding into program memory</article-title><trans-title-group xml:lang="ru"><trans-title>Модель стеганографического встраивания данных в память программы</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Belim</surname><given-names>S. V.</given-names></name><name xml:lang="ru"><surname>Белим</surname><given-names>С. В.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Dr. Phys.-Math. Sc., Professor</p></bio><bio xml:lang="ru"><p>д-р физ.-мат. наук, проф.</p></bio><email>sbelim@mail.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Munko</surname><given-names>S. N.</given-names></name><name xml:lang="ru"><surname>Мунько</surname><given-names>С. Н.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Assistant</p></bio><bio xml:lang="ru"><p>ст. преподаватель</p></bio><email>munko_s@mail.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Belim</surname><given-names>S. Yu.</given-names></name><name xml:lang="ru"><surname>Белим</surname><given-names>С. Ю.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>PhD, Assistant Professor</p></bio><bio xml:lang="ru"><p>канд. пед. наук, доц. </p></bio><email>svbelim@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Omsk State Technical University</institution></aff><aff><institution xml:lang="ru">Омский гоcударственный технический университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-10-15" publication-format="electronic"><day>15</day><month>10</month><year>2025</year></pub-date><volume>31</volume><issue>10</issue><issue-title xml:lang="en"/><issue-title xml:lang="ru"/><fpage>538</fpage><lpage>546</lpage><history><date date-type="received" iso-8601-date="2026-02-02"><day>02</day><month>02</month><year>2026</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Informacionnye Tehnologii</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Информационные технологии</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Informacionnye Tehnologii</copyright-holder><copyright-holder xml:lang="ru">Информационные технологии</copyright-holder></permissions><self-uri xlink:href="https://journals.eco-vector.com/1684-6400/article/view/702081">https://journals.eco-vector.com/1684-6400/article/view/702081</self-uri><abstract xml:lang="en"><p>The article suggests a method for embedding hidden data into the program dynamic memory. The method is based on connecting a dynamic authentication library. The library works directly with a heap of programs. The algorithm breaks the security label into blocks of the same size. The blocks are evenly distributed across the heap. The memory scheduler is not involved in the generation of this data. The method deletes embedded data after a certain time period. Heap address calculation parameters and time period are parameters of the algorithm. The authentication library that embeds the information is universal. The probabilistic model of the program with a heap is proposed in the article. This model is necessary to investigate the possibility of collisions between embedded data and dynamic program variables. The model treats the creation and deletion of dynamic variables as random events. Computer simulation of program behavior for different probability ratios was carried out. А computer experiment showed the basic patterns of heap use by the program. The simulation results demonstrate the linear dependence of heap filling on the probability ratio of creating and deleting variables. The criteria for selecting steganographic embedding parameters are determined based on modeling. The period for placement of embedded data blocks and the time of presence the steganographic insert in the program memory are determined by the statistical characteristics of the executable code.</p></abstract><trans-abstract xml:lang="ru"><p>Предложен метод встраивания скрытых данных в динамическую память программы. Построена вероятностная модель работы программы с динамической памятью. Проведено моделирование возможности возникновения коллизий между встроенными данными и динамическими переменными программы. На основе моделирования определены критерии выбора параметров стеганографического встраивания.</p></trans-abstract><kwd-group xml:lang="en"><kwd>steganographic method</kwd><kwd>hidden data</kwd><kwd>security labels</kwd><kwd>probabilistic model</kwd><kwd>program memory model</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>стеганографический метод</kwd><kwd>скрытые данные</kwd><kwd>метки безопасности</kwd><kwd>вероятностная модель</kwd><kwd>модель памяти программы</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">El-Khalil R., Keromytis А. Hydan: Hiding information in program binaries. Lecture Notes in Computer Science, 2004, vol. 3269, pp. 187—199, DOI: 10.1007/978-3-540-30191-2_15</mixed-citation><mixed-citation xml:lang="ru">El-Khalil R., Keromytis А. Hydan: Hiding information in program binaries. // Lecture Notes in Computer Science. 2004. Vol. 3269. P. 187—199. DOI: 10.1007/978-3-540-30191-2_15.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">Krasov A., Arshinov A., Ushakov I. Embedding the hidden information into java byte code. ARPN Journal of Engineering and Applied Sciences, 2018, vol. 13 (8), pp. 2746—2752.</mixed-citation><mixed-citation xml:lang="ru">Krasov A., Arshinov A., Ushakov I. Embedding the hidden information into java byte code // ARPN Journal of Engineering and Applied Sciences. 2018. Vol. 13, Iss. 8. P. 2746—2752.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Krasov A., Tregubov Y., Shterenberg S. Research of copy protection methods software based on embed of digital watermarks into executable and library files. Cambridge Journal of Education and Science, 2015, vol. 2 (14), pp. 565—573.</mixed-citation><mixed-citation xml:lang="ru">Krasov A., Tregubov Y., Shterenberg S. Research of copy protection methods software based on embed of digital watermarks into executable and library files // Cambridge Journal of Education and Science. 2015. Vol. 2, Iss. 14. P. 565—573.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Shterenberg S. I., Krasov A. V., Ushakov I. A. Analysis of using equivalent instructions at the hidden embedding of information into the executable files. Journal of Theoretical and Applied Information Technology, 2015, vol. 80 (1), pp. 28—34.</mixed-citation><mixed-citation xml:lang="ru">Shterenberg S. I., Krasov A. V., Ushakov I. A. Analysis of using equivalent instructions at the hidden embedding of information into the executable files. // Journal of Theoretical and Applied Information Technology. 2015. Vol. 80, Iss. 1. P. 28—34.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Hirohisa Н. Data hiding for text and binary files. Computational linguistics: concepts, methodologies, tools, and applications, 2014, pp. 1495—1514, DOI: 10.4018/978-1-4666-6042-7.ch074.</mixed-citation><mixed-citation xml:lang="ru">Hirohisa Н. Data hiding for text and binary files. // Computational linguistics: concepts, methodologies, tools, and applications. 2014. P. 1495—1514. DOI: 10.4018/978-1-4666-6042-7.ch074.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">Choi S., Park H., Lim H.-I, Han T. А static birthmark of binary executables based on API call structure. ASIAN’07: Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security. 2007, pp. 2—16, DOI: 10.1007/978-3-540-76929-3_2.</mixed-citation><mixed-citation xml:lang="ru">Choi S., Park H., Lim H.-I., Han T. А static birthmark of binary executables based on API call structure. // ASIAN’07: Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security. 2007. P. 2—16. DOI: 10.1007/978-3-540-76929-3_2.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">Anckaert B., De Sutter B., Chanet D., De Bosschere K. Steganography for executables and code transformation signatures. Lecture Notes in Computer Science, 2005, vol. 3506, pp. 425—439, DOI: 10.1007/11496618_31.</mixed-citation><mixed-citation xml:lang="ru">Anckaert B., De Sutter B., Chanet D., De Bosschere K. Steganography for executables and code transformation signatures. // Lecture Notes in Computer Science. 2005. Vol. 3506. P. 425—439. DOI: 10.1007/11496618_31.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">Stern J. P., Hachez G., Koeune F., Quisquater J. J. Robust object watermarking: application to code. Lecture Notes in Computer Science, 2000, vol. 1768, pp. 368—378, DOI: 10.1007/10719724_25.</mixed-citation><mixed-citation xml:lang="ru">Stern J. P., Hachez G., Koeune F., Quisquater J. J. Robust object watermarking: application to code. // Lecture Notes in Computer Science. 2000. Vol. 1768. P. 368—378. DOI: 10.1007/10719724_25.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Mairesse J., Vuillon L. Asymptotic behavior in a heap model with two pieces. Theoretical Computer Science, 2002, vol. 270, pp. 525—560, DOI: 10.1016/S0304-3975(01)00004-4.</mixed-citation><mixed-citation xml:lang="ru">Mairesse J., Vuillon L. Asymptotic behavior in a heap model with two pieces. // Theoretical Computer Science. 2002. Vol. 270. P. 525—560. DOI: 10.1016/S0304-3975(01)00004-4.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">Mandrykin M. U., Mutilin V. S. Modeling Memory with Uninterpreted Functions for Predicate Abstractions. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS), 2015, vol. 27 (5), pp. 117—142 (in Russian), DOI: 10.15514/ISPRAS-2015-27(5)-7.</mixed-citation><mixed-citation xml:lang="ru">Мандрыкин М. У., Мутилин В. С. Моделирование памяти с использованием неинтерпретируемых функций в предикатных абстракциях. // Труды ИСП РАН. 2015. Т. 27, Вып. 5. С. 117—142. DOI: 10.15514/ISPRAS-2015-27(5)-7.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">Berger E. D., Zorn В. G. DieHard: Probabilistic memory safety for unsafe languages. ACM sigplan notices, 2006, vol. 41 (6), pp. 158—168, DOI: 10.1145/1133255.1134000</mixed-citation><mixed-citation xml:lang="ru">Berger E. D., Zorn В. G. DieHard: Probabilistic memory safety for unsafe languages //ACM sigplan notices. 2006. Vol. 41, N. 6. P. 158—168. DOI: 10.1145/1133255.1134000.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">Fraguela B. B., Doallo R., Zapata E. L. Probabilistic Miss Equations: Evaluating Memory Hierarchy Performance. IEEE Transaction on computers, 2003, vol. 52 (3), pp. 321—336, DOI: 10.1109/TC.2003.1183947.</mixed-citation><mixed-citation xml:lang="ru">Fraguela B. B., Doallo R., Zapata E. L. Probabilistic Miss Equations: Evaluating Memory Hierarchy Performance.// IEEE Transaction on computers. 2003. Vol. 52, N.3. P. 321—336. DOI: 10.1109/TC.2003.1183947.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">Stefanakos I., Calinescu R., Gerasimou S. Probabilistic Program Performance Analysis. 47th Euromicro Conference on Software Engineering and Advanced Applications (SEAA), 2021, pp. 148—157, DOI: 10.1109/SEAA53835.2021.00027.</mixed-citation><mixed-citation xml:lang="ru">Stefanakos I., Calinescu R., Gerasimou S. Probabilistic Program Performance Analysis // 47th Euromicro Conference on Software Engineering and Advanced Applications (SEAA). 2021. P. 148—157. DOI: 10.1109/SEAA53835.2021.00027.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
