Abstract: The subject of the research is the steganographic method of embedding information in digital images. Steganography is able to hide not only the content of information, but also the fact of its existence. The paper presents a method of embedding and extracting information into digital images using a chaotic dynamic system. Chaotic systems are sensitive to certain signals and at the same time immune to noise. These properties allow the use of chaotic systems for embedding information with small image distortions in statistical and visual terms. The methodological basis of the study is the methods of the theory of dynamical systems, mathematical statistics, as well as the theory of image processing. The novelty of the study lies in the development of a new method of embedding information in static images. The author examines in detail the problem of using a chaotic dynamic Duffing system for embedding and extracting information in digital still images. It is shown that the proposed method allows you to embed information in digital images without significant distortion.

Keywords: information embedding algorithm, image processing, signal detection, digital images, information security, chaotic oscillators, steganography, image distortion, transfer of hidden information, lyapunov exponent

References:
SSL 3.0 Protocol Vulnerability and POODLE Attack [Elektronnyy resurs].-Rezhim dostupa: https://www.us-cert.gov/ncas/alerts/TA14-290A (data obrashcheniya: 01.02.2020).
Filler T., Fridrich J. Gibbs construction in steganography // IEEE Transactions on Information Forensics and Security. 2010. Vol. 5, № 4. pp. 705-720
Chen K., Zhang W. and etc. Defining cost functions for adaptive steganography at the microscale // 2016 IEEE International Workshop on Information Forensics and Security. 2016. pp 1-6
Wang G., Chen D. and etc. The application of chaotic oscillators to weak signal detection // IEEE Transactions on industrial electronics. 1999. vol. 46, № 2. pp. 440-444
Thompson, J.M.T., Stewart, H.B. Nonlinear Dynamics and Chaos.-New York: John Wiley & Sons, 2002.-460 P.
Baltaev R.Kh., Lunegov I.V. Steganograficheskiy metod vstraivaniya informatsii s ispol'zovaniem shumopodobnoy posledovatel'nosti i sokhraneniem statisticheskoy modeli izobrazheniy // Kibernetika i programmirovanie. 2018. № 5. 76-83 s.
Wolf A.,

Abstract: The article is devoted to the urgent problem of ensuring the security of heterogeneous information platforms using a multi-agent threat detection system. The object of the study is a multi-agent platform. The authors pay special attention to such aspects of the topic as: security of multi-agent platforms, management of threat detection agents, interconnection between different threat detection agents, vulnerability in multi-agent platforms. Trends are being considered for the development of new distributed security models. The paper presents a multi-agent architecture for security services, as well as a general scenario for deploying security in multi-agent threat detection systems. The paper presents a multi-agent architecture for security services, as well as a general scenario for deploying security in multi-agent threat detection systems. Using a multi-agent system approach to a security model that provides control from the sender using the mobility and extensibility characteristics of the agent. The multi-agent protection system model for heterogeneous information platforms provides an improved approach for online communications, providing flexible mechanisms for the comprehensive protection of heterogeneous information platforms that can satisfy various security requirements and provide better control over the data to its sender.

Keywords: threat detection agent, heterogeneous information platforms, multiagent platform, intelligent protection system, threat detection, information security, analysis systems, detection algorithms, agent platform, multi-agent system

References:
Roth V. On the Robustness of Some Cryptographic Protocols for Mobile Agent Protection /In: Proceedings of the 5th International Conference on Autonomous agents, 2001
Grimley M.J., Monroe B.D. Protecting the integrity of agents^ an exploration into letting agents loose in an unpredictable world //Communications of the ACM. – 1999.-Vol.5. – P. 10-17.
Barker W.C. Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher.-National Institute of Standards and Technology (NIST), 2008.
A Security Scan Tool returns “SSL Server Support Weak Encryption Vulnerability”.-http://www-01.ibm.com/support/docview.wss?rs=180&uid=swg21384688.
Schneier B. Description of a New Variable-Length Key, 64-bit Block Cipher. – Cambridge Security Workshop Proceedings, 1994. – P. 340-346.
Wheeler D., Needham R. TEA, a Tine Encryption Algorithm. – Cambridge Security Workshop Proceedings. – 1994.-№809. – P. 363-369.
Schneier B., et al. Twofish: A 128-bit Block Cipher /In: 1st AES Conference, 1998.
Lang

