Abstract: The subject of the research is the optimization algorithms for automated dependency search on disassembled code. The object of the research is the dependent code blocks on the x64 architecture of Intel processors manufactured by the company and listings obtained as a result of reverse engineering software by compilers with different settings in Windows and Linux.Purpose of the study. The purpose of the study is to consider the possibility of using mathematical matrices to build a machine code map, and also to review possible problems for automatic analysis, to search for the paths of information flows. Research methods. We used the Visual C ++ compiler. We consider the architecture in which the transfer of information can be carried out in the following ways: register-memory, memory-register, register-register. For the analysis, the method of forming the list of functions called up to the potentially dangerous block of code under investigation, chosen for each considered path to the block under study, was chosen. Methods for implementing the matrix approach are described and developed. Novelty and key findings. Mathematical matrix method can be used to build a machine code map. However, determining the reachability paths of individual code blocks may require a significant amount of resources. In addition, the machine code can be exposed to packers and obfuscators, which also introduces additional complexity. A number of potentially dangerous functions of the standard library of the C / C ++ programming language were identified.

Keywords: Mathematical Matrix Method, Buffer overflow, Disassembling, Code analysis, Vulnerabilities, Information security, Code compilers, Code Packers, Code obfuscators, Functions List

References:
Microsoft. Hardware Dev Center. x64 Architecture. [Elektronnyy resurs] URL: http://msdn.microsoft.com/en-us/library/windows/hardware/ff561499%28v=vs.85%29.aspx
Ablyazov R. Z. Programmirovanie na assemblere na platforme kh86_64. Ucheb. posobie / R. Z. Ablyazov. — Moskva: DMK Press, 2011. — 305 c. — ISBN: 978-5-94074-676-8.
Drozdov A. Yu., Kornev R. M., Bokhanko A. S. Indeksnyĭ analiz zavisimosteĭ po dannym // Informatsionnye tekhnologii i vychislitel'nye sistemy. — 2004. — № 3. URL: http://www.optimitech.com/docs/024.pdf
Evstigneev V. A., Arapbaev R. N., Osmonov R. A. Analiz zavisimostey: osnovnye testy na zavisimost' po dannym // Sibirskiy zhurnal vychislitel'noy matematiki. — 2007. — T. 10. — № 3. — S. 247–265. — URL: http://www.mathnet.ru/links/42c6264864b854261516917954cde4b9/sjvm82.pdf
Arapbaev R. N., Osmonov R. A. Analiz zavisimosteĭ po dannym dlya mnogomernykh massivov na baze modifitsirovannogo λ-testa // Problemy intellektualizatsii i kachestva sistem informatiki. — Novosibirsk: ISI

Abstract: The subject of research is the steganographic method of embedding information in digital images. Steganography is capable of hiding not only the content of information, but also the very fact of its existence. The paper considers one of the most important problems in the development of steganographic methods - the secrecy of the transfer of protected information. Stealth is not only visual or auditory indistinguishability of a digital media resource from a media resource with embedded information, but also statistical indistinguishability. Special attention is paid to preserving the spatial statistical dependence between the image pixels. The methodological basis of the research is the methods of mathematical statistics and image processing theory, as well as image distortion metrics. The novelty of the research lies in the development of a new method of embedding information in static images. The authors consider in detail the problem of applying the moving average autoregression process to represent the statistical dependence of image pixels. It is shown that the proposed method allows you to embed information into digital images without significant distortion.

Keywords: information embedding algorithm, digital images, CIEDE2000, hidden communication, information security, image processing, ARMA, steganography, autoregression process, image distortion

References:
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
Boks Dzh., Dzhenkins G. Analiz vremennykh ryadov. Prognoz i upravlenie. – M.: Mir, 1974. Vyp.1. – 406 s.
Zielinski J., Bouaynaya N., Schonfeld D. Two-dimensional ARMA modeling for breast cancer detection and classification //2010 International Conference on Signal Processing and Communications. 2010. pp 1-4
Schaefer G., Stich M. UCID – An uncompressed colour image database // Proc. SPIE, storage and retrieval methods and applications for multimedia. – 2004. – P. 472-480.
Sharma G., Wu W., Dalal E. N. The CIEDE2000 color-difference formula: Implementation notes, supplementary test data, and mathematical observations // Color Research and Application. 2005. Vol. 30, № 1.

Abstract: The subject of the research in this work is a dynamic process of user authentication using keyboard handwriting with free text selection.This process is a regular check of the user on a "friend-to-another" principle: the user entering the text is under continuous monitoring of the system and, in case of non-coincidence of the identification characteristics, the system refuses to continue working.The free sample is understood as follows: the user performs text input based on his current tasks, the system in turn analyzes this work, extracts signs, learns, and in case of inconsistency of characteristics, stops access. The research method used in this work is theoretical, consisting of research, search and calculations. An empirical method is also used, which consists of experiment, comparison, and study. The novelty of this paper is as follows. To date, the most popular authentication method is the password.However, the password gradually displaces the biometric means of authentication. For example, to date, many smartphones are equipped with a fingerprint scanning feature.Nevertheless, despite the effectiveness of this method, the method of keyboard authentication has its advantages: the fingerprint scanning system has the risk of not recognizing the finger, if it is injured, hacking methods of this method already exist and, most importantly, the proposed keyboard handwriting system controls by entering continuously, which will allow first, to prevent an attacker from entering the authentication phase, and also to detect it if, for example, he could, by fraudulent means, gain access to the system.

Keywords: normal distribution, analysis, recognition, dynamic authentication, keyboard handwriting, biometry, authentication, information security, statistics, experiments

