The purpose of this article is to provide an overview of Microsoft cryptographic technologies. We review a cryptographic algorithms classification scheme along with Microsoft recommendations regarding the use of ciphers and hash functions. We show how cryptography can be used to solve problems different from encryption, including ultimate data destruction on hard drives, identity management, digital signatures etc. We conclude the article with an overview of cryptographic functions implementation in Windows and.NET Framework focusing on enterprise applications development.
The paper presents the implementation of a dynamic routing algorithm intended for use in networks-on-chip with a three-dimensional circulant topology of type C(N; s1, s2, s3). Compared with the classical algorithms A* or Dijkstra, the proposed algorithm does not require to calculate the entire path of the packet, but calculates the port number to which the packet should be sent so that it can reach the destination node. This makes it possible to significantly simplify the structure of the NoC router. The algorithm can be implemented as RTL state machine in routers for NoCs for finding the shortest routes between any two network nodes.
The proposed algorithm was tested on sets of optimal circulants. For this set, it is equal to 0.973 which is a sufficient indicator of efficiency of the algorithm for the task of implementing the algorithm in HDL at the level of a network-on-chip router, since this algorithm has linear complexity and can be easily implemented.
In 95 % of the cases considered, for a set of graphs with the number of vertices less than 300, the algorithm showed a result similar to that obtained using the Dijkstra algorithm. The computational time complexity of the created algorithm is similar to the complexity of the Dijkstra algorithm which is considered to be the reference when finding routes in networks-on-chip. When the number of vertices is more than 300, the algorithm becomes inefficient, since the diameters, calculated by “Sequent” algorithm, can be ten times higher than the optimal diameters calculated by the Dijkstra algorithm.
Distant learning has weaknesses related to missing tutor and kind of autodidacticism of the process, which may cause learner’s frustration in uncertain situations and force him or her to drop the learning course. Inasmuch as it is very important to help learner to select a set of needed courses, the article deals with the task of forming the optimal individual educational trajectory of a learner when studying massive open online courses on the basis of knowledge and skills of the learner, knowledge and skills he or she wants to acquire and prerequisite and postrequisite skills and knowledge of available courses. The mathematical model is proposed, and problems of integer programming are formulated, which allow to find the optimal individual educational trajectory for different preferences of the learner
In this paper we propose a new approach to teaching practical information security in higher school based on case studies. We justify its place in information security curriculum by providing an example from our experience of using the approach for BSc and MSc students of Higher School of Economics in the courses on "Technical and Organizational Aspects of Information Security" and "Information Security Technologies". This paper fills the gap in existing practices for teaching information security which currently lack in guidelines for designing case studies and integrating them into the curriculum.
In this paper, we propose two mathematical models intended for analyzing the russian sentence to detect noun phrases and participial clauses. Algorithm for participial clause identification is based on the concept of syntactic relation between verb and dependent syntactic units in the russian language. Considered algorithms designed on the basis of the proposed models can improve procedure of syntactic parsing.
Initial Coin Offering (ICO) is a new method of funds attraction by IT-projects that became especially popular in 2017—2018. Despite the decrease in the number of projects by 2019, the interest to ICO method is still high. Since, currently, methodological principles of initial coin offering are still insufficiently presented in scientific literature, the aim of the present article is to provide the general methodology for conducting initial coin offering, in the form of detailed description of its key steps. Primarily, in order to achieve the goals in the process of article preparation, the analysis of published scientific works in the scope of ICO was undertaken. Thereafter, blockchain projects having implemented ICO in the period from January 2013 to March 2019 were analyzed — both successful and high-quality ones, and failed ones. Among the analyzed projects there are: Mastercoin, Etherium, Waves, NEO, Nem, EOS,Stratis, Golos, Gnosis, Tron, KICKICO, Enigma, BitTorrent, TheDao, Tezos, CoinDash, OneCoin, Tithecoin, Nodio, SilberPfeil, Tingo and others. The result of the analysis is this article, where, based on ICO success criteria, confirmed by empirical research, and actual experience of the projects analyzed, the sequence of steps and actions, forming the basis of any ICO-campaign is provided. Moreover, the article provides specific practical recommendations that prevent possible errors on every step of initial coin offering implantation. The results obtained fill the gap in theoretical research on ICO methodology, and, furthermore can be useful at ICO organization in actuality of the market in 2019.
We propose a new method of optimal route search for an overlay channel built on top of a wireless sensor network. It allows to increase utilization of unused telecommunication and energy resources in wireless sensor networks without loss of their primary functions.
In this paper the method of statistical few view reconstruction of the geometrical characteristics of three-dimensional convex objects of irregular shape which are approximated by an ellipsoid of General form is under consideration. The statistical reconstruction is carried out with the usage of the basic features of a triad of its mutually orthogonal two-dimensional discrete projection images. The areas of two-dimensional projection images of an object and its linear sizes of one-dimensional projection images are taken as the basic characteristics. While describing an object sizes, we consider that the spatial geometrical characteristics of an object are its linear (dimensional) sizes and the average projected diameter of a three-dimensional image of an ellipsoid of General form, which approximates this object. While describing the object shape, we consider that the spatial geometrical characteristics of an object are represented by the coefficient of asphericity that is determined as the ratio of the maximum and minimum dimensions (axes) of the approximating ellipsoid.
This paper is an overview of Tor network users deanonymization methods. It describes passive and active attacks and theirs key features.
The directions of improvement of minimax methods for circuit design problems are considered. The choices of generalized quality criterion for the circuit design is discussed. It is concluded that the minimax criterion has advantages over other formulations of design targets. New approach to setting of individual objectives for each performance indicator is proposed. The approach extends well-known weighting techniques based on designer’s experience to the representation of arbitrary piecewise linear dependences. From the analysis of known minimax optimization algorithms, it was considered that the method of sequential linearized minimax solvings should be the basis of the computational algorithm. Main directions of the development of minimax optimization methods are proposed taking into account specific features of simulation algorithms included in the optimization procedure. The directions are based on the stepsize adaptability, asynchronous performances evaluations and the simulation accuracy control. The possible need for the multi-objective formulation of minimax problem is illustrated by the circuit example. An outline of the linear minimax optimization algorithm taking into account the possible multicriteria is presented.
An approach to the investigation into the dynamics of social networks is described. The results of a qualitative analysis of the social network based on a microblogging principle are represented. The network interaction is approximated as a dynamic system characterizing the number of senders and recipients of small content elements. The aim of the present paper is to make an investigation into the social network as a dynamical system, considering informational saturation and informational interaction between the senders and recipients. Systems without and with restrictions are investigated. It was determined that a social network, represented by a dynamic system considering saturation and interaction between the senders and recipients, is adequate. The parametric conditions of an asymptotic stability and forked bifurcation for the network dynamics are developed.
This study investigates main problems of automation and optimization of educational processes with the help of BPMS and Big Data. The questions concerning process modeling are raised, particularly related to the integration of process-oriented and business analysis systems. The main goal of study is to find possible new way to implement the ideas of metadata integrity, closed-loop process controls, data storage adapters and hidden processes discovery. These ideas are proven to be necessarily implemented in the new complex type of information systems and the corresponding methodology. The new structure for this type of systems is introduced with brief explanations of solutions and methodologies chosen for the task. The concept of process repositories, which could be found in previous works, is developed: process repositories are shown as the basis to create standardized interoperable components for the global educational information system. The working prototype partially implementing the concept is demonstrated in the case of online learning resources usage. The prototype describes the key aspects: metadata descriptions, data gathering and process mining. This leads to real prototype implementations of all elements introduced as the part of complex theoretical structure. The study proposes means to improve prototype and build the complete system out of it. In conclusion, the examples of working applications based on the idea are listed. The new complex structure, methodology description and working prototypes are the results of this study