Abstract: Increased information security risks in multi-agent robotic systems create a need for new and known assessment in terms of security algorithms. Such risks include the loss or inaccessibility of data, spreading false information about the purpose of grouping and the use of distorted information, lack of energy resources. Authors note that common approaches to information security in multi-agent robotic systems so far are not formed. The research is aimed at developing a model of information security in multi-agent robotic systems taking into account the specifics of the technology. Existing scientific and methodical apparatus and technical solutions of ensuring information security in multi-agent systems are not applicable to the tasks of ensuring information security in multi-agent robotic systems due to the specific technology and a special type of threat models and the offending patterns associated with them. Existing methods of providing information security of multi-agent systems do not provide a comprehensive solution of the problems of information security in the multi-agent robotic systems, since they do not take into account the specificity of their composition and structure. Scientific novelty consists in the development of software models of information security risks in multi-agent robotic systems. An advantage of the method is the ability to detect new types of attacks without having to modify or update the model parameters, since the invasion of the offending system can be described as a deviation from the nominal behavior.

Keywords: hidden destructive effect, identification of the destructive impact, feature space, informative signs, information attack, data protection, swarm intelligence, information security model, decentralized control, multi-agent robotic system

References:
Yurevich E.I. Osnovy robototekhniki. 2-e izd., pererab. i dop. SPb.: BKhV-Peterburg, 2005. 416 s.
Yur'eva R.A., Komarov I.I., Dorodnikov N.A. Postroenie modeli narushitelya informatsionnoi bezopasnosti dlya mul'tiagentnoi robototekhnicheskoi sistemy s detsentralizovannym upravleniem // Programmnye sistemy i vychislitel'nye metody. 2016. № 1(14). S. 42-48
Stankevich L.A. Adaptivnye povedencheskie sistemy na neirologicheskikh setyakh. 11-ya Natsional'naya konferentsiya po iskusstvennomu intellektu s mezhdunarodnym uchastiem (KII-08), 29.09-3.10.2008, Dubna. 7 s.
Stankevich L.A. Neirologicheskie sredstva sistem upravleniya intellektual'nykh robotov. Nauchnaya sessiya MIFI-2004. VI Vserossiiskaya NTK «Neiroinformatika-2004»: Lektsii po neiroinformatike, ch. 2. M.: MIFI, 2004. S. 57-110.
Kolling A., Nunnally S., Lewis M. Towards Human Control of Robot Swarms (2012). [elektronnyi resurs], http://faculty.cs.byu.edu/~mike/mikeg/papers/MOSC/LewisIros11swarm.pdf), rezhim dostupa svobodnyi.
Navarro I

Abstract: Two-factor authentication is required to establish a secure connection when a remote user tries to connect to the corporate web services. Authentication is a prerequisite for web services that process confidential information. Two-factor authentication is a way to improve the corporate information security. There are many ready solutions for the implementation of two-factor authentication system but these solutions have several disadvantages, such as high cost or difficult integration into existing corporate information structure. The aim of this study is to define the architecture of the system that overcomes the mentioned disadvantages. For designing a protection system against password guessing the authors previously used a method of static analysis to justify the demand for systems of this type. The authors also used data analysis method to determine the requirements for the system of two-factor authentication; an experiment confirmed the results of a research. Presented architecture provides protection from password guessing, does not depend on additional hardware or software and has a modular structure, which gives the advantage of scalability. The architecture defines advanced functionality for such systems: determining geographic location of real IP-addresses, address filtering based on geolocation and proxy addresses using a POST requests. It also allows building modules, which can be easily integrated with existing enterprise infrastructure. The result of using the proposed system shows that the percentage of intruders accessing corporate information system is reduced.

Keywords: information security, password guessing, single sign-on technology, service-oriented architecture, control permissions, one-time password, authentication code, two-factor authentication, secure connection, web service