References:
Savinov A.N. Metody, modeli i algoritmy raspoznavaniya klaviaturnogo pocherka v klyuchevykh sistemakh: avtoreferat dissertatsii na soiskanie uchenoy stepeni kandidata tekhnicheskikh nauk: 05.13.19. -Sankt-Peterburg, 2013. - 19 s.
Lapina T.I., Lapin D.V., Petrik E.A. Biometricheskaya autentifikatsiya pol'zovatelya po rukopisnomu pocherku // Izvestiya yugo-zapadnogo gosudarstvennogo universiteta. Seriya: upravlenie, vychislitel'naya tekhnika, informatika. Meditsinskoe priborostroenie. 2013. №2. S. 7-12.
Bryukhomitskiy Yuriy Anatol'evich Gistogrammnyy metod raspoznavaniya klaviaturnogo pocherka // Izvestiya YuFU. Tekhnicheskie nauki. 2010. №11. S. 55-62.
Boll R.M., Konnel Dzh. Kh., Pankanti Sh., Ratkha N.K., Sen'or E.U. Rukovodstvo po biometrii. Moskva: Tekhnosfera. 2007. 368 s.
Baranov S.O., Abramov D.B. Tekhnologiya biometricheskoy autentifikatsii pol'zovatelya po venoznomu risunku kistey ruk // Vestnik SibADI. 2017. №2. S. 134-139.
Samarov K.L. Matematika. Uchebno-metodicheskoe posobie po razdelu Matematicheskaya statistika. Moskva: Rezol'ven

Abstract: In his research Bashmakov analyzes accuracy of background area selection in static digital images by using the histogram method as part of steganalysis performed by Weighted Stego Image and WSPAM methods. He examines the dependence of practical accuracy of steganalysis of static digital images by using Weighted Stego Image and  WSPAM methods on the kind of prediction model in gradient regions of an image as part of resistance to data transmission channels that use the method of embedding the least significant bit of spatial domain in static digital images with a significant part of homogeneous background. The author analyzes the Weighted Stego steganalysis algorithm and WSPAM modification thereof. To evaluate the analysis efficiency, the author has used the BOWS2 collection. To evaluate efficiency of homogenous background selection, the author has used images selected from a wide range of sources. The information is built in by changing the least significant bits of images in spatial domain with an actual load from 3-5%. Efficiency of methods is defined based on true-positive, true-negative, false-positive and false-negative values of image classification. The author demonstrates the low accuracy of homogenous background selection using the histogram method. The author suggests to select homogenous background using the segmentation neural net and proves its efficiency. He also offers an improved model of pixel prediction in image gradient areas, this model allowing to achieve the highest accuracy of steganalysis. The results of the research can be used to create systems of passive resistance to steganographic data transmission channels that are based on the Weighted Stego algorithm. 

Keywords: steganalytic algorithm, steganographic embedding, steganalysis method accuracy, image spatial domain, statistical steganalysis, passive resistance, least significant bit, binary classification, steganalysis, steganography

References:
Gribunin V.G., Okov I.N., Turintsev I.V. Tsifrovaya steganografiya. M.:Solon-Press. 2016. 262 s.
Steganography: A Powerful Tool for Terrorists and Corporate Spies // Stratfor [Elektronnyy resurs]. Rezhim dostupa: https://www.stratfor.com/analysis/steganography-powerful-tool-terrorists-and-corporate-spies, svobodnyy. Yaz. angl. (data obrashcheniya 22.08.2017).
Gayathri C., Kalpana V. Study on image steganography techniques // International Journal of Engineering and Technology (IJET). 2013. V. 5. P. 572–577.
Prokhozhev N.N., Mikhaylichenko O.V., Bashmakov D.A., Sivachev A.V., Korobeynikov A.G. Issledovanie effektivnosti primeneniya statisticheskikh algoritmov kolichestvennogo steganoanaliza v zadache detektirovaniya skrytykh kanalov peredachi informatsii // Programmnye sistemy i vychislitel'nye metody. 2015. № 3. S. 281–292. doi: 10.7256/2305-6061.2015.3.17233
Prokhozhev N., Mikhailichenko O., Sivachev A., Bashmakov D., Korobeynikov A.G. Passive Steganalysis Evaluation: Reliabilities of Modern Quantitative Steganalysis Algo

Abstract: The object of the study are the methods of stegan analysis in the area of discrete wavelet transformation of an image. The author investigate the influence of the fact of embedding in the region of a concrete wavelet transformation on the values of the coefficients of the regions of discrete cosine transform and image in order to improve the efficiency of detecting the fact of embedding into the discrete wavelet transformation domain. The influence of the fact of embedding in the region of discrete wavelet transformation on certain coefficients of regions of discretely cosine transform and discrete sine transformation of the image is shown. The author proposed to use certain coefficients to improve the quality of training of the support vector machine. Method of research: to assess the effectiveness of the steganoanalysis method proposed in the article using the proposed coefficients, a comparison of the efficiency of image classification with other popular steganoanalysis methods for the wavelet decomposition region is performed. As a steganographic influence, the values of the least significant bits of the coefficients of the discrete wavelet transform are used. Main results of the study is the possibility of using certain coefficients of discrete cosine transform and discretely sinus transformation of the region with the purpose of steganoanalysis in the region of discrete wavelet transformation is shown. According to the results of the study, an original method of steganoanalysis is proposed, which makes it possible to increase the efficiency of steganoanalysis for the LH and HL regions of the discrete wavelet transformation of the image. The obtained results can be used in the development of steganoanalysis systems to provide an effective detection of the fact of embedding into the discrete wavelet transformation region of an image.

Keywords: support vector machine, machine learning, discrete sine transform, discrete cosine transform, discrete wavelet transform, frequency domain, steganalysis, steganography, binary classification, wavelet domain

References:
Steganography: A Powerful Tool for Terrorists and Corporate Spies [Elektronnyy resurs]/ Stratfor Rezhim dostupa: https://www.stratfor.com/analysis/steganography-powerful-tool-terrorists-and-corporate-spies (Data obrashcheniya 17.07.2016)
An Overview of Steganography for the Computer Forensics Examiner [Elektronnyy resurs]/ Forensic Science Communications-July 2004 Rezhim dostupa: https://www.fbi.gov/about-us/lab/forensic-science-communications/fsc/july2004/research /2004_03_research01.htm (Data obrashcheniya 14.07.2016)
C. Gayathri, V. Kalpana Study on image steganography techniques-International Journal of Engineering and Technology (IJET) Vol 5 No 2 Apr-May 2013 Pages 572-577
Arooj Nissar, A. H. Mir Classification of steganalysis techniques: A study — Digital Signal Processing, Volume 20 Issue 6, December, 2010 Pages 1758-1770
Prokhozhev N.N., Mikhaylichenko O.V., Bashmakov D.A., Sivachev A.V., Korobeynikov A.G. Issledovanie effektivnosti primeneniya statisticheskikh algoritmov kolichestvennogo steganoanaliza v zad

Abstract: The article is devoted to the development and investigation of the structure of the neural network module, which is part of the authentication system for users of various information systems analyzing the parameters of handwriting dynamics. The algorithm for learning the neural network module is also considered. The main task that the neural network module should solve is the implementation of a binary classifier based on input characteristic vectors such as the Cartesian coordinates of the handwriting pattern along the abscissa and ordinate axes, as well as time cuts that allow describing the writing speed of the sample. For the structures of the neural network module considered in the experiment, an experiment was performed in which different volumes of handwriting samples were fed to the input in order to determine the most stable. A mathematical model of a neural network module and a genetic algorithm for its learning are described. The article also provides an overview of the structures of neural network modules that are used in other user authentication software for the dynamics of handwriting. The substantiation of the choice of the module structure based on the results of the experiment is presented. The software implementation of the neural network module is implemented in the Java programming language.

Keywords: binary classifier, machine learning, perceptron, genetic algorithm, artificial neural network, handwriting dynamics, authentication, biometrics, signature, password

References:
Jane Bromley, Isabelle Guyon, Yann LeCun, Eduard Sickinger, Roopak Shah Signature Verification using a "Siamese" Time Delay Neural Network // American Telephone and Telegraph Company. 1994. S. 737-744.
Julio Cesar Martínez-Romo , Francisco Javier Luna-Rosas,Miguel Mora-González On-line signature verification based on optimal feature representation and neural-network-driven fuzzy reasoning // MICAI 2009: Advances in Artificial Intelligence. 2009. №5845. S. 246-257.
Meetu Sangwan, Mr. Daulat Sihag Handwritten Signature Recognition, Verification and Dynamic Updation using Neural Network // International Journal of Advanced Research in Computer and Communication Engineering. 2015. №4. S. 218-221.
Debnath Bhattacharyya, Tai-Hoon Kim Signature Recognition using Artificial Neural Network // Advances in Computational Intelligence, Man-Machine Systems and Cybernetics. 2010. S. 183-187.
Prathiba M.K., Dr. L. Basavaraj Online handwritten signature verification system: A Review // International Jour

Abstract: The article consideres the accuracy of the steganoanalysis using the Weighted Stego algorithm in passive data transmission channel countermeasures using the method of embedding the spatial region of fixed digital images with the RGB color model into the smallest significant bit. The dependence of the accuracy of steganoanalysis by the Weighted Stego method on the fraction of a homogeneous background in the analyzed image was studied. The drop in the accuracy of pixel prediction in the background areas of the image is investigated using the prediction model proposed by the authors of the original Weighted Stego algorithm. The Weighted Stego steganoanalysis algorithm is investigated. The basis for the steganoanalysis algorithm is a model for predicting the pixel values of the analyzed image from adjacent pixels. To assess the effectiveness of the analysis, the BOWS2 collection was used. Embedding information is realized by changing the least significant bits of the image in the spatial domain with a payload of 3-5 %%. The effectiveness of the methods is determined taking into account the obtained truly positive, truly negative, false positive and false negative values of the classification of images. The fall in the accuracy of steganoanalysis by the Weighted Stego method is shown with an increase in the fraction of a homogeneous background in the analyzed image. The method of improvement of the pixel prediction model in the basis of Weighted Stego is proposed, which allows to level out the drop in accuracy with increasing the fraction of a homogeneous background in the analyzed image. The results of the work are useful to a specialist in the field of information protection in the tasks of detecting and countering a hidden data channel. The obtained results can be used in the development of steganoanalysis systems based on the Weighted Stego algorithm.

Keywords: steganalysis method accuracy, image spatial domain, statistical steganalysis, passive countermeasure, least significant bit, binary classification, steganalysis, steganography, steganographic embedding, steganalysis algorithm

References:
Gribunin V.G., Okov I.N., Turintsev I.V. Tsifrovaya steganografiya. M.:Solon-Press. 2016. 262 s.
Steganography: A Powerful Tool for Terrorists and Corporate Spies // Stratfor [Elektronnyy resurs]. Rezhim dostupa: https://www.stratfor.com/analysis/steganography-powerful-tool-terrorists-and-corporate-spies, svobodnyy. Yaz. angl. (data obrashcheniya 22.08.2017).
Gayathri C., Kalpana V. Study on image steganography techniques // International Journal of Engineering and Technology (IJET). 2013. V. 5. P. 572–577.
Prokhozhev N., Mikhailichenko O., Sivachev A., Bashmakov D., Korobeynikov A.G. Passive Steganalysis Evaluation: Reliabilities of Modern Quantitative Steganalysis Algorithms // Advances in Intelligent Systems and Computing. 2016. V. 451. R. 89–94. doi:10.1007/978-3-319-33816-3_9
Prokhozhev N.N., Mikhaylichenko O.V., Bashmakov D.A., Sivachev A.V., Korobeynikov A.G. Issledovanie effektivnosti primeneniya statisticheskikh algoritmov kolichestvennogo steganoanaliza v zadache detektirovaniya skrytykh kanalov peredachi infor