References:
Razzaq A., Hur A., Shahbaz S., Masood M., Ahmad R., Critical analysis on web application firewall solutions. IEEE Eleventh International Symposium on Autonomous Decentralized Systems: 2013, pp. 1-6.
Al-Kahtani M.A., Sandhu R.S. 2002. A Model for Attribute-Based User-Role Assignment. Proceedings of the 18th Annual Computer Security Applications Conference: 2002, pp. 353-362.
Liu J., Liu C., Jiao D., Chen J. The Research of a Multi-Factor Dynamic Authorization Model. Proceedings of the 2012 IEEE Ninth International Conference on e-Business Engineering: 2012, pp. 201-205.
Oh S. W., Kim H. Decentralized access permission control using resource-oriented architecture for the web of things. Advanced Communication Technology (ICACT), 2014 16th International Conference: 2014, pp. 749-753.
M'Raihi D., Rydell J., Bajaj S., Machani S., Naccache D. RFC 6287. OCRA: OATH Challenge-Response Algorithm. IETF, 201, p. 38.
M'Raihi D., Machani S., Pei M., Rydell J. RFC 6238. TOTP: Time-Based One-Time Password

Abstract: The primary objective of the interloper is to keep a swarm of robots from performing their functions by any means including their destruction. The primary goal of the information security system is to provide the proper security level for the swarm of robots against any natural or artificial hindrances for it is necessary to take into account not only the information safety but also physical security of actors. For the physical security of a wide range of facilities (the authors offer to call them 'facilities under potential interloper's influence or FPIP) it is very important to prepare the list of potential threats, especially design threats. The list would allow to design a necessary system for the physical protection of a particular facility and to evaluate its efficiency. The composite element of the design threat is the interloper modeling and therefore development of such a model is a high priority. According to the guidline documents, the interloper model should be based on both the featurs of the facility and performed technological operations (stable factors) and variable factors, i.e. social conditions of the territory where the facility is located, social relations, psychological traits of a particular group of workers and/or individuals as well as the global, country's, regional environment, etc. Therefore, the model should take into account all kinds of factors that are related to various aspects of the reality and often divorced from one another. The authors of the present article analyze the offered interloper models from different points of view. Nevertheless, these models are interconnected, so examination of these connections is one of the goals of the vulnarability analysis. In case the obtained characteristics of the operational interloper model are below the desired characteristics of the design interloper model (for example, the number of interloper agents that can be potentially involved in the destructive activity is lower than the number of interlopers which activities are to be prevented by the designed Information Security System according to the design project prescribed for the facility, i.e. Z>У), then the decision about sufficient facility hardness can be made meaning there is no need to perform unscheduled actions (facility vulnarability analysis with ISS performance evaluation, improvement of ISS, changes in the task execution technology, etc.).

Keywords: information security, multi-agent robotic system, decentralized control, interloper model, modeling, robotic system, destructive influence, swarm robotechnics, disorganized behavior, protective measures

References:
Iñaki Navarro and Fernando Matía An Introduction to Swarm Robotics.ETSI Industriales, Universidad Politécnica de Madrid, c/José Gutiérrez Abascal, 2, 28006 Madrid, SpainReceived 18 April 2012; Accepted 19 June 20127 F. Higgins, A. Tomlinson, and K.M. Martin, “Survey on security challenges for swarm robotics,” in Proceedings of the 5th International Conference on Autonomic and Autonomous Systems (ICAS '09), p. 307–312, IEEE Computer Society, Los Alamitos, CA, USA, April 2009.
Zikratov I.A., Kozlova E.V., Zikratova T.V. Analiz uyazvimostei robototekhnicheskikh kompleksov s roevym intellektom // «Nauchno-tekhnicheskii vestnik informatsionnykh tekhnologii, mekhaniki i optiki». № 5(87), NIU ITMO, SPb., 2013. S. 149-154.
Karpov V.E. Upravlenie v staticheskikh royakh. Postanovka zadachi // «Integrirovannye modeli i myagkie vychisleniya v iskusstvennom intellekte» Sb. nauchnykh trudov VII –i Mezhdunarodnoi nauchno-prakticheskoi konferentsii (Kolomna, 20–22 maya 2013). S. 12.
Aru

Abstract: Countering the hidden channels of information transmission is an important task in the organization of information security. One kind of passive physical resistance methods is detection of the steganographic impact on the investigated container. The widespread use of digital still images as stegano-containers is due to their large share in total data traffic. The task of passive counteraction (steganalysis) allowing identifying the digital image with the built-in information is actually a binary classification problem. At the core of the classifier lies statistical algorithm of quantitative steganalysis for determining the amount of modified pixels in the data container. The accuracy of the algorithm directly affects the quality classification and the practical effectiveness of passive physical resistance as a whole. By effective counteraction the article refers to the ratio of probabilities between true positive classification and the probability of a false positive classification. Currently there are many statistical algorithms for quantitative steganalysis. However, there are no studies on their comparative analysis which complicates the selection of an algorithm while solving the problem of counteraction to steganography channels of information leakage. The practical effectiveness of passive physical resistance to steganography channels by inserting the least significant bits of pixel digital image also remains an open question. The subject of the study is the effectiveness of the application of modern quantitative statistical algorithms steganalysis. Based on the results of the study the authors have formed graphics of trust regions, allowing to make a comparative assessment of the effectiveness of the passive counteraction in LSB-steganography. For the study the authors selected the following steganalysis algorithms: RS- analysis, Sample pair analysis, Difference image histogram, Triples analysis, Weighted stego-image. From the test of multiple images an image is selected. An evaluation of its capacity (defined by the maximum payload) is performed. In the experiments for this value authrs accepted the total number of pixels in the image. Steganographic effects modeled by changing the value of the least significant bit for a predetermined number of pixels (the payload). The modified image used as an input to a particular implementation of the algorithm steganalysis. The result of the algorithm is the number of changed pixels in the image. The experiments were carried out under the same conditions for all implementations of algorithms steganalysis. The main conclusions of the study is the fact that based on modern statistical steganalysis algorithms it is possible to organize an effective opposition to the passive channels with LSB steganography with embedding payload container more than 5%. Reducing the payload container of less than 5% dramatically reduces the effectiveness of the passive counteraction. A small 600x400 pixels image converted to steganography with payload of 1-2% is practically not detected by classifiers based on statistical quantitative algorithms steganalysis. Taking into account the possibility of pre-compression hidden data and matrix embedding, the considered modern algorithms for steganalysis need further improvement.

Keywords: the steganalysis algorithm, weighted stego-image, difference histogram analysis, simple pair analysis, LSB-based steganography, statistical quantative steganalysis, steganography, digital watermark, still images, statistical analysis algorithms

References:
Korobeynikov A.G., Kutuzov I.M. Algoritm obfuskatsii // Kibernetika i programmirovanie. - 2013. - 3. - C. 1 - 8. DOI: 10.7256/2306-4196.2013.3.9356. URL: http://www.e-notabene.ru/kp/article_9356.html
H.G. Schaathun. Machine learning in image steganalysis // Alesund University College, pp 164-167 , 2012
Y. Kim Z. Duric, D. Richards, Modified matrix encoding technique for minimal distortion steganography// in Proc. 8th Int. Workshop Information Hiding. Jul. 10-12, 2006, vol. 4437, pp. 314-327
Kollektsiya Fotografii Ameriki 20-go veka [Elektronnyy resurs] / Spisok forumov rutracker.org Rezhim dostupa: http://rutracker.org/forum/viewtopic.php?t=3501973 (Data obrashcheniya: 30.05.2014)
Kollektsiya "World in photo" [Elektronnyy resurs] / Spisok forumov rutracker.org Rezhim dostupa: http://rutracker.org/forum/viewtopic.php?t=2272897 (Data obrashcheniya: 30.05.2014)
Fotografii gribov [Elektronnyy resurs] / Spisok forumov rutracker.org Rezhim dostupa: http://rutracker.org/forum/viewtopic.php

Abstract: the subject of this study is the time required to complete a full rebuilding of a binary tree, as well as the degree of compression of text in Huffman algorithm. The author defines dependencies of both time of program execution and the level of text compression from the length of string formed of random set of unique symbols, from the length of string if it consists of fixed set of unique symbols and in the case of the fixed length of string having different number of unique symbols. It is shown that the time required to rebuild a binary tree is a small part of the total time of the program execution. An algorithm for constructing the character codes comprises the following steps: 1) reading the text from file; 2) counting different symbols of the text; 3) filling and sorting the data array; 4) building binary tree. Some sources state that the approach with full rebuilding of a binary tree is ineffective. However, that statement is not supported by relevant facts. The author proves through the analysis of texts of varying length and different sets of unique characters, presented in tabular and graphical form, that the rebuilding of a binary tree has little effect on the program execution time.