Abstract: The study is devoted to the algorithms and protocols of  an electronic digital signature, providing for the key information properties: its integrity, authenticity and accessibility. This article highlights the problems of modern cryptography and a possible way to solve them via creation of an electronic digital signature  that can withstand a quantum computer. The article concerns various mathematical primitives, which can increase the stability of existing cryptosystems when used together. This area of research is a new and promising one for the development of domestic cryptography. The theoretical methods of research used in this article include the theory of computational complexity, the theory of rings, fields and lattices, algorithmic aspects of lattice theory and their application in cryptography, in particular, the complexity of solving systems of linear Diophantine equations, the complexity of finding the shortest nonzero lattice vector And the vector of the lattice closest to the given vector, known approximate algorithms for these problems. We refer to experimental methods of research, such as carrying out statistical calculations and data analysis in the Mathlab mathematical environment, constructing elliptic curves in the mathematical environment of Mathcad, creating software implementations of the algorithm for generating a signature in Python, using precompiled modules from the NumPy library. It is planned to achieve the following results in the future: 1. The development of a methodology for constructing electronic digital signature schemes based on two independent computationally difficult problems; 2. The development of a polynomially complex electronic digital signature scheme based on fundamentally different mathematical primitives; 3. The estimation of the size of safe parameters of the developed EDS protocols; 4. The theoretical model of the growth of calculation time from the length of an electronic digital signature key.

Keywords: information security, elliptic curve, the lattice theory, cryptosystem, postquantum cryptography, the shortest vector problem, discrete logarithming, Pollard algorithm, information privacy, digital signature

References:
Piskova A.V., Korobeynikov A.G. Osobennosti primeneniya teorii reshetok v skhemakh elektronnoy tsifrovoy podpisi // Kibernetika i programmirovanie. 2016. № 2. S. 8-12.
GOST R 34.10-2012. Natsional'nyy standart Rossiyskoy Federatsii. «Informatsionnaya tekhnologiya. Kriptograficheskaya zashchita informatsii. Protsessy formirovaniya i proverki elektronnoy tsifrovoy podpisi», 2012.
Lyubashevsky V., Micciancio. Asymptotically efficient lattice-based digital signatures. Lecture in Computer Science. – 2008. – №4948. – p. 379–396.
Piskova A.V., Korobeynikov A.G. Razrabotka algoritma elektronnoy tsifrovoy podpisi, osnovannogo na zadachakh faktorizatsii i diskretnogo logarifmirovaniya na ellipticheskikh krivykh // Sbornik trudov IV Vserossiyskogo kongressa molodykh uchenykh SPb.: Universitet ITMO, 2015. S. 322–326.
Piskova A.V. Usilenie stoykosti skhemy autentifikatsii informatsii putem resheniya neskol'kikh vychislitel'no slozhnykh zadach // Nauchnye raboty uchastnikov konkursa "Molodye uchenye NIU ITMO" 2015 goda. 2016. S. 234-237.
Hoffstein J.,

Abstract: The article contains the studies, which are aimed at improving the precision of steganalysis in the sphere of digital image DWT. The authors analyze the causes of inaccuracy of the modern stegoanalysis methods based upon the support vectors, then they offer the directions for improving the teaching quality. In order to improve the quality of teaching support vectors machine the authors study the interrelation between the spheres of one-dimensional and two-dimensional DWT and the influence of the changes in the coefficients of the high frequency spheres of the two-dimensional DWT upon the coefficient spheres of the one-dimensional DWT.  The steganographic influence involves the change in the value of the lower meaning bit coefficients of the DWT. Considering the study results the authors develop an original method, guaranteeing greater precision in the sphere of finding incorporated information in the high frequency areas of the two-dimensional DWT image.  In order to prove the precision of the original method, the authors compare it with some modern steganalysis methods. Experimental results of a comparative study prove that the original method provides for greater precision (generally 10-15% higher than other evaluated methods) when detecting the fact of steganographic influence in high frequency areas of HL and LH of the two-dimensional DWT. The original method also provides for the same precision in the high frequency HH area, as do other modern methods evaluated in this article.

Keywords: DVT, steganalysis, support vector machine , data hiding, steganogram, efficiency of steganalysis, machine learning , passive attack, binary classification, steganography

References:
Konakhovich G.F. Otsenka effektivnosti metodov steganograficheskogo vstraivaniya informatsii v spektral'nuyu oblast' izobrazheniy [Tekst], Avtomatizirovannye sistemy upravleniya i pribory – 2014.-№168 – S. 59-63.
AroojNissar, A. H. MirClassification of steganalysis techniques: A study [Tekst], Digital Signal Processing, Volume 20 Issue 6, December, 2010Pages 1758-1770.
Prokhozhev N., Mikhailichenko O., Sivachev A., Bashmakov D., Korobeynikov A.G. Passive Steganalysis Evaluation: Reliabilities of Modern Quantitative Steganalysis Algorithms [Tekst], Advances in Intelligent Systems and Computing. 2016. Vol. 451. pp. 89-94.
Gireesh Kumar T., Jithin R., Deepa D. Shankar Feature Based Steganalysis Using Wavelet Decomposition and Magnitude Statistics [Tekst], Advances in Computer Engineering (ACE), 2010, pp. 298-300.
Farid, Hany Detecting Steganographic Messages in Digital Images [Tekst], Technical Report TR2001-412, Dartmouth College, Computer Science Department, 2001.
Changxin Liu, Chunjuan Ouyang, Ming Guo,

Abstract: The subject of research is mathematical software software certification procedures for information security requirements in view of time constraints, regulatory and design requirements. This essential requirement is the availability of the source code on the test software, which is quite critical for developers as a potential channel formed intellectual property leakage. To overcome this drawback, the technique of testing the compilers on the lack of mechanisms for the implementation of undeclared capabilities to stage software compilation. The research methodology combines the methods of software engineering, theory of possibilities of object-oriented programming, systems analysis, the theory of reliability. The main conclusion of the study is that by forming an optimal set of tests using the mathematical apparatus of the theory of games, spending his compiling and analyzing the control flow graphs and data obtained from the compiler output and built according to the original texts of the tests, we can conclude the presence or absence in the test compiler mechanisms introduction of undeclared capabilities in the compiled software.

Keywords: information security, software engineering, software compilation, introduction of undeclared capabilities, compilers testing, software certification, software, software security, program analysis, certification testing programs

References:
Butusov I.V., Nashchekin P.A., Romanov A.A. Teoretiko-semanticheskie aspekty organizatsii kompleksnoy sistemy zashchity informatsionnykh sistem // Voprosy kiberbezopasnosti. 2016. № 1 (14). S. 9-16.
Fedorov M.V., Kalinin K.M., Bogomolov A.V., Stetsyuk A.N. Matematicheskaya model' avtomatizirovannogo kontrolya vypolneniya meropriyatiy v organakh voennogo upravleniya // Informatsionno-izmeritel'nye i upravlyayushchie sistemy. 2011. T. 9. № 5. S. 46-54.
Bogomolov A.V., Chuykov D.S., Zaporozhskiy Yu.A. Sredstva obespecheniya bezopasnosti informatsii v sovremennykh avtomatizirovannykh sistemakh // Informatsionnye tekhnologii. 2003. № 1. S. 2.
Golosovskiy M.S. Model' otsenivaniya pogreshnostey prognozirovaniya srokov razrabotki programmnogo obespecheniya // Programmnye sistemy i vychislitel'nye metody. 2015. № 3. S. 311-322.
Borodakiy Yu.V., Kulikov G.V., Nepomnyashchikh A.V. Metodika otsenivaniya funktsional'nykh vozmozhnostey sistem obnaruzheniya vtorzheniy na osnove ranzhirovaniya stepeni opasnosti atak // Izvestiya YuFU. Tekhnicheskie nauki. 2006. № 7 (62). S.

Abstract: Object of the research in a broad sense is the system of document flow of the commercial enterprise rendering services to the population and using the Internet network as the main environment of communication with the client. At the same time for support of validity of agreements between the enterprise and its clients the traditional "paper" document flow based on delivery of documents on the solid carrier with use of a mail service is used. An object of a research is a process of aloof information processing on client side in conditions when the enterprise as the contractor of the transaction, has no opportunity to control this process. Special attention in article is paid to questions of reasons for economic feasibility of implementation of the offered process of aloof document handling.The systems concept and in particular authoring technologies of the ontological analysis is the basis methodologists of a research. On the basis of the analysis of an ontological domain model the specific technical solution of safety of technological process of aloof document handling is proposed and the event model of this process is synthesized. This model is probed with use of approaches of the algebraic theory of risk.Scientific novelty of a research consists in a unique combination of the technical solutions providing the solution of an objective. The preliminary analysis of the market showed absence of similar decisions in practice of the interested companies. The main outputs of the conducted research is an opportunity and feasibility of use of technologies of aloof document handling as transition stage to completely electronic document management between the commercial enterprise and its contractors of arbitrary nature.

Keywords: total cost of ownership, Petri net, security policy, conceptual model, threat model, document, data integrity, digital signature, legal recognition, QR-code

References:
Borodin, A. V. Igry na setyakh Petri / A. V. Borodin // Obozrenie prikladnoy i promyshlennoy matematiki. – 2002. – T. 9. – №1. – S. 167.
Borodin, A. V. Metodologicheskie osnovy modelirovaniya v zadachakh ekonomiki bezopasnosti / A. V. Borodin // Sovremennye problemy i perspektivy sotsial'no-ekonomicheskogo razvitiya predpriyatiy, otrasley, regionov. – Yoshkar-Ola: Povolzhskiy gosudarstvennyy tekhnologicheskiy universitet, 2014. – C. 217-222.
Borodin, A. V. Metod ontologicheskogo analiza IDEF5 v zadachakh strukturnogo sinteza dinamicheskikh modeley ugroz / A. V. Borodin // Obozrenie prikladnoy i promyshlennoy matematiki. – 2006. – T. 13. – №3. – S. 474-475.
Borodin, A. V. Obespechenie tselostnosti i podlinnosti kriticheskoy informatsii na bumazhnom nositele pri otchuzhdennoy obrabotke dokumenta / A. V. Borodin, R. Yu. Nikitin, A. I. Shiryaev // Prioritetnye napravleniya razvitiya nauki i obrazovaniya: materialy X Mezhdunarodnoy nauchno–prakticheskoy konferentsii (Cheboksary, 16 oktyabrya 2016 g.). – Cheboksary: TsNS «Interaktiv plyus», 2016. –

Abstract: The object of the research is the mechanism of dynamic authentification via keystroke dynamics. The author examines reinforced authentification of users in Learning Management Systems whereas e-learning gradually occupying a niche in the education environment. The purpose of the present research is to develop and verify the system of dynamic authentification. Special attention is paid to analyzing biometric authentification and developing architectures of the required system and algorithm for classifying users based on the classifier's parameter learning as well as testing results. The author of the article carried out analysis of methods and algorithms that are used in the field of dynamic authentification and offers his alternative solution of the problem. The main results of the research include: architecture of the user authentification mechanism in Learning Management Systems; and description of the algorithm for dividing users into two classes. In accordance with the obtained requirements for the system, the author implemented the aforesaid mechanism in practice and conducted testing of the mechanism. The test shows that the desired result was obtained for the first- and second-order errors. The mechanism of keystroke dynamic authentification can be used not only in Learning Management Systems but also in other systems similar to the violator's model. 

Keywords: parametric classifier, biometrics, Learning Management System, strong authentication, biometric authentication, keystroke dynamics, security, dynamic authentication, confidentiality, behavioral authentication

References:
Khodashinskiy I.A. i dr. Tekhnologiya usilennoy autentifikatsii pol'zovateley informatsionnykh protsessov // Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki. 2011. № 2-3. S. 236-248.
Bryukhomitskiy Yu.A. Metod obucheniya neyrosetevykh biometricheskikh sistem na osnove kopirovaniya oblastey / Yu.A. Bryukhomitskiy, M.N. Kazarin // Perspektivnye informatsionnye tekhnologii i intellektual'nye sistemy (Elektronnyy zhurnal). 2003. № 3(15). S. 17–23.
Chalaya L.E. Model' identifikatsii pol'zovateley po klaviaturnomu pocherku // Iskusstvennyy intellekt. 2004. № 4. S. 811-817.
Ivanov A.I. Biometricheskaya identifikatsiya lichnosti po dinamike podsoznatel'nykh dvizheniy. Penza: Izd-vo Penz. gos. un-ta, 2000. 188 s.