Keywords: Huffman algorithm, binary tree rebuilding, compression of text data, program execution time, thrifty information encoding, prefix encoding, unique symbols, the degree of text compression, length of input string, average approximation error

References:
Aleksandrov O.E. Kompressiya dannykh ili izmerenie i izbytochnost' informatsii. Metod Khaffmana: Metodicheskie ukazaniya k laboratornoy rabote / O. E. Aleksandrov – Ekaterinburg: UGTU–UPI, 2000. – 36 s.
Kudryashov B.D. Teoriya informatsii: Uchebnik dlya vuzov. – SPb.: Piter, 2009. – 320 s.: il. – (Seriya «Uchebnik dlya vuzov»)
Kolmogorov A.N. Teoriya informatsii i teoriya algoritmov. – M.: Nauka, 1987. – 304 s.
Svirid Yu.V. Osnovy teorii informatsii: Kurs lektsiy. – Mn.: BGU, 2003. – 139 s.
Smirnov M.A. Obzor primeneniya metodov bezushcherbnogo szhatiya dannykh v SUBD: Rukopis'. – SPb.: GUAP, 2004. – 58 s.
Shennon K. Raboty po teorii informatsii i kibernetike. – M.: Izdatel'stvo inostrannoy literatury, 1963. – 825 s

Abstract: the article discusses the zero-knowledge authentication protocol based on the based biometric fuzzy extractor and Elgamal cryptosystem. The authors review advantages, disadvantages and practical aspects of the application of this protocol. The article describes the types of biometric cryptographic systems (key release cryptosystems, key binding cryptosystems, key generation cryptosystems), provides their brief descriptions and reviews possible attacks. The authors state that there are two ways generating a biometric key from biometric data that will meet the requirements of modern cryptography at the same time having a low probability of type II errors. One of the major factors determining the level of security for a key-based informational infrastructure is the eff ectiveness of its information security access control subsystem functioning. The authors propose a zero-knowledge biometric authentication protocol. The key element of reliability of the protocol is in a single use of a session key “k”. There is no need to store confidential user data on the side of the access control subsystem and it is the main advantage of the presented protocol.

Keywords: biometric cryptographic system, fuzzy extractor, Elgamal cryptosystem, protection of biometric subsystems, access control, biometric authentication protocol, session key, reliability, authentication, threats

References:
Bardaev S.E., Fin'ko O.A. “Mnogofaktornaya biometricheskaya porogovaya kriptosistema”, Izvestiya YuFU. Tekhnicheskie nauki, 2010, №4, S. 148–155.
Kulikova O.V. “Biometricheskie kriptograficheskie sistemy i ikh primenenie”, Bezopasnost' informatsionnykh tekhnologiy, 2009, № 2009-3.
Juels A., Sudan M. “A Fuzzy Vault Scheme”, in Proc. of IEEE Intl. Symp. on Info. Theory, Lausanne, Switzerland, 2002, p. 408.
Nandakumar K., Jain A.K. “Multibiometric Template Security Using Fuzzy Vault”, in Proc. IEEE Int. Conf. Biometrics: Theory, Applications and Systems, Arlington, VA, Sep. 2008, pp. 1-6.
Scheirer W. J., Boult T. E. “Cracking Fuzzy Vaults and Biometric Encryption”, in Proc. of Biometrics Symposium, September 2007.
Kasperski K. “Sekretnoe oruzhie sotsial'noy inzhenerii” [Elektronnyy resurs] // Rezhim dostupa: http://www.insidepro.com/kk/004r.shtml.
GOST R 52633-2006 “Zashchita informatsii. Tekhnika zashchity informatsii. Trebovaniya k sredstvam vysokonadezhnoy biometricheskoy auten

Abstract: the definition of technological risks diff ers not only in diff erent areas, but also in one field of technology. The problem of technological risks in information technologies in modern society of knowledge acquires strongly pronounced social character. Informatization, convergence of computer, telecommunication and multimedia technologies provides a fundamentally new level of civilization development, increasingly aff ecting human life and society. Is it clearly positive? Does it help finding the path of sustainable development of civilization? Does the development of information and communication technologies contain any new sources of instability and threats? All of these questions require special studies and discussions. Currently society of knowledge is fundamentally ambivalent. Modern society becomes a field of permanent experiment with new informational technologies, the consequences of which can be not only positive but also negative for both society as a whole and for its individual citizens.

Keywords: technological risks, the knowledge society, information security, information technologies, negative consequences, expertocracy, technocracy, computer science, information society, internet

References:
Syuntyurenko O.V. Sotsial'nye i ekonomicheskie riski razvitiya informatsionnykh tekhnologiy// Nauchno-tekhnicheskaya informatsiya. Ser.1. 2012. № 6. S. 1-5.
Khoffman L.Dzh. Sovremennye metody zashchity informatsii// M.: Sovetskoe radio, 1980.-263 s.
Baturin Yu.M. Problemy komp'yuternogo prava.-M: Yurid. lit., 1991.-272 s.
Smolyan G.L. Setevye informatsionnye tekhnologii i problemy bezopasnosti lichnosti// Vestnik RFFI. 1999. № 3(17). S. 63-68.
Siountiourenko O. The Problems of Providing Information Security: The Case of Information Infrastructure// Studies in Eastern Europe. Technological and Environmental Policy / ed. Gerhard Banse/-Berlin, 2007. P. 163-178.
Temnaya storona fleshmoba [Elektron. resurs]. – URL: http://www.metronews.ru/ novosti/temnaja-storona-fleshmoba/TpolbB---m0VnuDmSIgzIk/
Malinetskiy G.G. Stsenarii, strategicheskie riski, informatsionnye tekhnologii// Informatsionnye tekhnologii i vychislitel'nye sistemy. 2002. № 4. S. 83-108.
Syuntyurenko O.V. Infrastru

Abstract: In this article the authors discuss the ways to automate the growing method of diagnosis – a tezigraphy. It has long been known that biological ß uids crystallize when dried. Under pathological conditions, the crystallization properties of biological ß uids change. As a result of the studies it has been found that this method is very sensitive and can be used on a preclinical stage to diagnose the viral and infectious diseases. To determine the nature of the disease it is necessary to analyze the obtained images of biocrystals to describe their shape and determine the way of distribution by the number of attributes. The article gives the algorithms and methods for automated evaluation of the image attri butes on the image samples obtained during the tezigraphy researches. The article inves tigates the segmentation algorithm based on edge detection using Þ ltering algorithm for calculating the areas and detecting attributes of form and algorithms of modeling and fractal analysis in the consideration of tree and other complex crystallogramms. The authors pre sents a program, which allows to obtain esti mates of the distribution in area, perimeter and other characteristics of the crystals, as well as statistical data for a variety of crystals grown on the same surface.

Keywords: Software, tezigramma, biochip, seg me ntation, sign, analysis, image, form, object, salvia

References:
Gonsales R., Vuds R., Eddins S. Tsifrovaya obrabotka izobrazheniy v srede Matlab. Moskva, Tekhnosfera, 2006.
I.A.Mal'chikov, I.A.Tuzankina, Yu.V.Grigor'eva, L.P.Mal'chikova. Biofizicheskie aspekty kristallograficheskikh issledovaniy. Ekaterinburg, 2006.
Isaeva V.V. i dr. Fraktaly i khaos v biologicheskom morfogeneze. Vladivostok, 2004.
D'yakonov V. MATLAB. Obrabotka signalov i izobrazheniy. Spetsial'nyy spravochnik. — SPb.: Piter, 2002.
Matlab & Toolboxes/http: //matlab. exponenta.ru