Abstract: The subject of the study is the scheme of digital signature, which is an important element in building secure systems used in most real-world security protocols. Reliability of existing schemes of electronic digital signature can be severely lowered in case of developments in classical cryptanalyst or progress in the development of quantum computers. A potential alternative approach is to construct the schemes based on the complexity of certain properties of the lattices, which are supposed to be intractable for quantum computers. Due to significant scientific advances in recent years, scheme based on lattice theory already used in practice and is a very viable alternative to number-theoretic cryptography. The study is based on the use of methods of lattice theory. This choice is dictated by the lack of solution of problem of finding the shortest vector or finding the nearest vector in polynomial time. The main conclusion of the paper is that the main area of future development in the schemes of the digital signature on the basis of lattice theory is their optimization and implementation of the Fiat-Shamir model in it. For example, Bliss scheme showed high performance and therefore it can be integrated into portable systems and devices.

Keywords: digital signature, RSA, post-quantum cryptography, Bliss scheme, cryptography, Fiat-Shamir transformation, lattice theory, Abelian group, Euclidean space, identification scheme

References:
Ozgur Dagdelen, Marc Fischlin, Tommaso Gagliardoni. The Fiat-Shamir Transformation in a Quantum World // ASIACRYPT.-2013.-№2.-R. 62–81.
Thomas Poppelmann and Tim Guneysu. Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware//LATINCRYPT. – 2012. – R. 139–158.
Korobeynikov A.G., Kutuzov I.M. Algoritm obfuskatsii// NB: Kibernetika i programmirovanie. — 2013.-№ 3.-S.1-8. DOI: 0.7256/2306-4196.2013.3.9356. URL: http://e-notabene.ru/kp/article_9356.html
Korobeynikov A.G., Vorob'ev A. O., Sidorkina I. G., Pylin V. V. Analiz kriptograficheskoy stoykosti algoritmov asimmetrichnogo shifrovaniya informatsii//Izv.VUZOV. Priborostroenie. 2007. T. 50. № 8., str. 28-32.
Vadim Lyubashevsky. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures // ASIACRYPT.-2009. – R. 598–616.
Vadim Lyubashevsky. Lattice Signatures without Trapdoors // EUROCRYPT.-2012. – R. 738–755.
Leo Ducas and Daniele Micciancio. Improved Short Lattice Signatures in the Standard Mode

Abstract: The article deals with the problem of automated data collection from web-resources. The authors present a classification of detection methods taking into account modern approaches. The article shows an analysis of existing methods for detection and countering web robots. The authors study the possibilities and limitations of combining methods. To date, there is no open system of web robots detection that would be suitable for use in real conditions. Therefore the development of an integrated system, that would include a variety of methods, techniques and approaches, is an urgent task. To solve this problem the authors developed a software product – prototype of such detection system. The system was tested on real data. The theoretical significance of this study is in the development of the current trend in the domestic segment, making a system of web robots detection based on the latest methods and the improvement of global best practices. Applied significance is in creation of a database for the development of demanded and promising software.

Keywords: web-robots, information gathering, parsing, web robot detection, web security, information security, information protection, intrusion detection, intrusion prevention, weblogs analysis

References:
Gatchin Yu.A. Teoriya informatsionnoy bezopasnosti i metodologiya zashchity informatsii/Yu.A. Gatchin, V.V. Sukhostat.-SPb.: SPbGU ITMO, 2010.-98 s.
 BT. Loo, O. Cooper, S. Krishnamurthy Distributed Web Crawling over DHTs // University of California, Berkeley Department of Electrical Engineering and Computer Sciences. – 2004.
 DS. Sisodia, S. Verma, OP. Vyas Agglomerative Approach for Identification and Elimination of Web Robots from Web Server Logs to Extract Knowledge about Actual Visitors // Journal of Data Analysis and Information Processing. – 2015. – V. 3. – P. 1–10.
 TH. Sardar, Z. Ansari Detection and Confirmation of Web Robot Requests for Cleaning the Voluminous Web Log Data // Proceeding International Conference on the IMpact of E-Technology on US. – 2014. – V. 28. – P. 795–802.
 G. Jacob, E. Kirda, C. Kruegel, G. Vigna PUB CRAWL: Protecting Users and Businesses from CRAWLers // Proceeding Security'12 Proceedings of the 21st USENIX conference on Security symposium. – 2012. – P. 25–36.
 S. Kwon, Y

Abstract: The subjects of the study are the basic methods and principles of testing software systems used in the interest of the safety evaluation and control of automated systems. The study provides recommendations on the methods of software testing for the most common threats to security subsystems such as firewall, audit; access control; integrity monitoring; password and encryption. The authors considered the possibility that the product could contain the following vulnerabilities: buffer overflow, incorrect handling of format means, race problems. The research methods include the methods of the theory of programming, theory of reliability, software engineering, error-correcting coding, information security, system analysis. The main conclusion of the study is that software testing is a powerful tool to detect both errors in the software and security vulnerabilities. Modern methods of behavioral testing allow to identify vulnerabilities without software source code and can be used successfully in the Russian market, where accessing the source code for testing purposes is almost impossible.

Keywords: structural testing, software engineering, program testing method, Security Subsystem, software vulnerabilities, behavioral testing, testing programs, information security, safety of the automated system, threat security programs

References:
Men'shikh V.V., Pastushkova E.A. Generatsiya variantov sinteza upravlyayushchikh vozdeystviy dlya prinyatiya resheniy v sistemakh kriticheskogo primeneniya s ispol'zovaniem funktsional'no izbytochnogo nabora deystviy // Sistemy upravleniya i informatsionnye tekhnologii. 2014. T. 57. № 3. S. 15-19.
Fedorov M.V., Kalinin K.M., Bogomolov A.V., Stetsyuk A.N. Matematicheskaya model' avtomatizirovannogo kontrolya vypolneniya meropriyatiy v organakh voennogo upravleniya // Informatsionno-izmeritel'nye i upravlyayushchie sistemy. 2011. T. 9. № 5. S. 46-54.
Markov A.S., Mironov S.V., Tsirlov V.L. Opyt testirovaniya setevykh skanerov uyazvimostey // Informatsionnoe protivodeystvie ugrozam terrorizma. 2005. № 5. S. 109-122.
Rudakov I.S., Rudakov S.V., Bogomolov A.V. Metodika identifikatsii vida zakona raspredeleniya parametrov pri provedeniya kontrolya sostoyaniya slozhnykh sistem // Informatsionno-izmeritel'nye i upravlyayushchie sistemy. 2007. T. 5. № 1. S. 66-72.
Grusho A.A., Grusho N.A., Timonina E.E. Iskusstvennaya nedostovernost' informatsii kak sredstvo ee zashchi

Abstract: The article researches methods, algorithms and computing devices for encoding, digital filtering and spectral analysis of signals. The subject of the study is methods of synthesis and analysis of devices for signals digital filtration and spectral analysis in system of residual classes. The proposed article presents efficiency analysis of synthesis of computing devices for non-positional digital signal processing in the system of residual classes. The authors show results of comparative evaluation of performance of computing devices for digital filtering and spectral analysis. The authors propose a method of increasing the speed of digital devices in the system of residual classes. The research is based on the apparatus of mathematical analysis, mathematical logic, theory of algorithms, theory of algebraic integers, automata theory, the theory of the discrete Fourier transform and fast variations, probability theory, mathematical methods and simulation. The study presents ways of solving the problem of implementation of digital signal processing algorithms in system of residual classes on modern signal processors taking into account peculiarities of the system of residual classes. Implementation of digital devices on digital signal processor intended for data processing in non-positional number systems, including system of residual classes, is a promising line of development digital signal processing devices.

Keywords: fast Fourier transform, residue number system module, speed, digital signal processor, residue number system, digital signal processing, hardware expenses, spectrum analysis, service simulating test, nonpositional notation

References:
Akushskiy I.Ya., Yuditskiy D.I. Mashinnaya arifmetika v ostatochnykh klassakh. – M.: Sov. radio, 1968. – 440 s.
Galanina N.A. Analiz nepozitsionnykh tsifrovykh fil'trov po kvazipozitsionnoy modeli // Vestnik Chuvashskogo universiteta. – 2000. – № 3-4. – S. 116.
Galanina N.A. Vybor formy kodirovannogo impul'snogo signala v nepozitsionnykh ustroystvakh abonentskogo dostupa // Vestnik Chuvashskogo universiteta. – 2008. – № 2. – S. 167-173.
Galanina N.A. Metody i vychislitel'nye ustroystva tsifrovoy obrabotki signalov v sisteme ostatochnykh klassov: dis. ... dokt. tekhn. nauk. – Kazan', 2010.
Galanina N.A. Metody i vychislitel'nye ustroystva tsifrovoy obrabotki signalov v sisteme ostatochnykh klassov: avtoref. dis. ... dokt. tekhn. nauk. – Kazan', 2010.
Galanina N.A. Sintez nerekursivnykh tsifrovykh fil'trov v sisteme ostatochnykh klassov // Vestnik Chuvashskogo universiteta. – 2009. – № 2. – S. 193-200.
Galanina N.A. Sintez funktsional'nykh moduley BPF v SOK // Vestnik Chuvashskogo universiteta. – 2005. – № 2. – S. 124-127.
Galanina

Abstract: The article presents a comparison of computational complexity of two logical classification algorithms: an algorithm of sequential search (brute force) and algorithm of inductive states prediction. Logic algorithms are implemented in Matlab. For comparison of the computational complexity of classification algorithms author uses Zakrevskiy technique. Classification problem is one of the main problems in detection of threats of cyber attacks in the information system. Information about the signs of cyber attacks detection can be received from various sources (sensors) of software and hardware of the information system, for example, antivirus tools, dumps RAM logs, hard drives, user logon information, etc. Each of those sources contain information that can be used to determine the presence of an attack on the system. The article reviews the problem of logical classification of already existing data using two algorithms: an algorithm of sequential search (brute force) and algorithm of inductive states prediction. The use of the adapted method of inductive states prediction allowed to reduce amount of computation and get the average gain K ≈ 9,3 and thereby reduce time of detection of computer attacks.

Keywords: logical classification algorithm, inductive algorithm, software, algorithm, threat, security, computational complexity, brute force, states prediction, Matlab

References:
Sidel'nikov, O.V. Primenenie metoda induktivnogo prognozirovaniya sostoyaniy dlya obnaruzheniya komp'yuternykh atak v informatsionno-telekommunikatsionnykh sistemakh / O.V. Sidel'nikov, V.N. Laptev, V.A. Sharay // Nauchnyy zhurnal KubGAU [Elektronnyy resurs]. – Krasnodar: KubGAU, 2011. – № 72(08). – 10 s. URL: http://ej.kubagro.ru/2011/08/pdf/37.pdf.
Sidel'nikov, O.V. Model' obnaruzheniya i identifikatsii komp'yuternykh atak v informatsionno-telekommunikatsionnykh sistemakh na osnove metoda in-duktivnogo prognozirovaniya sostoyaniy / O.V. Sidel'nikov // Informatsionnye tekhnologii v professional'noy deyatel'nosti i nauchnoy rabote. Sbornik materialov Vserossiyskoy nauchno-prakticheskoy konferentsii s mezhdunarodnym uchastiem: v 2 ch. Ch. 1. Materialy. – Yoshkar-Ola: Mariyskiy GTU, 2012. – S.177-182.
Sidel'nikov, O.V. Algoritm obnaruzheniya i identifikatsii komp'yuter-nykh atak v informatsionno-telekommunikatsionnykh sistemakh na osnove metoda induktivnogo prognozirovaniya sostoyaniy / O.V. Sidel'nikov // Perspektivy razvitiya informatsionnykh tekhnolo

Abstract: The article reviews the current state and perspectives of the evolvement of the electronic workflow systems in the activities of the law enforcement organizations of the Commonwealth of Independent States on the example of a multiservice network for secure exchange of criminalistics data between the Ministries of Internal Affairs (Polices) of the Commonwealth of Independent States. Information technologies provide rapid exchange of information between law enforcement agencies of the Commonwealth of Independent States.
The multiservice network of the secure exchange of criminalistics data between the Ministries of Internal Affairs (Polices) of the Commonwealth of Independent States is a hardware-software complex that includes software and automated workplace for the specialist.
Efficiency of the multiservice network is defined also by the amount of criminalistic data in the database, most actively filled by the Ministry of Internal Affairs of Russia , Belarus and Tajikistan.
The author suggests the ways of improvement of the multiservice network for secure exchange of criminalistics data between the Ministries of Internal Affairs (Polices) of the Commonwealth of Independent States regarding maintenance the legal significance of procedural documents transmitted within the network through the use of electronic signatures.

Keywords: multiservice network, relevant criminalistic information, law enforcement agencies of the CIS, informatization, investigation of crimes, secure data exchange, cooperation of law enforcement organizations, electronic workflow, criminalistic record, procedural documents

References:
Kuznetsova N.F. Glavnye tendentsii razvitiya rossiyskogo ugolovnogo zakonodatel'stva // «Ugolovnoe pravo v XXI veke». Materialy mezhdunarodnoy nauchnoy konferentsii na yuridicheskom fakul'tete MGU im. M.V. Lomonosova. – M.: Prospekt, 2002. – S. 10.
Doklad o khode vypolneniya v 2008-2009 godakh programm sotrudnichestva gosudarstv – uchastnikov Sodruzhestva Nezavisimykh Gosudarstv v bor'be s prestupnost'yu, terrorizmom, nezakonnym oborotom narkotikov, nezakonnoy migratsiey i torgovley lyud'mi // Elektronnyy resurs. Internet-portal SNG. http://www.e-cis.info/page.php?id=18819
Nauka-Svyaz' razrabotala set' obmena informatsiey «Kriminalistika SNG» mezhdu MVD gosudarstv-uchastnikov SNG. 03.07.2012. // Elektronnyy resurs. Investitsionnaya gruppa «Russkie fondy». http://www.rusfund.ru/news/group-news/2012/07/7892.html data dostupa 10.10.2012.
Konkursnaya dokumentatsiya po provedeniyu otkrytogo konkursa № 7/K-36 na pravo zaklyuchit' gosudarstvennyy kontrakt na vypolnenie opytno-konstruktorskoy raboty po teme: «Mul'tiservisnaya set' obmena

Abstract: The article presents an analytical review of ways to implement encoders input residues in the residue number system and justified their selection of optimal structures. Authors evaluates instrumental and time costs considered circuit solutions. The purpose of the study is to consider all possible options encoding input signals in residual classes with the modern element base and full advantage of the system of residual classes, evaluation of hardware and time complexity of these options and the selection and justification of the best solution in terms of the criteria indicated above. Hardware cost of encoders are expressed as logical number of two-input logical elements, and to an EPROM contained in the form of its information bits in capacity. Instrumental cost of encoders on logic circuits depends on how many parts the input sequence is divided. It is concluded that it is possible to further simplify logical encoders and, as a consequence, reduce hardware expenses.

Keywords: the element base, integrated circuit, scrambler, research, residual classes, digital signal, coding, bits, microcircuitry, hardware expenses

References:
Akushskiy, I. Ya. Mashinnaya arifmetika v ostatochnykh klassakh / I.Ya. Akushskiy, D.I. Yuditskiy. – M.: Sov. radio, 1968. – 440 s.
Galanina, N. A. Realizatsiya blokov shifratsii i deshifratsii signalov v nepozitsionnykh ustroystvakh TsOS / N.A. Galanina, N.N. Ivanova, A.A. Ivanov // Vestnik Chuvashskogo universiteta. – 2007. – № 2. – S. 166-173.
Lebedev, E. K. Sposoby kodirovaniya v nepozitsionnykh vychislitel'nykh ustroystvakh / E.K. Lebedev // Proektirovanie EVM: mezhvuz. sb. nauch. trudov. – Ryazan': Izd-vo RRTI, 1992. – S. 104-109.
Strekalov, Yu. A. Realizatsiya arifmetiko-logicheskogo ustroystva, funktsioniruyushchego v sisteme schisleniya v ostatochnykh klassakh na PLIS / Yu.A. Strekalov // Infokommunikatsionnye tekhnologii. – 2004. – T. 2. – № 4. – S. 46-48.
Ugryumov, E. P. Tsifrovaya skhemotekhnika: ucheb. posobie dlya vuzov / E.P. Ugryumov. – SPb.: BKhV-Peterburg, 2004. – 800 s.
N.A. Galanina, D.D. Dmitriev Sintez BPF na PLIS s primeneniem
sistemy ostatochnykh klassov // Programmnye sistemy i vychislitel'nye metody. - 2013. - 1. - C. 129 - 133.

Abstract: Modern computer technology makes it a variety of tasks relevant to the field of information security. For example, for the protection of copyright in the images methods of steganography are used. To solve the problem of proving authorship (or vice versa) code obfuscation techniques are used. Obfuscation (from Lat. Obfuscare - obscure, obfuscate, and English. Obfuscate - make non-obvious, confusing, confusing) or obfuscated code - is the process of bringing the source code or executable program code to the form, that keeps its functionality, but complicates the analysis, understanding algorithms and modification during decompilation. Currently, there are special programs called obfuscators that performes obfuscation to solve the task in different ways. The article discusses the techniques of obfuscation from the most basic to sophisticated polymorphic generators obfuscators performing the mathematical transformation of the code, as well as the relationship of obfuscation and efficiency of program code execution and reduce the size of the program. The authors describe further development of obfuscation techniques.

Keywords: optimization, obfuscator, recognition, methods of obfuscation, concealment of information, information protection, copyright, steganography, obfuscation, decompilation

References:
Korobeynikov A.G., Kuvshinov S.S. Cistema skrytoy peredachi soobshcheniy v graficheskikh izobrazheniyakh formata JPEG//Nauchno-tekhnicheskiy vest¬nik SPb GU ITMO– SPb: SPbGU ITMO, 2008.– vyp. 51.– s.152-159.
Analiz zaputyvayushchikh preobrazovaniy programm//CIT Forum URL: http://citforum.ru/security/articles/analysis/(data obrashcheniya: 21.03.2012).